An on-line algorithm for the single machine unbounded parallel-batching scheduling with large delivery times
From MaRDI portal
Publication:1944199
DOI10.1016/j.ipl.2011.08.003zbMath1260.68042MaRDI QIDQ1944199
Jinjiang Yuan, Ji Tian, Ruyan Fu
Publication date: 4 April 2013
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ipl.2011.08.003
68M20: Performance evaluation, queueing, and scheduling in the context of computer systems
68W27: Online algorithms; streaming algorithms
Related Items
Online Scheduling of Incompatible Family Jobs with Equal Length on an Unbounded Parallel-Batch Machine with Job Delivery, An improved on-line algorithm for single parallel-batch machine scheduling with delivery times, Online over time scheduling on parallel-batch machines: a survey, Online scheduling on a single machine with grouped processing times, Single-machine online scheduling of jobs with non-delayed processing constraint, Online NDP-constraint scheduling of jobs with delivery times or weights
Cites Work
- Unnamed Item
- Optimal on-line algorithms for one batch machine with grouped processing times
- A best on-line algorithm for the single machine parallel-batch scheduling with restricted delivery times
- Online scheduling on unbounded parallel-batch machines to minimize the makespan
- On-line scheduling with delivery time on a single batch machine
- Approximation algorithms in batch processing
- On-line scheduling algorithms for a batch machine with finite capacity
- A best possible deterministic on-line algorithm for minimizing makespan on parallel batch machines
- On-line algorithms for minimizing makespan on batch processing machines
- Efficient Algorithms for Scheduling Semiconductor Burn-In Operations
- Minimizing makespan on a single batch processing machine with dynamic job arrivals
- A Best Possible Deterministic On-Line Algorithm for Minimizing Maximum Delivery Time on a Single Machine
