Online Scheduling with Lookahead: Multipass Assembly Lines

DOI10.1287/IJOC.10.3.331MaRDI QIDQ4427353zbMATH OpenOpenAlexFDO

Authors Vijay Saraswat, Eric Torng, Rajeev Motwani

Publication date 16 December 2003

Published in INFORMS Journal on Computing (Search for Journal in Brave)

Full work available at URL https://semanticscholar.org/paper/9872957cb3248516ec4be9b967136e7b22b0d205

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Recommendations

• Online interval scheduling on a single machine with finite lookahead
• How much can lookahead help in online single machine scheduling
• On-line algorithms for incompatible job families on parallel machines scheduling with lookahead
• Online machine minimization with lookahead
• A look-ahead heuristic for scheduling jobs with release dates on a single machine

Cited in

(7)

• Online packet scheduling with bounded delay and lookahead
• The bursty Steiner tree problem
• On-Line Scheduling In Assembly Processes
• An optimal algorithm for 2-bounded delay buffer management with lookahead
• On the power of lookahead in online lot-sizing
• MPMD on two sources with lookahead
• Semi-online scheduling with look-ahead

This page was built for publication: Online Scheduling with Lookahead: Multipass Assembly Lines

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