Online minimum makespan scheduling with a buffer
DOI10.1142/S0129054114500191zbMATH Open1302.68040OpenAlexW2000551813MaRDI QIDQ2929632FDOQ2929632
Authors: Ning Ding, Yan Lan, Xin Chen, György Dósa, He Guo, Xin Han 
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
Recommendations
- Online minimum makespan scheduling with a buffer
- Online makespan minimization with parallel schedules
- Online makespan minimization with parallel schedules
- Online scheduling with a buffer on related machines
- Makespan minimization in online scheduling with machine eligibility
- Makespan minimization in online scheduling with machine eligibility
- Improved semi-online makespan scheduling with a reordering buffer
- Online scheduling on unbounded parallel-batch machines to minimize the makespan
- scientific article; zbMATH DE number 1947443
- Online scheduling on an unbounded parallel-batch machine and a standard machine to minimize makespan
Online algorithms; streaming algorithms (68W27) Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Cites Work
- On-line scheduling revisited
- A Polynomial Approximation Scheme for Scheduling on Uniform Processors: Using the Dual Approximation Approach
- Bounds on Multiprocessing Timing Anomalies
- Tighter Bounds for LPT Scheduling on Uniform Processors
- New algorithms for an ancient scheduling problem.
- A simple semi on-line algorithm for \(\mathrm{P}2//C_{\max}\) with a buffer
- Online scheduling with reassignment
- Semi on-line algorithms for the partition problem
- Online scheduling on two uniform machines to minimize the makespan
- Better Bounds for Online Scheduling
- Improved Bounds for the Online Scheduling Problem
- Optimal preemptive semi-online scheduling to minimize makespan on two related machines
- Improved semi-online makespan scheduling with a reordering buffer
- A Better Algorithm for an Ancient Scheduling Problem
- On-Line Load Balancing for Related Machines
- Online scheduling with bounded migration
- Online scheduling with rearrangement on two related machines
- Optimal algorithms for online scheduling with bounded rearrangement at the end
Cited In (13)
- Improved semi-online makespan scheduling with a reordering buffer
- Online Sorting Buffers on Line
- A survey on makespan minimization in semi-online environments
- Online Makespan Scheduling with Job Migration on Uniform Machines
- Title not available (Why is that?)
- Max-min online allocations with a reordering buffer
- Online scheduling with a buffer on related machines
- Online minimum makespan scheduling with a buffer
- Online scheduling with rejection and reordering: exact algorithms for unit size jobs
- Online makespan scheduling with job migration on uniform machines
- Semi-online scheduling: a survey
- Online bin packing problem with buffer and bounded size revisited
- Max-min online allocations with a reordering buffer
This page was built for publication: Online minimum makespan scheduling with a buffer
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2929632)
