Online interval scheduling on a single machine with finite lookahead
From MaRDI portal
Publication:339562
DOI10.1016/J.COR.2012.06.003zbMATH Open1349.90433OpenAlexW1999560225MaRDI QIDQ339562FDOQ339562
Authors: Feifeng Zheng, Yongxi Cheng, Ming Liu, Yinfeng 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
Recommendations
- 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
- Optimal on-line algorithms for single-machine scheduling
- Online Interval Scheduling: Randomized and Multiprocessor Cases
- Online interval scheduling: Randomized and multiprocessor cases
- scientific article; zbMATH DE number 761265
- Online algorithms for scheduling unit length jobs on parallel-batch machines with lookahead
- An optimal semi-online algorithm for a single machine scheduling problem with bounded processing time
- On-line scheduling on a single machine: Minimizing the total completion time
- Online splitting interval scheduling on \(m\) identical machines
Cites Work
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Title not available (Why is that?)
- Randomized online interval scheduling
- On-line scheduling of jobs with fixed start and end times
- Bounding the Power of Preemption in Randomized Scheduling
- Interval scheduling: A survey
- Fixed interval scheduling: models, applications, computational complexity and algorithms
- Comparison of agent-based scheduling to look-ahead heuristics for real-time transportation problems
- Online scheduling of unit length jobs on a batching machine to maximize the number of early jobs with lookahead
- A look-ahead heuristic for scheduling jobs with release dates on a single machine
- Improved Randomized Results for That Interval Selection Problem
- Scheduling unit length jobs on parallel machines with lookahead information
- How much can lookahead help in online single machine scheduling
Cited In (11)
- Online interval scheduling on two related machines: the power of lookahead
- Semi-online scheduling on two identical parallel machines with initial-lookahead information
- An improved online algorithm for the online preemptive scheduling of equal-length intervals on a single machine with lookahead
- Online Scheduling with Lookahead: Multipass Assembly Lines
- Online integrated allocation of berths and quay cranes in container terminals with 1-lookahead
- Online machine minimization with lookahead
- Exact distributional analysis of online algorithms with lookahead
- Competitive analysis of online machine rental and online parallel machine scheduling problems with workload fence
- How much can lookahead help in online single machine scheduling
- A look-ahead heuristic for scheduling jobs with release dates on a single machine
- Online Integrated Allocation of Berths and Quay Cranes in Container Terminals with 1-Lookahead
This page was built for publication: Online interval scheduling on a single machine with finite lookahead
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q339562)
