A hybrid two-stage flowshop with limited waiting time constraints

Authors:
Ling-Huey Su
Affiliations:
Department of Industrial Engineering, Chung-Yuan Christian University, Chang-Li, Taiwan, ROC
Venue:
Computers and Industrial Engineering
Year:
2003

Citing 3
Cited 12

Batching and scheduling jobs on batch and discrete processors

Operations Research
Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem

Annals of Operations Research - Special issue on Tabu search
A two-machine flowshop sequencing problem with limited waiting time constraints

Computers and Industrial Engineering

The Waiting Time Distribution

Computers and Industrial Engineering
Minimizing makespan in a flow shop with two batch-processing machines using simulated annealing

Robotics and Computer-Integrated Manufacturing
Flowshop scheduling problems with transportation or deterioration between the batching and single machines

Computers and Industrial Engineering
A two-stage flow shop scheduling problem on a batching machine and a discrete machine with blocking and shared setup times

Computers and Operations Research
Batch delivery scheduling with limited waiting time constraint on a single machine

CCDC'09 Proceedings of the 21st annual international conference on Chinese control and decision conference
Tabu search heuristic for two-machine flowshop with batch processing machines

Computers and Industrial Engineering
A discrete time exact solution approach for a complex hybrid flow-shop scheduling problem with limited-wait constraints

Computers and Operations Research
Two-stage hybrid flow shop scheduling with dynamic job arrivals

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
A discrete colonial competitive algorithm for hybrid flowshop scheduling to minimize earliness and quadratic tardiness penalties

Expert Systems with Applications: An International Journal
A two-stage hybrid flowshop scheduling problem in machine breakdown condition

Journal of Intelligent Manufacturing
Optimal batch process admission control in tandem queueing systems with queue time constraint considerations

Proceedings of the Winter Simulation Conference

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we consider a hybrid two-stage flowshop with a batch processor in stage 1 and a single processor in stage 2. Each batch processor can process a batch (limited number) of jobs simultaneously. Once the process begins, no job can be released from the batch processor until the entire batch is processed. For each job the waiting time for the second stage cannot be greater than a given upper bound. The objective is to minimize the makespan. The two-stage flowshop sequencing problem with limited waiting constraints was shown to be NP-hard. A heuristic algorithm and a mixed integer program are proposed. The results of the experimental investigation of the effectiveness of the algorithms are also presented.