| Article ID: | iaor19911580 |
| Country: | Switzerland |
| Volume: | 26 |
| Start Page Number: | 269 |
| End Page Number: | 287 |
| Publication Date: | Dec 1990 |
| Journal: | Annals of Operations Research |
| Authors: | Pinson E., Carlier J. |
In this paper, the authors present a polynomial algorithm for optimally adjusting heads and tails in the job shop problem. This algorithm is based on Jackson’s preemptive schedule for the one-machine problem. The authors next use this algorithm to construct a new branch and bound method. Computational results show the superiority of this method over the classical ones.