Improved online algorithms for parallel job scheduling and strip packing
From MaRDI portal
Publication:627112
DOI10.1016/J.TCS.2009.05.033zbMATH Open1206.68373OpenAlexW2028810820MaRDI QIDQ627112FDOQ627112
Authors: Johann L. Hurink, Jacob Jan Paulus 
Publication date: 21 February 2011
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2009.05.033
Recommendations
Online algorithms; streaming algorithms (68W27) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Cites Work
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Lower bounds for on-line two-dimensional packing algorithms
- Shelf Algorithms for Two-Dimensional Packing Problems
- A note on online strip packing
- Scheduling parallel jobs to minimize the makespan
- Online scheduling of parallel jobs on two machines is 2-competitive
- On-line scheduling of parallel jobs in a list
Cited In (8)
- The generalization of scheduling with machine cost
- Approximation and online algorithms for multidimensional bin packing: a survey
- Online Algorithm for Parallel Job Scheduling and Strip Packing
- Improved upper bounds for online malleable job scheduling
- 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)
