A 3 /2 Algorithm for Two-Machine Open Shopwith Route-Dependent Processing Times

Authors:
V. A. Strusevich;A. J. A. Van De Waart;R. Dekker
Affiliations:
University of Greenwich, London, U.K.;Erasmus University, Rotterdam, The Netherlands;Erasmus University, Rotterdam, The Netherlands
Venue:
Journal of Heuristics
Year:
1999

Citing 2
Cited 0

Improved Approximation Algorithms for Shop Scheduling Problems

SIAM Journal on Computing
Open Shop Scheduling to Minimize Finish Time

Journal of the ACM (JACM)

Quantified Score

Hi-index	0.00

Visualization

Abstract

Thispaper considers the problem of minimizing the schedule lengthof a two-machine shop in which not only can a job be assignedany of the two possible routes, but also the processing timesdepend on the chosen route. This problem is known to be NP-hard.We describe a simple approximation algorithm that guaranteesa worst-case performance ratio of 2. We also present some modificationsto this algorithm that improve its performance and guaranteea worst-case performance ratio of 3/2.