Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/645
Title: Two-machine flowshop scheduling with conditional deteriorating second operations
Authors: Lin, BMT
Cheng, TCE 
Keywords: Flowshop scheduling
Waiting time
Makespan
NP-hardness
Issue Date: Mar-2006
Publisher: Blackwell Publishing
Source: International transactions in operational research, Mar. 2006, v. 13, no. 2, p. 91-98 How to cite?
Journal: International transactions in operational research 
Abstract: This paper considers a flowshop-scheduling problem with a waiting time constraint imposed to restrict the processing of the two operations of each job. If the second operation of a job cannot start within a specified waiting time after the completion of its first operation, then an extra processing time will be incurred for its second operation as a penalty. We first show that even a greatly restricted version of the problem is strongly NP-hard. We then develop an O(n²) algorithm to determine the makespan of a processing sequence of the jobs.
URI: http://hdl.handle.net/10397/645
ISSN: 0969-6016
DOI: 10.1111/j.1475-3995.2006.00536.x
Rights: © 2006 The Authors. Journal compilation © 2006 International Federation of Operational Research Societies. Published by Blackwell Publishing. The definitive version is available at www3.interscience.wiley.com.
Appears in Collections:Journal/Magazine Article

Files in This Item:
File Description SizeFormat 
Lag_Penalty_1215.pdfPre-published version122.19 kBAdobe PDFView/Open
Access
View full-text via PolyU eLinks SFX Query
Show full item record

Page view(s)

319
Last Week
0
Last month
Checked on Dec 4, 2016

Download(s)

465
Checked on Dec 4, 2016

Google ScholarTM

Check

Altmetric



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