Batching and scheduling jobs on batch and discrete processors
Operations Research
A two-machine flowshop sequencing problem with limited waiting time constraints
Computers and Industrial Engineering
Minimizing makespan in a two-machine flowshop with dynamic arrivals allowed
Computers and Operations Research
A hybrid two-stage flowshop with limited waiting time constraints
Computers and Industrial Engineering
Computers and Industrial Engineering
Integrating simulation and optimization to schedule a hybrid flow shop with maintenance constraints
Computers and Industrial Engineering
Computers and Operations Research
Mixed integer formulation to minimize makespan in a flow shop with batch processing machines
Mathematical and Computer Modelling: An International Journal
Hi-index | 0.01 |
Motivated by applications in semiconductor manufacturing industry, we consider a two-stage hybrid flow shop where a discrete machine is followed by a batching machine. In this paper, we analyze the computational complexity of a class of two-machine problems with dynamic job arrivals. For the problems belonging to P we present polynomial algorithms. For the NP-complete problems we propose the heuristics, and then establish the upper bounds on the worst case performance ratios of the heuristics. In addition, we give the improved heuristics that can achieve better performances.