A note on on-line scheduling with precedence constraints on identical machines

DOI10.1016/S0020-0190(00)00141-1zbMath0999.90016MaRDI QIDQ1607065

Leah Epstein

Publication date: 25 July 2002

Published in: Information Processing Letters (Search for Journal in Brave)

Mathematics Subject Classification ID

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

Related Items (1)

Rescaling limits of complex rational maps

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Online algorithms. The state of the art
• Efficient scheduling of tasks without full use of processor resources
• Scheduling uniform machines on-line requires nondecreasing speed ratios
• Scheduling on identical machines: How good is LPT in an on-line setting?
• Nearly on Line Scheduling of a Uniform Processor System with Release Times
• A New Algorithm for Preemptive Scheduling of Trees
• Algorithms for Scheduling Tasks on Unrelated Processors
• Scheduling Parallel Machines On-Line
• A Best Possible Deterministic On-Line Algorithm for Minimizing Maximum Delivery Time on a Single Machine
• Optimal online scheduling of parallel jobs with dependencies
• Bounds for Certain Multiprocessing Anomalies
• Bounds on Multiprocessing Timing Anomalies

This page was built for publication: A note on on-line scheduling with precedence constraints on identical machines