Improved semi-online makespan scheduling with a reordering buffer

DOI10.1016/J.IPL.2013.03.007zbMATH Open1371.90060OpenAlexW1971578052MaRDI QIDQ396624FDOQ396624

Authors: Hongyang Sun, Rui Fan 

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

Recommendations

• Online minimum makespan scheduling with a buffer
• The Power of Reordering for Online Minimum Makespan Scheduling
• Online minimum makespan scheduling with a buffer
• Preemptive Online Scheduling with Reordering
• Preemptive online scheduling with reordering

zbMATH Keywords

online algorithmscompetitive analysisschedulingreordering buffer

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (6)

• Preemptive Online Scheduling with Reordering
• A survey on makespan minimization in semi-online environments
• Online minimum makespan scheduling with a buffer
• Online minimum makespan scheduling with a buffer
• The Power of Reordering for Online Minimum Makespan Scheduling
• Semi-online scheduling: a survey

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q396624)