scholarly journals A two-stage flow shop scheduling with a critical machine and batch availability

2012 ◽  
Vol 37 (1) ◽  
pp. 39-56 ◽  
Author(s):  
Enrique Gerstl ◽  
Gur Mosheiov
Keyword(s):  
Flow Shop ◽  
Setup Time ◽  
Flow Shop Scheduling ◽  
Medium Size ◽  
Two Stage ◽  
Total Load ◽  
Time Dynamic ◽  
Second Stage ◽  
Processing Times ◽  
Critical Machine

AbstractWe study a two-stage flowshop, where each job is processed on the first (critical) machine, and then continues to one of two second-stage (dedicated) machines. We assume identical (but machine-dependent) job processing times. Jobs are processed on the critical machine in batches, and a setup time is required when starting a new batch. The setting assumes batch-availability, i.e., jobs become available for the second stage only when their entire batch is completed on the critical machine. We consider three objective functions: minimum makespan, minimum total load, and minimum weighted flow-time. Polynomial time dynamic programming algorithms are introduced, which are numerically shown to be able to solve problems of medium size in reasonable time. A heuristic for makespan minimization is presented and shown numerically to be both accurate and efficient.

scholarly journals Batch Scheduling In A Two-Stage Flexible Flow Shop Problem

2014 ◽  
Vol 39 (1) ◽  
pp. 3-16 ◽  
Author(s):  
Enrique Gerstl ◽  
Gur Mosheiov ◽  
Assaf Sarig
Keyword(s):  
Flow Shop ◽  
Optimal Solution ◽  
Setup Time ◽  
Optimal Number ◽  
Two Stage ◽  
Second Stage ◽  
Flow Shop Problem ◽  
Batch Sizes ◽  
Batch Schedule ◽  
Identical Jobs

Abstract We study a special two-stage flexible flowshop, which consists of several parallel identical machines in the first stage and a single machine in the second stage. We assume identical jobs, and the option of batching, with a required setup time prior to the processing of a new batch. We also consider the option to use only a subset of the available machines. The objective is minimum makespan. A unique optimal solution is introduced, containing the optimal number of machines to be used, the sequence of batch sizes, and the batch schedule. The running time of our proposed solution algorithm is independent of the number of jobs, and linear in the number of machines

scholarly journals Minimization of Rental Cost for Specially Structured Scheduling Model with Setup Time and Transportation Time

2020 ◽  
Vol 9 (3) ◽  
pp. 2866-2869
Keyword(s):  
Flow Shop ◽  
Setup Time ◽  
Flow Shop Scheduling ◽  
Processing Unit ◽  
Optimal Sequence ◽  
Processing Times ◽  
Scheduling Model ◽  
Heuristic Technique ◽  
Important Means ◽  
State Of Affairs

In the paper under consideration we have developed a new heuristic technique, to get the optimal sequence in which the jobs are to be processed so as to minimize the utilization time for which the machines are required and hence optimize the total expenditure incurred in hiring the machines on rent in case of a two stage specially structured flow shop scheduling model under pre-defined rental policy in which the processing times and setup times are linked with their relative probabilities, together with time taken for transporting the jobs from one processing unit to the next unit. The study taken up is quite broader and relates to the state of affairs existing in industrial units. The method given in this paper is reasonably simple and easy to apply and also offer an important means for taking decision regarding achieving an optimal sequence of jobs. Algorithm given in this paper is also explained by means of a numerical example.

Two-stage flow-shop scheduling problem with non-identical second stage assembly machines

2013 ◽  
Vol 69 (9-12) ◽  
pp. 2215-2226 ◽  
Author(s):  
J. Navaei ◽  
S. M. T. Fatemi Ghomi ◽  
F. Jolai ◽  
M. E. Shiraqai ◽  
H. Hidaji
Keyword(s):  
Flow Shop ◽  
Flow Shop Scheduling ◽  
Scheduling Problem ◽  
Two Stage ◽  
Shop Scheduling ◽  
Second Stage

Memetic Algorithm Approach to Two-Stage Hybrid Flow Shop Scheduling Problem with Identical Parallel Machines

2013 ◽  
Vol 651 ◽  
pp. 548-552
Author(s):  
Parinya Kaweegitbundit
Keyword(s):  
Genetic Algorithm ◽  
Simulated Annealing ◽  
Parallel Machines ◽  
Flow Shop ◽  
Memetic Algorithm ◽  
Flow Shop Scheduling ◽  
Hybrid Flow Shop ◽  
Scheduling Problems ◽  
Two Stage ◽  
Hybrid Flow Shop Scheduling

This paper considers two stage hybrid flow shop (HFS) with identical parallel machine. The objectives is to determine makespan have been minimized. This paper presented memetic algorithm procedure to solve two stage HFS problems. To evaluated performance of propose method, the results have been compared with two meta-heuristic, genetic algorithm, simulated annealing. The experimental results show that propose method is more effective and efficient than genetic algorithm and simulated annealing to solve two stage HFS scheduling problems.

Sign in / Sign up

Export Citation Format

Share Document