An Improved Online Algorithm for the Online Preemptive Scheduling of Equal-Length Intervals on a Single Machine with Lookahead

DOI10.1142/S0217595915500475zbMath1335.90038MaRDI QIDQ2788528

Jinjiang Yuan, Wen-Jie Li

Publication date: 19 February 2016

Published in: Asia-Pacific Journal of Operational Research (Search for Journal in Brave)

zbMATH Keywords

schedulingonline algorithmlookaheadequal-length intervals

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Online algorithms; streaming algorithms (68W27)

Related Items (1)

Competitive analysis of online machine rental and online parallel machine scheduling problems with workload fence

Cites Work

• Unnamed Item
• Online interval scheduling on a single machine with finite lookahead
• On-line scheduling of equal-length intervals on parallel machines
• Fixed interval scheduling: models, applications, computational complexity and algorithms
• Improved randomized results for the interval selection problem
• A look-ahead heuristic for scheduling jobs with release dates on a single machine

This page was built for publication: An Improved Online Algorithm for the Online Preemptive Scheduling of Equal-Length Intervals on a Single Machine with Lookahead