| Article ID: | iaor19982722 |
| Country: | Germany |
| Volume: | 20 |
| Issue: | 1 |
| Start Page Number: | 21 |
| End Page Number: | 28 |
| Publication Date: | Jan 1998 |
| Journal: | OR Spektrum |
| Authors: | Brucker P. , Neyer J. |
| Keywords: | tabu search |
In a multi-processor-tasks job-shop problem (MPTJSP) there is a machine set associated with each operation. All machines are needed for the whole processing period to process the operation. The objective is to find a schedule which minimizes the makespan. In a multi-mode job-shop problem (MMJSP) there is a set of machine sets associated with each operation. One has to assign a machine set to each operation and to solve the resulting MPTJSP such that the resulting makespan is minimized. For the MMJSP a tabu-search algorithm is presented. Computational results are reported.