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 181 for “"Shop scheduling"”.
-
Stochastic flow shop scheduling
… for the makespan and the flowtime in a flow shop without intermediate storage between machines. We consider m machines and n jobs with random processing times. Since there is no intermediate storage between machines, a job which has finished processing at one machine may have to stay at that …
-
Stochastic flow shop scheduling
… results for minimizing the makespan in a flow shop with zero storage between machines. Makespan is the total length of time required to process a set of jobs. We consider m machines and n jobs with random processing times. Since there is no intermediate storage between machines, a job that has …
-
Shop scheduling with availability constraints
Scheduling Theory studies planning and timetabling of various industrial and human activities and, therefore, is of constant scientific interest. Being a branch of Operational Research, Theory of Scheduling mostly deals with problems of practical interest which can be easily (from a mathematical …
-
Multi-routed job shop scheduling
… presented in this thesis is concerned with scheduling n jobs in an m work center job shop facility. The objective in this research was to develop scheduling methodologies which optimally or sub-optimally schedule n jobs on m work centers in a job shop or a Flexible Manufacturing System (FMS) …
-
Job-shop scheduling : Tabu list analysis
A tabu search based heuristic scheduling algorithm was investigated to determine which of four factors or their interactions affect tabu list utilization as the algorithm moves away from a local optimum. The four factors were machine routings, the machine processing time for each operation and the …
-
Flow shop scheduling with two machines
A flow shop problem has n jobs (i = 1.. , n) on m machines (j = 1, . . . , m) and a job consists two operations and the jth operation of each job must be processed on machine j. Any job can start only on machine j if it is completed on machine j-1 and if machine j is free. Each operation has a …
-
Intelligent shop scheduling for semiconductor manufacturing
… products at lower cost to remain competitive. Scheduling of semiconductor manufacturing is one of the keys to increasing productivity, however the complexity of manufacturing high capacity semiconductor devices and the cost considerations mean that it is impossible to experiment within the …
-
Two-machine job shop scheduling problem
Includes bibliographical references.
-
Energy aware hybrid flow shop scheduling
Only if humanity acts quickly and resolutely can we limit global warming' conclude more than 25,000 academics with the statement of SCIENTISTS FOR FUTURE. The concern about global warming and the extinction of species has steadily increased in recent years.
-
The bidirectional-ordered flow shop scheduling problem
Not available
-
Hybrid flow shop scheduling with specialised machines
… A simplified model, extending the hybrid flow shop model from the literature, is also presented.</p> <p>The scheduling of the system is approached in two steps. Firstly, we develop algorithms for solving the scheduling problems at each stage - parallel machines with processing set restrictions. …
-
Simulated Annealing Approach To Flow Shop Scheduling
Flow Shop Scheduling refers to the process of allotting various jobs to the machines given, such that every job starts to process on a machine n only after it has finished processing on machine n-1, with each job having n operations to be performed one per machine. To find a schedule that leads to …
-
Flow Shop Scheduling for Energy Efficient Manufacturing
… Thus, this thesis investigates the flow shop scheduling problems that reduce electricity costs under time-varying electricity rate. A time-indexed integer programming is proposed to identify the manufacturing schedules that minimize the electricity cost for a single factory with flow …
-
Flow Shop Scheduling for Energy Efficient Manufacturing
… Thus, this thesis investigates the flow shop scheduling problems that reduce electricity costs under time-varying electricity rate. A time-indexed integer programming is proposed to identify the manufacturing schedules that minimize the electricity cost for a single factory with flow …
-
Stochastic, Multi-Objective Job-Shop Scheduling Model
A stochastic, multi-objective job shop production scheduling model is developed in this research. The prediction of the impact of future scheduling decisions becomes uncertain because of the high integration among the scheduling constraints and the uncertainty of uncontrollable and unpredictable …
-
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 …
-
Lot streaming in hybrid flow shop scheduling
Production planning and scheduling play significant roles in manufacturing system operations and different techniques have been used to enhance their performance. Lot streaming has been studied for decades and is shown to accelerate production flow. This research deals with lot streaming in hybrid …
Page 1 of 10