Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/13942
Title: Scheduling with controllable release dates and processing times : Makespan minimization
Authors: Cheng, TCE 
Kovalyov, MY
Shakhlevich, NV
Keywords: Controllable processing times
Controllable release dates
Makespan
Scheduling
Single-machine
Issue Date: 2006
Publisher: Elsevier
Source: European journal of operational research, 2006, v. 175, no. 2, p. 751-768 How to cite?
Journal: European journal of operational research 
Abstract: The paper deals with the single-machine scheduling problem in which job processing times as well as release dates are controllable parameters and they may vary within given intervals. While all release dates have the same boundary values, the processing time intervals are arbitrary. It is assumed that the cost of compressing processing times and release dates from their initial values is a linear function of the compression amount. The objective is to minimize the makespan together with the total compression cost. We construct a reduction to the assignment problem for the case of equal release date compression costs and develop an O(n2) algorithm for the case of equal release date compression costs and equal processing time compression costs. For the bicriteria version of the latter problem with agreeable processing times, we suggest an O(n2) algorithm that constructs the breakpoints of the efficient frontier.
URI: http://hdl.handle.net/10397/13942
ISSN: 0377-2217
EISSN: 1872-6860
DOI: 10.1016/j.ejor.2005.06.021
Appears in Collections:Journal/Magazine Article

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

SCOPUSTM   
Citations

12
Last Week
0
Last month
0
Citations as of Aug 17, 2017

WEB OF SCIENCETM
Citations

10
Last Week
0
Last month
0
Citations as of Aug 13, 2017

Page view(s)

37
Last Week
2
Last month
Checked on Aug 13, 2017

Google ScholarTM

Check

Altmetric



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