Tabu search algorithms for job-shop problems with a single transport robot
Autor(en): | Hurink, J Knust, S |
Stichwörter: | Business & Economics; ENVIRONMENT; job-shop problem; Management; Operations Research & Management Science; robot; scheduling; SCHEDULING PROBLEM; tabu search; TIMES; transportation | Erscheinungsdatum: | 2005 | Herausgeber: | ELSEVIER SCIENCE BV | Journal: | EUROPEAN JOURNAL OF OPERATIONAL RESEARCH | Volumen: | 162 | Ausgabe: | 1 | Startseite: | 99 | Seitenende: | 111 | Zusammenfassung: | We consider a generalized job-shop problem where the jobs additionally have to be transported between the machines by a single transport robot. Besides transportation times for the jobs, empty moving times for the robot are taken into account. The objective is to determine a schedule with minimal makespan. We present local search algorithms for this problem where appropriate neighborhood structures are defined using problem-specific properties. An one-stage procedure is compared with a two-stage approach and a combination of both. Computational results are presented for test data arising from job-shop benchmark instances enlarged by transportation and empty moving times. (C) 2003 Elsevier B.V. All rights reserved. |
Beschreibung: | 14th Annual Meeting of the European Chapter on Combinatorial Optimization (ECCO 14), Univ Bonn, Bonn, GERMANY, MAY 31-06, 2001-2003 |
ISSN: | 03772217 | DOI: | 10.1016/j.ejor.2003.10.034 |
Zur Langanzeige
Seitenaufrufe
3
Letzte Woche
0
0
Letzter Monat
0
0
geprüft am 08.05.2024