Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/672
Title: Parallel-machine scheduling with simple linear deterioration to minimize total completion time
Authors: Ji, M
Cheng, TCE 
Keywords: Parallel-machine scheduling
Deteriorating jobs
FPTAS
Issue Date: 16-Jul-2008
Publisher: Elsevier B.V.
Source: European journal of operational research, 16 July 2008, v. 188, no. 2, p. 342-347 How to cite?
Journal: European journal of operational research 
Abstract: We consider the parallel-machine scheduling problem in which the processing time of a job is a simple linear increasing function of its starting time. The objective is to minimize the total completion time. We give a fully polynomial-time approximation scheme (FPTAS) for the case with m identical machines, where m is fixed. This study solves an open problem that has been posed in the literature for ten years.
URI: http://hdl.handle.net/10397/672
ISSN: 0377-2217
DOI: 10.1016/j.ejor.2007.04.050
Rights: Copyright © 2007 Elsevier B.V.
Appears in Collections:Journal/Magazine Article

Files in This Item:
File Description SizeFormat 
V6_06.11.15.pdfPre-published version150.05 kBAdobe PDFView/Open
Access
View full-text via PolyU eLinks SFX Query
Show full item record

SCOPUSTM   
Citations

48
Last Week
0
Last month
2
Citations as of May 25, 2016

WEB OF SCIENCETM
Citations

43
Last Week
0
Last month
1
Citations as of May 27, 2016

Page view(s)

284
Last Week
4
Last month
Checked on May 22, 2016

Download(s)

631
Checked on May 22, 2016

Google ScholarTM

Check

Altmetric



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