The generalization of scheduling with machine cost
From MaRDI portal
Publication:392182
DOI10.1016/j.tcs.2013.09.009zbMath1358.90044OpenAlexW2103094924MaRDI QIDQ392182
Publication date: 13 January 2014
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2013.09.009
Analysis of algorithms and problem complexity (68Q25) Deterministic scheduling theory in operations research (90B35) Online algorithms; streaming algorithms (68W27)
Related Items (3)
An optimal online algorithm for scheduling with general machine cost functions ⋮ Online Scheduling with Machine Cost and a Quadratic Objective Function ⋮ Scheduling games on uniform machines with activation cost
Cites Work
- Unnamed Item
- Shelf algorithms for on-line strip packing
- New upper and lower bounds for online scheduling with machine cost
- Online multiple-strip packing
- Improved online algorithms for parallel job scheduling and strip packing
- Scheduling parallel jobs to minimize the makespan
- Online scheduling of parallel jobs on two machines is 2-competitive
- Online scheduling with general machine cost functions
- A note on online strip packing
- Lower bounds for on-line two-dimensional packing algorithms
- Preemptive online algorithms for scheduling with machine cost
- Scheduling with machine cost and rejection
- A tight analysis of Brown-Baker-Katseff sequences for online strip packing
- Online scheduling with machine cost and rejection
- Improved Lower Bound for Online Strip Packing
- Shelf Algorithms for Two-Dimensional Packing Problems
- Better Online Algorithms for Scheduling with Machine Cost
- Online Mixed Packing and Covering
- Online strip packing with modifiable boxes
This page was built for publication: The generalization of scheduling with machine cost
