Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/27316
Title: Complexity results for flow-shop and open-shop scheduling problems with transportation delays
Authors: Brucker, P
Knust, S
Cheng, TCE 
Shakhlevich, NV
Keywords: Complexity results
Scheduling
Shop problems
Time-lags
Transportation delays
Issue Date: 2004
Publisher: Springer
Source: Annals of operations research, 2004, v. 129, no. 1-4, p. 81-106 How to cite?
Journal: Annals of operations research 
Abstract: We consider shop problems with transportation delays where not only the jobs on the machines have to be scheduled, but also transportation of the jobs between the machines has to be taken into account. Jobs consisting of a given number of operations have to be processed on machines in such a way that each machine processes at most one operation at a time and a job is not processed by more than one machine simultaneously. Transportation delays occur if a job changes from one machine to another. The objective is to find a feasible schedule which minimizes some objective function. A survey of known complexity results for flow-shop and open-shop environments is given and some new complexity results are derived.
URI: http://hdl.handle.net/10397/27316
ISSN: 0254-5330
EISSN: 1572-9338
DOI: 10.1023/B:ANOR.0000030683.64615.c8
Appears in Collections:Journal/Magazine Article

Access
View full-text via PolyU eLinks SFX Query
Show full item record

SCOPUSTM   
Citations

35
Last Week
0
Last month
0
Citations as of May 21, 2020

WEB OF SCIENCETM
Citations

28
Last Week
0
Last month
0
Citations as of May 25, 2020

Page view(s)

166
Last Week
0
Last month
Citations as of May 6, 2020

Google ScholarTM

Check

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.