DocumentCode :
2166429
Title :
An FPTAS for batch scheduling with deterioration effect
Author :
Liu, Ming ; Zheng, Feifeng ; Chu, Chengbin
Author_Institution :
Sch. of Econ. & Manage., Tongji Univ., Shanghai, China
fYear :
2012
fDate :
11-14 April 2012
Firstpage :
322
Lastpage :
327
Abstract :
This paper considers scheduling linear deteriorating jobs on a single machine. The jobs are processed in batches and the objective is to minimize the makespan. Linear deterioration effect means that job´s actual processing time is a linear increasing function on its waiting time, i.e., the time between the execution of the batch to which the job belongs and the job´s starting time. We propose a fully polynomial-time approximation scheme (FPTAS) to show the problem is NP-hard in the ordinary sense.
Keywords :
batch processing (industrial); job shop scheduling; minimisation; polynomial approximation; single machine scheduling; FPTAS; NP-hard problem; batch scheduling; fully polynomial time approximation scheme; job processing time; job scheduling; job starting time; linear deterioration effect; linear increasing function; makespan minimization; single machine scheduling; waiting time; Educational institutions; Job shop scheduling; Optimal scheduling; Polynomials; Silicon; Single machine scheduling; Vectors;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Networking, Sensing and Control (ICNSC), 2012 9th IEEE International Conference on
Conference_Location :
Beijing
Print_ISBN :
978-1-4673-0388-0
Type :
conf
DOI :
10.1109/ICNSC.2012.6204938
Filename :
6204938
Link To Document :
بازگشت