Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/1143
Title: Single-machine scheduling with trade-off between number of tardy jobs and compression cost
Authors: He, Y
Wei, Q
Cheng, TCE 
Issue Date: Oct-2007
Source: Journal of scheduling, Oct. 2007, v. 10, no. 4-5, p. 303-310
Abstract: We consider a single-machine scheduling problem, in which the job processing times are controllable or compressible. The performance criteria are the compression cost and the number of tardy jobs. For the problem, where no tardy jobs are allowed and the objective is to minimize the total compression cost, we present a strongly polynomial time algorithm. For the problem to construct the trade-off curve between the number of tardy jobs and the maximum compression cost, we present a polynomial time algorithm. Furthermore, we extend the problem to the case of discrete controllable processing times, where the processing time of a job can only take one of several given discrete values. We show that even some special cases of the discrete controllable version with the objective of minimizing the total compression cost are NP-hard, but the general case is solvable in pseudo-polynomial time. Moreover, we present a strongly polynomial time algorithm to construct the trade-off curve between the number of tardy jobs and the maximum compression cost for the discrete controllable version.
Keywords: Single-machine scheduling problem
Pseudo-polynomial time algorithm
Strongly polynomial time algorithm
Controllable processing times
Publisher: Springer
Journal: Journal of scheduling 
ISSN: 1094-6136
EISSN: 1099-1425
DOI: 10.1007/s10951-007-0027-7
Rights: © 2007 Springer Science + Business Media, Inc. The original publication is available at www.springerlink.com.
Appears in Collections:Journal/Magazine Article

Files in This Item:
File Description SizeFormat 
JOS-504E.pdfPre-published version197.8 kBAdobe PDFView/Open
Access
View full-text via PolyU eLinks SFX Query
Show full item record
PIRA download icon_1.1View/Download Full Text

SCOPUSTM   
Citations

6
Last Week
0
Last month
0
Citations as of Aug 28, 2020

WEB OF SCIENCETM
Citations

5
Last Week
0
Last month
0
Citations as of Jul 30, 2020

Page view(s)

467
Last Week
2
Last month
Citations as of Sep 14, 2020

Download(s)

606
Citations as of Sep 14, 2020

Google ScholarTM

Check

Altmetric


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