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, Min
Cheng, T. C. Edwin
Subjects: 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.
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.
Rights: Copyright © 2007 Elsevier B.V.
Type: Journal/Magazine Article
URI: http://hdl.handle.net/10397/672
DOI: 10.1016/j.ejor.2007.04.050
ISSN: 0377-2217
Appears in Collections:LMS Journal/Magazine Articles

Files in This Item:
File Description SizeFormat 
V6_06.11.15.pdfPre-published version150.05 kBAdobe PDFView/Open


All items in the PolyU Institutional Repository are protected by copyright, with all rights reserved, unless otherwise indicated. No item in the PolyU IR may be reproduced for commercial or resale purposes.