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.

• Type: Journal
• Year: 2002
• Where: EOR
• Authors: Jacek Blazewicz, Daniel Kobler
• Keywords: EOR 2002, Precedence Constraints, Precise Graph-theoretical Terms, Scheduling Problem