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 |
Issue Date: | Mar-2006 | Source: | 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. | Keywords: | Flowshop scheduling Waiting time Makespan NP-hardness |
Publisher: | Blackwell Publishing | Journal: | International transactions in operational research | 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 | Size | Format | |
---|---|---|---|---|
Lag_Penalty_1215.pdf | Pre-published version | 122.19 kB | Adobe PDF | View/Open |
Page views
135
Last Week
0
0
Last month
Citations as of Apr 21, 2024
Downloads
195
Citations as of Apr 21, 2024
SCOPUSTM
Citations
8
Last Week
0
0
Last month
Citations as of Apr 19, 2024
Google ScholarTM
Check
Altmetric
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.