Paper Info
Title
ILP Formulations for Scheduling Ordered Tasks on a Bounded Number of Processors
Abstract
Abstract The multiprocessor scheduling problem with precedence relations and unit costs is considered. New ILP formulations are proposed for the case where the number of processors is bounded. These are the first formulations with O(n 2 ) variables and constraints.
Year
DOI
Venue
2001
10.1016/S1571-0653(04)00251-3
Electronic Notes in Discrete Mathematics
Keywords
Field
DocType
Scheduling,precedence constraints,extensions,integer programming
Mathematical optimization,Multiprocessor scheduling,Fair-share scheduling,Scheduling (computing),Parallel computing,Two-level scheduling,Integer programming,Dynamic priority scheduling,Mathematics,Bounded function
Journal
Volume
ISSN
Citations 
7
1571-0653
0
PageRank 
References 
Authors
0.34
4
4
Name
Order
Citations
PageRank
Manoel B. Campêlo115119.59
Ricardo C. Corrêa220718.74
Nelson Maculan381266.09
Fábio Protti435746.14