Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/21975
Title: Single machine scheduling of unit-time jobs with controllable release dates
Authors: Cheng, TCE 
Shakhlevich, NV
Keywords: Controllable release dates
Deterministic
Multiple criteria
Scheduling
Single machine
Issue Date: 2003
Publisher: Kluwer Academic Publ
Source: Journal of global optimization, 2003, v. 27, no. 2-3, p. 293-311 How to cite?
Journal: Journal of global optimization 
Abstract: The paper presents a bicriterion approach to solve the single-machine scheduling problem in which the job release dates can be compressed while incurring additional costs. The two criteria are the makespan and the compression cost. For the case of equal job processing times, an O(n 4) algorithm is developed to construct integer Pareto optimal points. We discuss how the algorithm developed can be modified to construct an ε-approximation of noninteger Pareto optimal points. The complexity status of the problem with total weighted completion time criterion is also established.
URI: http://hdl.handle.net/10397/21975
ISSN: 0925-5001
EISSN: 1573-2916
DOI: 10.1023/A:1024826720369
Appears in Collections:Conference Paper

Access
View full-text via PolyU eLinks SFX Query
Show full item record

SCOPUSTM   
Citations

4
Last Week
0
Last month
0
Citations as of Oct 9, 2017

WEB OF SCIENCETM
Citations

9
Last Week
0
Last month
0
Citations as of Sep 29, 2017

Page view(s)

52
Last Week
4
Last month
Checked on Oct 15, 2017

Google ScholarTM

Check

Altmetric



Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.