Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/15553
Title: Optimal assignment of due-dates for preemptive single-machine scheduling
Authors: Cheng, TCE 
Gordon, VS
Keywords: Due-date assignment
Scheduling
Issue Date: 1994
Publisher: Pergamon Press
Source: Mathematical and computer modelling, 1994, v. 20, no. 2, p. 33-40 How to cite?
Journal: Mathematical and computer modelling 
Abstract: This paper considers due-date assignment and preemptive scheduling of n jobs in a single-machine shop under precedence constraints. Along with a release date, the job i has processing time pi and a due-date di is assigned depending on pi. If di=k1 pi+k2, the due-date assignment method is known as PPW: processing-time-plus-wait. If di=k1pk2 i, it is known as TWK-power (total-work-content-power) due-date determination. The problem is to minimize an objective function depending on the assigned due-date parameters k1 and k2, together with maximum tardiness penalty. It is shown that an O(n2) algorithm yields an optimal schedule. A simple analytical solution method is presented to find the optimal due-dates for a special case of the objective function and PPW due-date assignment method.
URI: http://hdl.handle.net/10397/15553
ISSN: 0895-7177
DOI: 10.1016/0895-7177(94)90204-6
Appears in Collections:Journal/Magazine Article

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

SCOPUSTM   
Citations

7
Last Week
0
Last month
0
Citations as of Aug 19, 2017

WEB OF SCIENCETM
Citations

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

Page view(s)

52
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.