Online interval scheduling on a single machine with finite lookahead

DOI10.1016/j.cor.2012.06.003zbMath1349.90433OpenAlexW1999560225MaRDI QIDQ339562

Yongxi Cheng, Feifeng Zheng, Ming Liu, Yin-Feng Xu

Publication date: 11 November 2016

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2012.06.003

zbMATH Keywords

competitive ratiopreemptionlookaheadonline interval scheduling

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (7)

Online machine minimization with lookahead ⋮ Online Integrated Allocation of Berths and Quay Cranes in Container Terminals with 1-Lookahead ⋮ Competitive analysis of online machine rental and online parallel machine scheduling problems with workload fence ⋮ Online interval scheduling on two related machines: the power of lookahead ⋮ An Improved Online Algorithm for the Online Preemptive Scheduling of Equal-Length Intervals on a Single Machine with Lookahead ⋮ Online integrated allocation of berths and quay cranes in container terminals with 1-lookahead ⋮ Exact distributional analysis of online algorithms with lookahead

Cites Work

• Unnamed Item
• Scheduling unit length jobs on parallel machines with lookahead information
• Fixed interval scheduling: models, applications, computational complexity and algorithms
• Comparison of agent-based scheduling to look-ahead heuristics for real-time transportation problems
• How much can lookahead help in online single machine scheduling
• Online scheduling of unit length jobs on a batching machine to maximize the number of early jobs with lookahead
• Randomized online interval scheduling
• On-line scheduling of jobs with fixed start and end times
• A look-ahead heuristic for scheduling jobs with release dates on a single machine
• Interval scheduling: A survey
• Improved Randomized Results for That Interval Selection Problem
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Bounding the Power of Preemption in Randomized Scheduling

This page was built for publication: Online interval scheduling on a single machine with finite lookahead