Title of article
ILP Formulations for Scheduling Ordered Tasks on a Bounded Number of Processors
Author/Authors
Campêlo، نويسنده , , Manoel and Corrêa، نويسنده , , Ricardo and Maculan، نويسنده , , Nelson and Protti، نويسنده , , Fébio، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2001
Pages
4
From page
166
To page
169
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(n2) variables and constraints.
Keywords
Scheduling , precedence constraints , Extensions , integer programming
Journal title
Electronic Notes in Discrete Mathematics
Serial Year
2001
Journal title
Electronic Notes in Discrete Mathematics
Record number
1453134
Link To Document