How much can lookahead help in online single machine scheduling

DOI10.1016/J.IPL.2007.10.008zbMath1186.68079OpenAlexW2163453902MaRDI QIDQ963335

B. E. Eshmatov

Publication date: 19 April 2010

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2007.10.008

zbMATH Keywords

schedulinglookaheadonline strategies

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items (10)

Online production planning to maximize the number of on-time orders ⋮ Online machine minimization with lookahead ⋮ Online interval scheduling on a single machine with finite lookahead ⋮ Research on the parallel-batch scheduling with linearly lookahead model ⋮ Online algorithms for scheduling unit length jobs on parallel-batch machines with lookahead ⋮ Online scheduling of incompatible unit-length job families with lookahead ⋮ Online integrated allocation of berths and quay cranes in container terminals with 1-lookahead ⋮ Online scheduling of unit length jobs on a batching machine to maximize the number of early jobs with lookahead ⋮ Online Algorithms for Scheduling Unit Length Jobs on Unbounded Parallel-Batch Machines with Linearly Lookahead ⋮ Online scheduling of two-machine flowshop with lookahead and incompatible job families

Cites Work

• Unnamed Item
• A look-ahead heuristic for scheduling jobs with release dates on a single machine
• Online Scheduling with Hard Deadlines
• Automata, Languages and Programming
• On-line scheduling on a single machine: Maximizing the number of early jobs

This page was built for publication: How much can lookahead help in online single machine scheduling