Please use this identifier to cite or link to this item:
http://hdl.handle.net/10397/1152
DC Field | Value | Language |
---|---|---|
dc.contributor | Department of Logistics and Maritime Studies | - |
dc.creator | Cheng, TCE | - |
dc.creator | Shakhlevich, NV | - |
dc.date.accessioned | 2014-12-11T08:23:15Z | - |
dc.date.available | 2014-12-11T08:23:15Z | - |
dc.identifier.issn | 1572-5286 | - |
dc.identifier.uri | http://hdl.handle.net/10397/1152 | - |
dc.language.iso | en | en_US |
dc.publisher | Elsevier | en_US |
dc.rights | Discrete Optimization © 2004 Elsevier B.V. The journal web site is located at http://www.sciencedirect.com. | en_US |
dc.subject | Open shop scheduling | en_US |
dc.subject | Controllable processing times | en_US |
dc.subject | Knapsack problem | en_US |
dc.subject | Resource allocation | en_US |
dc.title | Two-machine open shop problem with controllable processing times | en_US |
dc.type | Journal/Magazine Article | en_US |
dc.identifier.spage | 175 | - |
dc.identifier.epage | 184 | - |
dc.identifier.volume | 4 | - |
dc.identifier.issue | 2 | - |
dc.identifier.doi | 10.1016/j.disopt.2006.10.010 | - |
dcterms.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. | - |
dcterms.accessRights | open access | en_US |
dcterms.bibliographicCitation | Discrete optimization, 1 Jun. 2007, v. 4, no. 2, p. 175-184 | - |
dcterms.isPartOf | Discrete optimization | - |
dcterms.issued | 2007-06 | - |
dc.identifier.isi | WOS:000246632100004 | - |
dc.identifier.scopus | 2-s2.0-34047267691 | - |
dc.identifier.rosgroupid | r35263 | - |
dc.description.ros | 2007-2008 > Academic research: refereed > Publication in refereed journal | - |
dc.description.oa | Accepted Manuscript | en_US |
dc.identifier.FolderNumber | OA_IR/PIRA | en_US |
dc.description.pubStatus | Published | en_US |
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 14, 2024
Downloads
147
Citations as of Apr 14, 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 18, 2024
Google ScholarTM
Check
Altmetric
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.