Please use this identifier to cite or link to this item:
http://hdl.handle.net/10397/1152
Title: | Two-machine open shop problem with controllable processing times | Authors: | Cheng, TCE Shakhlevich, NV |
Issue Date: | Jun-2007 | Source: | Discrete optimization, 1 Jun. 2007, v. 4, no. 2, p. 175-184 | Abstract: | We consider a two-machine open shop problem in which the job processing times are controllable and can be compressed while incurring additional costs. We show that the problem of minimizing a linear compression cost function for a given upper bound on the makespan can be solved in O(n) time. For the bicriteria problem of minimizing the makespan and compression cost, we propose an O(nlogn) algorithm that finds all breakpoints of the efficient frontier. | Keywords: | Open shop scheduling Controllable processing times Knapsack problem Resource allocation |
Publisher: | Elsevier | Journal: | Discrete optimization | ISSN: | 1572-5286 | DOI: | 10.1016/j.disopt.2006.10.010 | Rights: | Discrete Optimization © 2004 Elsevier B.V. The journal web site is located at http://www.sciencedirect.com. |
Appears in Collections: | Journal/Magazine Article |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
paper-third-revision.pdf | Pre-published version | 474.41 kB | Adobe PDF | View/Open |
Page views
124
Last Week
0
0
Last month
Citations as of Apr 21, 2024
Downloads
147
Citations as of Apr 21, 2024
SCOPUSTM
Citations
10
Last Week
0
0
Last month
0
0
Citations as of Apr 19, 2024
WEB OF SCIENCETM
Citations
9
Last Week
1
1
Last month
0
0
Citations as of Apr 25, 2024
Google ScholarTM
Check
Altmetric
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.