Mathematical Methods of Operations Research

, Volume 48, Issue 3, pp 359–375 | Cite as

Heuristics for short route job shop scheduling problems

  • Inna G. Drobouchevitch
  • Vitaly A. Strusevich

Abstract.

We consider two “minimum”NP-hard job shop scheduling problems to minimize the makespan. In one of the problems every job has to be processed on at most two out of three available machines. In the other problem there are two machines, and a job may visit one of the machines twice. For each problem, we define a class of heuristic schedules in which certain subsets of operations are kept as blocks on the corresponding machines. We show that for each problem the value of the makespan of the best schedule in that class cannot be less than 3/2 times the optimal value, and present algorithms that guarantee a worst-case ratio of 3/2.

Key words: job shop scheduling approximation algorithm worst-case analysis 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 1998

Authors and Affiliations

  • Inna G. Drobouchevitch
    • 1
  • Vitaly A. Strusevich
    • 1
  1. 1.School of Computing and Mathematical Sciences, University of Greenwich, Wollwich Campus, Wellington Street, London SE18 6PF, UK (e-mail: I.Drobouchevitch@greenwich.ac.uk; V. Strusevich@greenwich.ac.uk)GB

Personalised recommendations