Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/16189
Title: Scheduling with controllable release dates and processing times: Total completion time minimization
Authors: Cheng, TCE 
Kovalyov, MY
Shakhlevich, NV
Keywords: Controllable processing times
Controllable release dates
Due-date scheduling
Parallel machines
Scheduling
Single machine
Total completion time
Issue Date: 2006
Publisher: Elsevier
Source: European journal of operational research, 2006, v. 175, no. 2, p. 769-781 How to cite?
Journal: European journal of operational research 
Abstract: The single machine scheduling problem with two types of controllable parameters, job processing times and release dates, is studied. It is assumed that the cost of compressing processing times and release dates from their initial values is a linear function of the compression amounts. The objective is to minimize the sum of the total completion time of the jobs and the total compression cost. For the problem with equal release date compression costs we construct a reduction to the assignment problem. We demonstrate that if in addition the jobs have equal processing time compression costs, then it can be solved in O(n2) time. The solution algorithm can be considered as a generalization of the algorithm that minimizes the makespan and total compression cost. The generalized version of the algorithm is also applicable to the problem with parallel machines and to a range of due-date scheduling problems with controllable processing times.
URI: http://hdl.handle.net/10397/16189
ISSN: 0377-2217
EISSN: 1872-6860
DOI: 10.1016/j.ejor.2005.06.072
Appears in Collections:Journal/Magazine Article

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

SCOPUSTM   
Citations

14
Last Week
0
Last month
0
Citations as of Aug 21, 2017

WEB OF SCIENCETM
Citations

11
Last Week
0
Last month
0
Citations as of Aug 20, 2017

Page view(s)

100
Last Week
0
Last month
Checked on Aug 20, 2017

Google ScholarTM

Check

Altmetric



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