On-line scheduling with precedence constraints

DOI10.1016/S0166-218X(01)00272-4zbMath0996.90038WikidataQ127333533 ScholiaQ127333533MaRDI QIDQ1602711

Leah Epstein, Yossi Azar

Publication date: 24 June 2002

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

competitive ratiouniformly related machinesmodel of restricted assignmenton-line problem of scheduling jobs with precedence constraints

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Cites Work

• Unnamed Item
• Unnamed Item
• Online algorithms. The state of the art
• Efficient scheduling of tasks without full use of processor resources
• A Polynomial Approximation Scheme for Scheduling on Uniform Processors: Using the Dual Approximation Approach
• Algorithms for Scheduling Tasks on Unrelated Processors
• A Level Algorithm for Preemptive Scheduling
• Preemptive Scheduling of Uniform Processor Systems
• Approximation Algorithms for Precedence-Constrained Scheduling Problems on Parallel Machines that Run at Different Speeds
• The Competitiveness of On-Line Assignments
• Scheduling Parallel Machines On-Line
• Bounds for Certain Multiprocessing Anomalies
• Bounds on Multiprocessing Timing Anomalies

This page was built for publication: On-line scheduling with precedence constraints