Minimizing makespan in a two-machine flowshop with dynamic arrivals allowed

Authors:
Chang Sup Sung;Young Hwan Kim
Affiliations:
Department of Industrial Engineering, Korea Advanced Institute of Science and Technology, 373-1 Kusong-dong, Yusong-gu, Taejon, South Korea;Department of Industrial Engineering, Korea Advanced Institute of Science and Technology, 373-1 Kusong-dong, Yusong-gu, Taejon, South Korea
Venue:
Computers and Operations Research
Year:
2002

Citing 2
Cited 11

Batching and scheduling jobs on batch and discrete processors

Operations Research
Efficient algorithms for scheduling semiconductor burn-in operations

Operations Research

Minimizing makespan for multi-spindle head machines with a mobile table

Computers and Operations Research
A Two-Stage Flexible Flowshop Problem with Deterioration

COCOON '08 Proceedings of the 14th annual international conference on Computing and Combinatorics
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
Steelmaking and refining coordinated scheduling problem with waiting time and transportation consideration

Computers and Industrial Engineering
Two-stage hybrid flow shop scheduling with dynamic job arrivals

Computers and Operations Research
Enhanced mixed integer programming model for a transfer line design problem

Computers and Industrial Engineering
Minimizing makespan in a two-machine flowshop scheduling with batching and release time

Mathematical and Computer Modelling: An International Journal
On-line integrated production and outbound distribution scheduling to minimize the maximum delivery completion time

Journal of Scheduling
Tabu search and lower bounds for a combined production-transportation problem

Computers and Operations Research

Quantified Score

Hi-index	0.01

Visualization

Abstract

This paper considers a scheduling problem for a two-machine flowshop where a discrete processing machine is followed by a batch processing machine and a finite number of jobs arrive dynamically at the first machine. In the flowshop, the discrete processing machine processes one job at a time and the batch processing machine processes a batch of jobs simultaneously. The objective is to find the optimal schedule which minimizes the maximum completion time (makespan) of all jobs. In the situation where preemption is allowed on the discrete processing machine, it is shown that the optimal schedule can be found in polynomial time. However, in the situation where no preemption is allowed on the discrete processing machine, it is shown that the problem is NP-complete, for which an efficient heuristic solution algorithm is constructed and its tight worst-case error bound is derived. Numerical experiments show that the heuristic algorithm consistently generates good schedules.