Sciweavers

Share
EOR
2002

Review of properties of different precedence graphs for scheduling problems

9 years 5 months ago
Review of properties of different precedence graphs for scheduling problems
Precedence constraints are a part of a definition of any scheduling problem. After recalling, in precise graph-theoretical terms, the relations between task-on-arc and task-on-node representations, we show the equivalence of two distinct results for scheduling problems. Furthermore, again using these links between representations, we exhibit several new polynomial cases for various problems of scheduling preemptable tasks on unrelated parallel machines under arbitrary resource constraints.
Jacek Blazewicz, Daniel Kobler
Added 18 Dec 2010
Updated 18 Dec 2010
Type Journal
Year 2002
Where EOR
Authors Jacek Blazewicz, Daniel Kobler
Comments (0)
books