| Article ID: | iaor1997864 |
| Country: | Netherlands |
| Volume: | 58 |
| Issue: | 2 |
| Start Page Number: | 145 |
| End Page Number: | 156 |
| Publication Date: | Mar 1995 |
| Journal: | Discrete Applied Mathematics |
| Authors: | Jurisch Bernd |
| Keywords: | optimization |
The job-shop problem on multi-purpose machines (MPM job-shop problem) arises in the area of flexible manufacturing systems. It is a generalization of the classical job-shop scheduling problem. The paper develops a lower bound for the MPM job-shop problem. It is based on a two-job relaxation which can be solved efficiently by using geometric methods.