Review of properties of different precedence graphs for scheduling problems

DOI10.1016/S0377-2217(01)00379-4zbMath1081.90553OpenAlexW2120730808WikidataQ57387817 ScholiaQ57387817MaRDI QIDQ1847252

Daniel Kobler, Jacek Błażewicz

Publication date: 17 November 2002

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0377-2217(01)00379-4

zbMATH Keywords

Graph theorySchedulingPrecedence constraints

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (5)

Deep infeasibility exploration method for vehicle routing problems ⋮ Parallel dedicated machines scheduling with chain precedence constraints ⋮ Literature reviews in operations research: a new taxonomy and a meta review ⋮ Scheduling chained multiprocessor tasks onto large multiprocessor system ⋮ Optimal preemptive scheduling on a fixed number of identical parallel machines

Uses Software

• Algorithm 520

Cites Work

• A new polynomial-time algorithm for linear programming
• Preemptive scheduling of interval orders is polynomial
• Scheduling subject to resource constraints: Classification and complexity
• A linear-time recognition algorithm for interval dags
• A labeling algorithm to recognize a line digraph and output its root graph
• Analysis of scheduling problems with typed task systems
• The jump number problem on interval orders: A 3/2 approximation algorithm
• On the linegraph of a directed-graph
• Scheduling Interval-Ordered Tasks
• Algorithm 520: An Automatic Revised Simplex Method for Constrained Resource Network Scheduling [H]
• An Efficient Integer Programming Algorithm with Network Cuts for Solving Resource-Constrained Scheduling Problems
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Intransitive Indifference in Preference Theory: A Survey
• Minimizing the number of tardy jobs with precedence constraints and agreeable due dates
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Review of properties of different precedence graphs for scheduling problems