DocumentCode :
612866
Title :
Differential approximation analysis of Jackson´s rule for single-machine scheduling problem with a fixed non-availability interval
Author :
Kacem, Imed ; Nagih, Anass ; Seifaddini, M.
Author_Institution :
Univ. of Lorraine, France
fYear :
2013
fDate :
10-12 April 2013
Firstpage :
388
Lastpage :
391
Abstract :
In this paper, we consider the single machine scheduling problem with a fixed non-availability interval. The objective is to minimize the makespan. Our work aims at the comparison of Jackson´s schedule to the optimal and the worst solutions in order to establish the differential approximation ratio for this problem. The analysis of Jackson´s rule shows that this rule cannot yield a constant differential approximation in the general case.
Keywords :
approximation theory; minimisation; single machine scheduling; Jackson rule; differential approximation analysis; differential approximation ratio; fixed nonavailability interval; makespan minimization; single machine scheduling problem; Algorithm design and analysis; Approximation algorithms; Approximation methods; Educational institutions; Minimization; Schedules; Single machine scheduling;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Networking, Sensing and Control (ICNSC), 2013 10th IEEE International Conference on
Conference_Location :
Evry
Print_ISBN :
978-1-4673-5198-0
Electronic_ISBN :
978-1-4673-5199-7
Type :
conf
DOI :
10.1109/ICNSC.2013.6548769
Filename :
6548769
Link To Document :
بازگشت