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

Share/Save/Bookmark

Hurink, J.L. and Knust, S. (2001) Makespan minimization for flow-shop problems with transportation times and a single robot. Discrete Applied Mathematics, 112 (1-3). pp. 199-216. ISSN 0166-218X

[img]PDF
Restricted to UT campus only
: Request a copy
210Kb
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.
Item Type:Article
Faculty:
Electrical Engineering, Mathematics and Computer Science (EEMCS)
Research Group:
Link to this item:http://purl.utwente.nl/publications/63587
Official URL:http://dx.doi.org/10.1016/S0166-218X(00)00316-4
Export this item as:BibTeX
EndNote
HTML Citation
Reference Manager

 

Repository Staff Only: item control page