Online scheduling with a buffer on related machines
From MaRDI portal
Publication:711400
DOI10.1007/s10878-008-9200-yzbMath1200.90073OpenAlexW2129015553MaRDI QIDQ711400
Publication date: 26 October 2010
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10878-008-9200-y
Related Items (10)
A survey on makespan minimization in semi-online environments ⋮ Semi-online scheduling: a survey ⋮ Online scheduling with rearrangement on two related machines ⋮ Unnamed Item ⋮ Online scheduling with one rearrangement at the end: revisited ⋮ Optimal algorithms for online scheduling with bounded rearrangement at the end ⋮ Online scheduling with rejection and reordering: exact algorithms for unit size jobs ⋮ Online Makespan Scheduling with Job Migration on Uniform Machines ⋮ Online makespan scheduling with job migration on uniform machines ⋮ Prompt mechanism for online auctions with multi-unit demands
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A simple semi on-line algorithm for \(\mathrm{P}2//C_{\max}\) with a buffer
- Semi on-line algorithms for the partition problem
- Semi on-line scheduling on two identical machines
- Bin stretching revisited
- A note on on-line scheduling with partial information
- Semi-online scheduling with ``end of sequence information
- The on-line multiprocessor scheduling problem with known sum of the tasks
- Semi-online scheduling on two uniform processors
- The Power of Reordering for Online Minimum Makespan Scheduling
- Bounds for Certain Multiprocessing Anomalies
- Bounds on Multiprocessing Timing Anomalies
- Optimal non-preemptive semi-online scheduling on two related machines
- Semi-online scheduling with decreasing job sizes
- Randomized on-line scheduling on two uniform machines
- On-line bin-stretching
This page was built for publication: Online scheduling with a buffer on related machines
