PolyU IR
 

PolyU Institutional Repository >
Logistics and Maritime Studies >
LMS Journal/Magazine Articles >

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, B. M. T.
Cheng, T. C. Edwin
Subjects: Flowshop scheduling
Waiting time
Makespan
NP-hardness
Issue Date: Mar-2006
Publisher: Blackwell Publishing
Citation: International transactions in operational research, Mar. 2006, v. 13, no. 2, p. 91-98.
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.
Description: 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.
Type: Journal/Magazine Article
URI: http://hdl.handle.net/10397/645
ISSN: 09696016
Appears in Collections:LMS Journal/Magazine Articles

Files in This Item:

File Description SizeFormat
Lag_Penalty_1215.pdfPre-published version122.19 kBAdobe PDFView/Open
Locate publisher version via PolyU eLinks



Facebook Facebook del.icio.us del.icio.us LinkedIn LinkedIn


All items in the PolyU Institutional Repository are protected by copyright, with all rights reserved, unless otherwise indicated.
No item in the PolyU IR may be reproduced for commercial or resale purposes.

 

© Pao Yue-kong Library, The Hong Kong Polytechnic University, Hung Hom, Kowloon, Hong Kong
Powered by DSpace (Version 1.5.2)  © MIT and HP
Feedback | Privacy Policy Statement | Copyright & Restrictions - Feedback