| Article ID: | iaor19972303 |
| Country: | Netherlands |
| Volume: | 70 |
| Issue: | 1 |
| Start Page Number: | 57 |
| End Page Number: | 73 |
| Publication Date: | Apr 1997 |
| Journal: | Annals of Operations Research |
| Authors: | Brucker Peter, Jurisch Bernd, Krmer Andreas |
In a multi-purpose machine scheduling problem, jobs or operations can be processed by any machine of prespecified subsets of the machine set. In this paper, the authors study the computational complexity of such scheduling problems. They study scheduling problems with identical and uniform machines as well as problems with shop characteristics.