DocumentCode
2248845
Title
The homogeneous non-idling scheduling problem
Author
Quilliot, Alain ; Chretienne, Philippe
Author_Institution
Lab. LIMOS, Univ. Blaise Pascal, Aubière, France
fYear
2012
fDate
9-12 Sept. 2012
Firstpage
447
Lastpage
454
Abstract
This paper is about multi-processor scheduling with non idling constraints, i.e constraints which forbid interruption in the use of the processors. We first reformulate the problem, while using a notion of pyramidal shape, and next apply matching techniques in order to get a min-max feasibility characterization criterion, which allows us to derive a polynomial algorithm for the related existence problem and for the Makespan Minimization related problem.
Keywords
minimax techniques; polynomials; processor scheduling; homogeneous nonidling scheduling problem; minmax feasibility characterization; multiprocessor scheduling; polynomial algorithm; pyramidal shape; Labeling; Minimization; Optimal scheduling; Processor scheduling; Schedules; Shape; Single machine scheduling;
fLanguage
English
Publisher
ieee
Conference_Titel
Computer Science and Information Systems (FedCSIS), 2012 Federated Conference on
Conference_Location
Wroclaw
Print_ISBN
978-1-4673-0708-6
Electronic_ISBN
978-83-60810-51-4
Type
conf
Filename
6354329
Link To Document