Please use this identifier to cite or link to this item:
Title: Two-machine open shop problem with controllable processing times
Authors: Cheng, T. C. Edwin
Shakhlevich, Natalia V.
Subjects: Open shop scheduling
Controllable processing times
Knapsack problem
Resource allocation
Issue Date: Jun-2007
Publisher: Elsevier
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.
Rights: Discrete Optimization © 2004 Elsevier B.V. The journal web site is located at
Type: Journal/Magazine Article
DOI: 10.1016/j.disopt.2006.10.010
ISSN: 1572-5286
Appears in Collections:LMS Journal/Magazine Articles

Files in This Item:
File Description SizeFormat 
paper-third-revision.pdfPre-published version474.41 kBAdobe PDFView/Open

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.