How much can lookahead help in online single machine scheduling

DOI10.1016/J.IPL.2007.10.008zbMATH Open1186.68079OpenAlexW2163453902MaRDI QIDQ963335FDOQ963335

Authors: 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

Recommendations

• Online scheduling of unit length jobs on a batching machine to maximize the number of early jobs with lookahead
• Online interval scheduling on a single machine with finite lookahead
• Online machine minimization with lookahead
• An improved online algorithm for the online preemptive scheduling of equal-length intervals on a single machine with lookahead
• A look-ahead heuristic for scheduling jobs with release dates on a single machine

zbMATH Keywords

schedulinglookaheadonline strategies

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• On-line scheduling on a single machine: Maximizing the number of early jobs
• Online Scheduling with Hard Deadlines
• A look-ahead heuristic for scheduling jobs with release dates on a single machine
• Automata, Languages and Programming

Cited In (13)

• Online production planning to maximize the number of on-time orders
• Online scheduling of two-machine flowshop with lookahead and incompatible job families
• Online Scheduling with Lookahead: Multipass Assembly Lines
• Online integrated allocation of berths and quay cranes in container terminals with 1-lookahead
• Online scheduling of incompatible unit-length job families with lookahead
• Online machine minimization with lookahead
• On the power of lookahead in online lot-sizing
• Online interval scheduling on a single machine with finite lookahead
• Online algorithms for scheduling unit length jobs on parallel-batch machines with lookahead
• Online Algorithms for Scheduling Unit Length Jobs on Unbounded Parallel-Batch Machines with Linearly Lookahead
• Online scheduling of unit length jobs on a batching machine to maximize the number of early jobs with lookahead
• Research on the parallel-batch scheduling with linearly lookahead model
• A look-ahead heuristic for scheduling jobs with release dates on a single machine

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q963335)