Online scheduling of unit length jobs on a batching machine to maximize the number of early jobs with lookahead
From MaRDI portal
Publication:1034639
DOI10.1016/j.tcs.2009.07.056zbMath1194.68089OpenAlexW2019355540MaRDI QIDQ1034639
Jianfa Cao, Jinjiang Yuan, Hailin Bu, Wen-Jie Li
Publication date: 6 November 2009
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2009.07.056
Related Items (11)
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 interval scheduling on two related machines: the power of lookahead ⋮ Online scheduling of equal-length jobs with incompatible families on multiple batch machines to maximize the weighted number of early jobs ⋮ Online scheduling of incompatible unit-length job families with lookahead ⋮ Exact distributional analysis of online algorithms with lookahead ⋮ Online Algorithms for Scheduling Unit Length Jobs on Unbounded Parallel-Batch Machines with Linearly Lookahead ⋮ Online batch scheduling of equal-length jobs on two identical batch machines to maximise the number of early jobs ⋮ Online scheduling of two-machine flowshop with lookahead and incompatible job families
Cites Work
- Unnamed Item
- Unnamed Item
- How much can lookahead help in online single machine scheduling
- Scheduling a batching machine
- A look-ahead heuristic for scheduling jobs with release dates on a single machine
- Approximation algorithms in batch processing
- On-line scheduling algorithms for a batch machine with finite capacity
- Minimizing makespan in batch machine scheduling
- On-line algorithms for minimizing makespan on batch processing machines
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Minimizing makespan on a single batch processing machine with dynamic job arrivals
- Better Bounds for Online Scheduling
- Improved Bounds for the Online Scheduling Problem
- Online Scheduling with Hard Deadlines
- A Best Possible Deterministic On-Line Algorithm for Minimizing Maximum Delivery Time on a Single Machine
- Online Scheduling of a Single Machine to Minimize Total Weighted Completion Time
- On-line scheduling on a single machine: Maximizing the number of early jobs
This page was built for publication: Online scheduling of unit length jobs on a batching machine to maximize the number of early jobs with lookahead
