Optimal online-list batch scheduling
From MaRDI portal
Publication:990939
DOI10.1016/j.ipl.2009.07.006zbMath1206.68374OpenAlexW2053245796MaRDI QIDQ990939
Deshi Ye, Jacob Jan Paulus, Guo-Chuan Zhang
Publication date: 1 September 2010
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://research.tue.nl/nl/publications/optimal-onlinelist-batch-scheduling(9b9482ef-4d18-400a-9027-475df9df3d40).html
Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Online algorithms; streaming algorithms (68W27)
Related Items (2)
Improved bounds for randomized preemptive online matching ⋮ Randomized algorithms for online bounded bidding
Cites Work
- Unnamed Item
- Searching in the plane
- Approximation algorithms in batch processing
- A flexible on-line scheduling algorithm for batch machine with infinite capacity
- On-line scheduling algorithms for a batch machine with finite capacity
- Incremental medians via online bidding
- 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
- Algorithm Theory - SWAT 2004
This page was built for publication: Optimal online-list batch scheduling