Improved semi-online makespan scheduling with a reordering buffer

DOI10.1016/j.ipl.2013.03.007zbMath1371.90060OpenAlexW1971578052MaRDI QIDQ396624

Rui Fan, Hongyang Sun

Publication date: 13 August 2014

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2013.03.007

zbMATH Keywords

schedulingcompetitive analysisonline algorithmsreordering buffer

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Online algorithms; streaming algorithms (68W27)

Related Items (3)

A survey on makespan minimization in semi-online environments ⋮ ONLINE MINIMUM MAKESPAN SCHEDULING WITH A BUFFER ⋮ Semi-online scheduling: a survey

Cites Work

• A simple semi on-line algorithm for \(\mathrm{P}2//C_{\max}\) with a buffer
• New algorithms for an ancient scheduling problem.
• Semi on-line algorithms for the partition problem
• Online Minimum Makespan Scheduling with a Buffer
• The Power of Reordering for Online Minimum Makespan Scheduling
• Better Bounds for Online Scheduling
• Bounds on Multiprocessing Timing Anomalies

This page was built for publication: Improved semi-online makespan scheduling with a reordering buffer