| Article ID: | iaor20043562 |
| Country: | Netherlands |
| Volume: | 129 |
| Issue: | 1 |
| Start Page Number: | 81 |
| End Page Number: | 106 |
| Publication Date: | Jul 2004 |
| Journal: | Annals of Operations Research |
| Authors: | Brucker Peter, Shakhlevich Natalia V., Cheng T.C. Edwin, Knust Sigrid |
| Keywords: | computational analysis |
We consider shop problems with transportation delays where not only the jobs on the machines have to be scheduled, but also transportation of the jobs between the machines has to be taken into account. Jobs consisting of a given number of operations have to be processed on machines in such a way that each machine processes at most one operation at a time and a job is not processed by more than one machine simultaneously. Transportation delays occur if a job changes from one machine to another. The objective is to find a feasible schedule which minimizes some objective function. A survey of known complexity results for flow-shop and open-shop environments is given and some new complexity results are derived.