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
Cites work
- scientific article; zbMATH DE number 2114378 (Why is no real title available?)
- A flexible on-line scheduling algorithm for batch machine with infinite capacity
- Algorithm Theory - SWAT 2004
- Approximation algorithms in batch processing
- Efficient Algorithms for Scheduling Semiconductor Burn-In Operations
- Incremental medians via online bidding
- Minimizing makespan on a single batch processing machine with dynamic job arrivals
- On-line algorithms for minimizing makespan on batch processing machines
- On-line scheduling algorithms for a batch machine with finite capacity
- Searching in the plane
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)
