Optimal online-list batch scheduling
DOI10.1016/J.IPL.2009.07.006zbMATH Open1206.68374OpenAlexW2053245796MaRDI QIDQ990939FDOQ990939
Deshi Ye, Jacob Jan Paulus, Guochuan 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
Recommendations
- On the optimality of list scheduling for online uniform machines scheduling
- Online-list scheduling on a single bounded parallel-batch machine to minimize makespan
- OPTIMAL SEMI-ONLINE ALGORITHM FOR SCHEDULING ON A BATCH PROCESSING MACHINE
- Optimal Semi-online Algorithm for Scheduling on a Batch Processing Machine
- Online scheduling on bounded parallel-batch machines
- Algorithm Theory - SWAT 2004
- Optimally competitive list batching
- An optimal online algorithm for the parallel-batch scheduling with job processing time compatibilities
- On-line scheduling of parallel jobs in a list
- Online scheduling on bounded batch machines to minimize the maximum weighted completion time
Online algorithms; streaming algorithms (68W27) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Cites Work
- Searching in the plane
- Minimizing makespan on a single batch processing machine with dynamic job arrivals
- 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
- On-line algorithms for minimizing makespan on batch processing machines
- Efficient Algorithms for Scheduling Semiconductor Burn-In Operations
- Incremental medians via online bidding
- Title not available (Why is that?)
- Algorithm Theory - SWAT 2004
Cited In (5)
This page was built for publication: Optimal online-list batch scheduling
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q990939)
