Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/21348
Title: A note on a fully polynomial-time approximation scheme for parallel-machine scheduling with deteriorating jobs
Authors: Kang, L
Ng, CT 
Keywords: Deteriorating jobs
Fully polynomial-time approximation scheme
Parallel-machine scheduling
Issue Date: 2007
Publisher: Elsevier
Source: International journal of production economics, 2007, v. 109, no. 1-2, p. 180-184 How to cite?
Journal: International journal of production economics 
Abstract: In this paper we study the NP-hard problem of scheduling n deteriorating jobs on m identical parallel machines to minimize the makespan. Each job's processing time is a linear nondecreasing function of its start time. We present a fully polynomial-time approximation scheme for the problem, thus establishing that the problem is NP-hard in the ordinary sense only.
URI: http://hdl.handle.net/10397/21348
ISSN: 0925-5273
DOI: 10.1016/j.ijpe.2006.11.014
Appears in Collections:Journal/Magazine Article

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

SCOPUSTM   
Citations

37
Last Week
0
Last month
0
Citations as of Jul 9, 2018

WEB OF SCIENCETM
Citations

30
Last Week
0
Last month
0
Citations as of Jul 15, 2018

Page view(s)

68
Last Week
0
Last month
Citations as of Jul 16, 2018

Google ScholarTM

Check

Altmetric


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