DocumentCode
3223688
Title
Dominance conditions for particular single machine scheduling problems with nested execution intervals
Author
Ourari, Samia ; Briand, C.
Author_Institution
CDTA, Algiers, Algeria
fYear
2013
fDate
2-4 Dec. 2013
Firstpage
186
Lastpage
189
Abstract
This paper takes interest in some particular one machine scheduling problems. The input is a set of n jobs with fixed processing time and temporal execution interval associated with each job. Preemption is not allowed. We assume all along this paper that the temporal execution intervals of the jobs are nested (none of them overlaps the other). Two kinds of objective are investigated: the minimization of the lateness and the minimization of the number of late jobs. In this paper, some dominance conditions are established and optimal sequencing rules are given for some particular cases.
Keywords
minimisation; single machine scheduling; dominance conditions; late job minimization; lateness minimization; nested execution intervals; optimal sequencing rules; processing time; single machine scheduling problems; temporal execution interval; Complexity theory; Conferences; Lead; Minimization; Open systems; Sequential analysis; Single machine scheduling;
fLanguage
English
Publisher
ieee
Conference_Titel
Open Systems (ICOS), 2013 IEEE Conference on
Conference_Location
Kuching
Print_ISBN
978-1-4799-3152-1
Type
conf
DOI
10.1109/ICOS.2013.6735071
Filename
6735071
Link To Document