Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/26563
Title: Scheduling resumable simple linear deteriorating jobs on a single machine with an availability constraint to minimize makespan
Authors: Ji, M
Cheng, TCE 
Keywords: 0-1 integer programming
Availability constraint
Computational complexity
FPTAS
Scheduling
Issue Date: 2010
Publisher: Pergamon Press
Source: Computers and industrial engineering, 2010, v. 59, no. 4, p. 794-798 How to cite?
Journal: Computers and industrial engineering 
Abstract: We consider a single-machine scheduling problem in which the processing time of each job is a simple linear deteriorating function of its waiting time. The machine is subject to an availability constraint. Jobs interrupted by machine unavailability can resume their processing. The objective is to minimize the makespan. We first show that the problem can be solved optimally by 0-1 integer programming. We then prove that the problem is NP-hard in the ordinary sense and there exists a fully polynomial time approximation scheme for it.
URI: http://hdl.handle.net/10397/26563
ISSN: 0360-8352
EISSN: 1879-0550
DOI: 10.1016/j.cie.2010.08.005
Appears in Collections:Journal/Magazine Article

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

SCOPUSTM   
Citations

12
Last Week
0
Last month
1
Citations as of Sep 8, 2017

WEB OF SCIENCETM
Citations

12
Last Week
0
Last month
0
Citations as of Sep 21, 2017

Page view(s)

48
Last Week
2
Last month
Checked on Sep 17, 2017

Google ScholarTM

Check

Altmetric



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