Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/18008
Title: Single-machine scheduling with controllable processing times and earliness, tardiness and completion time penalties
Authors: Biskup, D
Cheng, TCE 
Keywords: Controllable processing times
Earliness/tardiness penalties
Scheduling
Issue Date: 1999
Publisher: Taylor & Francis
Source: Engineering optimization, 1999, v. 31, no. 1-3, p. 329-336 How to cite?
Journal: Engineering optimization 
Abstract: The paper considers the problem of scheduling n independent and simultaneously available jobs on a single machine, where the job processing times are compressible as a linear cost function. The objective is to find an optimal permutation of the jobs, an optimal due date and the optimal processing times which jointly minimize a cost function consisting of the earliness, tardiness, completion time and compressing costs. It shows that the problem can be solved as an assignment problem.
URI: http://hdl.handle.net/10397/18008
ISSN: 0305-215X
DOI: 10.1080/03052159908941376
Appears in Collections:Journal/Magazine Article

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

SCOPUSTM   
Citations

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

WEB OF SCIENCETM
Citations

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

Page view(s)

53
Last Week
1
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.