Scheduling uniform machines on-line requires nondecreasing speed ratios

DOI10.1007/BF01585873zbMath0920.90077MaRDI QIDQ1290644

Arjen P. A. Vestjens

Publication date: 3 June 1999

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

zbMATH Keywords

makespanon-line algorithmsuniform machinespreemptive schedulingon-line scheduling

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items

Multiprocessor Jobs, Preemptive Schedules, and One-Competitive Online Algorithms ⋮ Scheduling on identical machines: How good is LPT in an on-line setting? ⋮ Optimal preemptive on-line scheduling on uniform processors with non-decreasing speed ratios ⋮ Preemptive machine covering on parallel machines ⋮ A note on on-line scheduling with precedence constraints on identical machines

Cites Work

• Unnamed Item
• New algorithms for an ancient scheduling problem.
• An optimal algorithm for preemptive on-line scheduling
• Nearly on Line Scheduling of a Uniform Processor System with Release Times
• A Level Algorithm for Preemptive Scheduling
• Preemptive Scheduling of Uniform Processor Systems