Title of article :
Preemptive scheduling and antichain polyhedra Original Research Article
Author/Authors :
Alain Quilliot، نويسنده ,
Issue Information :
روزنامه با شماره پیاپی سال 2008
Abstract :
We present a theoretical framework, which is based upon notions of ordered hypergraphs and antichain polyhedra, and which is dedicated to the combinatorial analysis of preemptive scheduling problems submitted to parallelization constraints.
Keywords :
Partially ordered sets , Multiprocessor scheduling , Hypergraphs , Linear programming
Journal title :
Discrete Applied Mathematics
Journal title :
Discrete Applied Mathematics
