Makespan minimization for flow-shop problems with transportation times and a single robot
Autor(en): | Hurink, J Knust, S |
Stichwörter: | 2-MACHINE FLOWSHOP; CELL; complexity results; flow shop; Mathematics; Mathematics, Applied; PARTS; robot; transportation times | Erscheinungsdatum: | 2001 | Herausgeber: | ELSEVIER SCIENCE BV | Journal: | DISCRETE APPLIED MATHEMATICS | Volumen: | 112 | Ausgabe: | 1-3 | Startseite: | 199 | Seitenende: | 216 | Zusammenfassung: | in a flow-shop problem with transportation times and a single robot n jobs consisting of m operations have to be processed in the same order on m machines. Additionally, transportation times are considered if a job changes from one machine to another. We assume that unlimited buffer space exists between the machines and all transportations have to be done by a single robot. The objective is to determine a feasible schedule with minimal makespan. New complexity results are derived for special cases where the processing or transportation times are constant values. Some of these may also be interpreted as new results for special cases of the classical 3-machine flow-shop F3C-max with constant processing times at certain stages. (C) 2001 Elsevier Science B.V. All rights reserved. |
Beschreibung: | Combinatorial Optimization Symposium, BRUSSELS, BELGIUM, APR 15-17, 1998 |
ISSN: | 0166218X | DOI: | 10.1016/S0166-218X(00)00316-4 |
Zur Langanzeige
Seitenaufrufe
2
Letzte Woche
0
0
Letzter Monat
0
0
geprüft am 17.05.2024