Makespan minimization for flow-shop problems with transportation times and a single robot

Research output: Contribution to journalArticleAcademicpeer-review

64 Citations (Scopus)
46 Downloads (Pure)

Abstract

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 F3||Cmax with constant processing times at certain stages.
Original languageEnglish
Pages (from-to)199-216
Number of pages18
JournalDiscrete applied mathematics
Volume112
Issue number1-3
DOIs
Publication statusPublished - Sep 2001

Fingerprint

Dive into the research topics of 'Makespan minimization for flow-shop problems with transportation times and a single robot'. Together they form a unique fingerprint.

Cite this