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 124 for “"Flow Shop"”.
-
Stochastic flow shop scheduling
… we present new results 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 …
-
Stochastic flow shop scheduling
… new 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 …
-
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 …
-
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
-
A critical analysis of flow-shop sequencing
Not available
-
Hybrid flow shop scheduling with specialised machines
… jobs may omit stages; material flows from one stage to the next as a continuous stream; and there is highly flexible inter-process storage of interim products. A simplified model, extending the hybrid flow shop model from the literature, is also presented.</p> <p>The scheduling …
-
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
… consumption. 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
… consumption. 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 …
-
Lot streaming in hybrid flow shop scheduling
… decades and is shown to accelerate production flow. This research deals with lot streaming in hybrid flow shops. Multiple products are processed in a multi-stage hybrid flow shop with non-identical machines. Sublots can be constant or consistent and intermingling is not allowed. Setups are …
-
A heuristic algorithm for flow shop sequencing problems
Not Available
-
Permutation Flow Shop via Simulated Annealing and NEH
Permutation Flow Shop Scheduling refers to the process of allocating operations of jobs to machines such that an operation starts to process on machine j only after the processing completes in j-1machine. At a time a machine can process only one operation and similarly a job can have only one …
-
Automatic algorithm configuration for flow shop scheduling problems
… to the optimization researchers for many years. Flow shop problems, in particular, are one of the most widely studied scheduling problems due to their application to many production environments. A large variety of solution methods can be found in the literature and, since many flow shop problems …
-
Including workers with disabilities in flow shop scheduling
… the inclusion of persons with disabilities into flow shops with the objective of minimizing the makespan. Since flow shops usually have only a few machines, we focus on the inclusion of one and two workers. We define the problem, propose mathematical models and a heuristic solution, as well as …
Page 1 of 7