ONLINE MINIMUM MAKESPAN SCHEDULING WITH A BUFFER
From MaRDI portal
Publication:2929632
DOI10.1142/S0129054114500191zbMath1302.68040OpenAlexW2000551813MaRDI QIDQ2929632
He Guo, György Dósa, Ning Ding, Xin Chen, Xin Han, Yan Lan
Publication date: 14 November 2014
Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s0129054114500191
Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Online algorithms; streaming algorithms (68W27)
Related Items (5)
A survey on makespan minimization in semi-online environments ⋮ Semi-online scheduling: a survey ⋮ Online Makespan Scheduling with Job Migration on Uniform Machines ⋮ Online bin packing problem with buffer and bounded size revisited ⋮ Online makespan scheduling with job migration on uniform machines
Cites Work
- A simple semi on-line algorithm for \(\mathrm{P}2//C_{\max}\) with a buffer
- Improved semi-online makespan scheduling with a reordering buffer
- Online scheduling with rearrangement on two related machines
- Optimal algorithms for online scheduling with bounded rearrangement at the end
- Online scheduling with reassignment
- New algorithms for an ancient scheduling problem.
- Online scheduling on two uniform machines to minimize the makespan
- Semi on-line algorithms for the partition problem
- On-line scheduling revisited
- Optimal preemptive semi-online scheduling to minimize makespan on two related machines
- Online Scheduling with Bounded Migration
- A Polynomial Approximation Scheme for Scheduling on Uniform Processors: Using the Dual Approximation Approach
- Tighter Bounds for LPT Scheduling on Uniform Processors
- Better Bounds for Online Scheduling
- Improved Bounds for the Online Scheduling Problem
- A Better Algorithm for an Ancient Scheduling Problem
- On-Line Load Balancing for Related Machines
- Bounds on Multiprocessing Timing Anomalies
This page was built for publication: ONLINE MINIMUM MAKESPAN SCHEDULING WITH A BUFFER
