A look-ahead heuristic for scheduling jobs with release dates on a single machine

DOI10.1016/0305-0548(94)90034-5zbMath0812.90069OpenAlexW2093926758MaRDI QIDQ1342939

Weizhen Mao, Rex K. Kincaid

Publication date: 15 January 1995

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

Full work available at URL: https://doi.org/10.1016/0305-0548(94)90034-5

zbMATH Keywords

total completion timeindependent jobs with release datesNP-complete single machine schedulingon-line heuristics

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (10)

Online interval scheduling on a single machine with finite lookahead ⋮ Research on the parallel-batch scheduling with linearly lookahead model ⋮ Semi-online scheduling with two GoS levels and unit processing time ⋮ Online algorithms for scheduling unit length jobs on parallel-batch machines with lookahead ⋮ Online scheduling of incompatible unit-length job families with lookahead ⋮ How much can lookahead help in online single machine scheduling ⋮ An Improved Online Algorithm for the Online Preemptive Scheduling of Equal-Length Intervals on a Single Machine with Lookahead ⋮ Semi on-line algorithms for the partition problem ⋮ 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

Cites Work

• Efficient heuristics to minimize total flow time with release dates
• On Scheduling with Ready Times to Minimize Mean Flow Time
• Probabilistic Analysis of a Machine Scheduling Problem
• Sequencing Jobs with Unequal Ready Times to Minimize Mean Flow Time
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A look-ahead heuristic for scheduling jobs with release dates on a single machine