论文信息 - ILP Formulations for Scheduling Ordered Tasks on a Bounded Number of Processors

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(n2) variables and constraints.

Nelson Maculan | Fábio Protti | Manoel B. Campêlo | Ricardo C. Corrêa

[1] Y.-K. Kwok,et al. Static scheduling algorithms for allocating directed task graphs to multiprocessors , 1999, CSUR.

[2] R. Graham,et al. Handbook of Combinatorics , 1995 .

[3] V. Rajaraman,et al. Improved Lower Bounds on Time and Processors for Scheduling Procedence Graphs on Multicomputer Systems , 1995, J. Parallel Distributed Comput..

[4] Laurence A. Wolsey,et al. Integer and Combinatorial Optimization , 1988 .

[5] William T. Trotter,et al. Partially ordered sets , 1996 .

[6] Jeffrey D. Ullman,et al. NP-Complete Scheduling Problems , 1975, J. Comput. Syst. Sci..

[7] Jean-Claude König,et al. A Heuristic for a Scheduling Problem with Communication Delays , 1997, Oper. Res..