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.
Similar content being viewed by others
Author information
Authors and Affiliations
Additional information
Received March 1997/Revised version November 1997
Rights and permissions
About this article
Cite this article
Drobouchevitch, I., Strusevich, V. Heuristics for short route job shop scheduling problems. Mathematical Methods of OR 48, 359–375 (1998). https://doi.org/10.1007/s001860050033
Issue Date:
DOI: https://doi.org/10.1007/s001860050033