Improved online algorithms for parallel job scheduling and strip packing
From MaRDI portal
(Redirected from Publication:627112)
Recommendations
Cites work
- A note on online strip packing
- Lower bounds for on-line two-dimensional packing algorithms
- On-line scheduling of parallel jobs in a list
- Online scheduling of parallel jobs on two machines is 2-competitive
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Scheduling parallel jobs to minimize the makespan
- Shelf Algorithms for Two-Dimensional Packing Problems
Cited in
(8)- The generalization of scheduling with machine cost
- Approximation and online algorithms for multidimensional bin packing: a survey
- Improved upper bounds for online malleable job scheduling
- Online Algorithm for Parallel Job Scheduling and Strip Packing
- Online scheduling of malleable parallel jobs with setup times on two identical machines
- Approximation algorithms for multiple strip packing and scheduling parallel jobs in platforms
- Improved algorithms for online scheduling of malleable parallel jobs on two identical machines
- Online malleable job scheduling for \(m\leq 3\)
This page was built for publication: Improved online algorithms for parallel job scheduling and strip packing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q627112)