Tabu-search for the multi-mode job-shop problem
| Autor(en): | Brucker, P Neyer, J |
Stichwörter: | multi-mode job-shop; multi-purpose-machine job-shop; multiprocessor-task job-shop; MULTIPURPOSE MACHINES; Operations Research & Management Science; tabu-search | Erscheinungsdatum: | 1998 | Herausgeber: | SPRINGER VERLAG | Journal: | OR SPEKTRUM | Volumen: | 20 | Ausgabe: | 1 | Startseite: | 21 | Seitenende: | 28 | Zusammenfassung: | 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. |
ISSN: | 01716468 |
Zur Langanzeige
