Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 20 of 27 for “"Job shop scheduling"”.
-
Heuristics for job-shop scheduling
Thesis (Sc. D.)--Massachusetts Institute of Technology, Dept. of Mechanical Engineering, 1988.
-
Job Shop Scheduling with Flexible Maintenance Planning
This thesis considers the scheduling challenges encountered at a particular facility in the nuclear industry. The scheduling problem is modelled as a variant of the job shop scheduling problem. Important aspects of the considered problem include the scheduling of jobs with both soft and hard due …
-
An artificial intelligence approach to job-shop scheduling
Thesis (M.S.)--Massachusetts Institute of Technology, Sloan School of Management, 1984.
-
Job shop scheduling to minimize makespan with explicit material handling considerations
… by exploiting (i) Routing Flexibility and (ii) Scheduling Flexibility. Routing flexibility allows the selection of a machine on which an operation should be performed. Scheduling flexibility allows the determination of the processing sequence of jobs on a machine. Typically, the sequence of …
-
Combining heuristics and integer programming for optimizing job shop scheduling models
Thesis (M.S.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 1995.
-
Job shop scheduling to minimize work-in-process, earliness and tardiness costs
… relevant costs. Such a scenario is modelled as a job shop problem with non-regular performance measure (shorted as JIT-JSP). The objective of JIT-JSP is to minimize three inventory related costs: Work in process (WIP) holding, earliness and tardiness cost.Schedule generation procedures including …
-
Static and dynamic job-shop scheduling using rolling-horizon approaches and the Shifting Bottleneck Procedure
… of the SB procedure, the problem of re-scheduling jobs dynamically to take disruptions and local disturbances (machines breakdown, maintenance...) into consideration shows interesting perspectives for research. Dealing with local disturbances in a production environment and analyzing …
-
An adaptive representation for a genetic algorithm in solving flexible job-shop scheduling and rescheduling problems
Thesis (Ph. D.)--Michigan State University. Computer Science, 2010
-
Exact and Heuristic Algorithms for the Job Shop Scheduling Problem with Earliness and Tardiness Over a Common Due Date
<p>Scheduling has turned out to be a fundamental activity for both production and service organizations. As competitive markets emerge, Just-In-Time (JIT) production has obtained more importance as a way of rapidly responding to continuously changing market forces. Due to their realistic …
-
A study of heuristic scheduling
… is concerned with the subject of heuristic scheduling in the context of medium-sized batch and jobbing manufacture. A scheduling program involving up to 1500 jobs and 150 machines is described and the methods by which:conflicts were resolved and objective functions were measured is …
-
An evaluation of scheduling policies in a dual resource constrained assembly shop
Research in job shop scheduling has concentrated on sequencing simple, single component jobs that require no coordination of multiple parts for assembly. However, since most jobs in reality involve some assembly work, scheduling multiple component jobs through an assembly shop, where both serial …
-
Metaheurísticas basadas en población para la toma de decisiones en la programación de la producción
… versión modificada de un conocido problema de scheduling, el Flexible Job Shop Scheduling Problem, aproximado a la realidad más actual de las empresas mediante un novedoso marco que permite la priorización de los pedidos en función de sus principales características, teniendo en cuenta estas …
-
Firewall Policy Optimization and Management
… best order of firewall rules is equivalent to job-shop scheduling, a known NP-Hard problem. The sorting techniques are novel in that they consider sub-graphs of rules (inter-related by precedence constraints) and compare the advantage of placing and merging the nodes that comprise them. For …
-
Minimization of weighted tardiness in job shops using shifting bottleneck and tabu search procedures
Scheduling to meet set due dates is one of the most critical issues in modern production systems. One measure of schedule effectiveness in the presence of due dates is weighted tardiness since it can capture the cost of contractual penalties and other losses to an organization. This research work …
-
Análisis de la Relajación Lagrangiana como método de programación de talleres flexibles en un entorno multiagente
… This thesis is related to operations scheduling in distributed systems and analyzes the application of the Lagrangian Relaxation method as price mechanism in the context of iterative combinatorial auctions. The development of multiagent systems has enabled the implementation of …
-
Quality improvement, inventory management, lead time reduction and production scheduling in high-mix manufacturing environments
… approach to improving the accuracy of production scheduling and delivery date quotes through the use of job shop scheduling software and historical data analysis. The recommended fabrication request delivery date prediction process involves using a scheduling software to find the optimal delivery …
-
The scheduling of manufacturing systems using Artificial Intelligence (AI) techniques in order to find optimal/near-optimal solutions.
This thesis aims to review and analyze the scheduling problem in general and Job Shop Scheduling Problem (JSSP) in particular and the solution techniques applied to these problems. The JSSP is the most general and popular hard combinational optimization problem in manufacturing systems. For the …
Page 1 of 2