On-line two-machine job shop scheduling with time lags

Authors:
Xiandong Zhang;Steef van de Velde
Affiliations:
Department of Management Science, School of Management, Fudan University, Shanghai 200433, China;Rotterdam School of Management, Erasmus University, PO Box 1738, 3000 DR Rotterdam, The Netherlands
Venue:
Information Processing Letters
Year:
2010

Citing 3
Cited 1

On-line Scheduling

Developments from a June 1996 seminar on Online algorithms: the state of the art
Minimizing Makespan in a Two-Machine Flow Shop with Delays and Unit-Time Operations is NP-Hard

Journal of Scheduling
Analysis of heuristics for the UET two-machine flow shop problem with time delays

Computers and Operations Research

On-line integrated production and outbound distribution scheduling to minimize the maximum delivery completion time

Journal of Scheduling

Quantified Score

Hi-index	0.89

Visualization

Abstract

We consider the on-line two-machine job shop scheduling problem with time lags so as to minimize the makespan. Each job consists of no more than two operations and time lags exist between the completion time of the first and the start time of the second operation of any two-operation job. We prove that any greedy algorithm is 2-competitive. For the non-clairvoyant variant of the problem, no on-line algorithm can do better. For the clairvoyant variant, no on-line delay algorithm has a competitive ratio better than 5+12~1.618, and a greedy algorithm is still the best on-line non-delay algorithm. We also show that the same results hold for the two-machine flow shop problem with time lags.