Online scheduling of equal-processing-time task systems

DOI10.1016/j.tcs.2008.03.026zbMath1151.90414OpenAlexW1992739773MaRDI QIDQ935146

Yumei Huo, Joseph Y.-T. Leung, Xin Wang

Publication date: 31 July 2008

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2008.03.026

zbMATH Keywords

competitive ratiomakespanonline schedulingequal-processing-time tasksintree precedence constraintsparallel and identical machines

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 (3)

Parallel machine problems with equal processing times: a survey ⋮ A best possible online algorithm for scheduling equal-length jobs on two machines with chain precedence constraints ⋮ Online scheduling with chain precedence constraints of equal-length jobs on parallel machines to minimize makespan

Cites Work

• Unnamed Item
• Online algorithms. The state of the art
• Optimal scheduling for two-processor systems
• Worst Case Analysis of Two Scheduling Algorithms
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Online Scheduling of Precedence Constrained Tasks
• Optimal Preemptive Scheduling on Two-Processor Systems
• Preemptive Scheduling of Real-Time Tasks on Multiprocessor Systems

This page was built for publication: Online scheduling of equal-processing-time task systems