Online scheduling on bounded parallel-batch machines
From MaRDI portal
Recommendations
- Online batch scheduling on parallel machines with delivery times
- Online unbounded batch scheduling on parallel machines with delivery times
- An improved on-line algorithm for single parallel-batch machine scheduling with delivery times
- A best on-line algorithm for the single machine parallel-batch scheduling with restricted delivery times
- On-line scheduling with delivery time on a single batch machine
Cited in
(14)- Online interval scheduling: Randomized and multiprocessor cases
- Online scheduling on a single machine with grouped processing times
- Online C-benevolent job scheduling on multiple machines
- On-line scheduling algorithms for a batch machine with finite capacity
- Approximating bounded job start scheduling with application in Royal Mail deliveries under uncertainty
- Online unbounded batch scheduling on parallel machines with delivery times
- Online Scheduling of Bounded Length Jobs to Maximize Throughput
- LP-Based Online Scheduling: From Single to Parallel Machines
- Online optimization of busy time on parallel machines
- ONLINE SCHEDULING OF UNIT JOBS WITH BOUNDED IMPORTANCE RATIO
- Approximation and Online Algorithms
- Online batch scheduling on parallel machines with delivery times
- Online scheduling of equal-processing-time task systems
- Optimal online-list batch scheduling
This page was built for publication: Online scheduling on bounded parallel-batch machines
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3461600)