Pseudo lower bounds for online parallel machine scheduling

DOI10.1016/j.orl.2015.07.002zbMath1408.90142OpenAlexW889025920MaRDI QIDQ1785411

Rongqi Li, Zhiyi Tan

Publication date: 28 September 2018

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.orl.2015.07.002

zbMATH Keywords

schedulingcompetitive ratiolower boundonline

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 ⋮ Improved approximation algorithms for non-preemptive multiprocessor scheduling with testing ⋮ Improved approximation algorithms for multiprocessor scheduling with testing

Cites Work

• Unnamed Item
• Unnamed Item
• On-line scheduling revisited
• New lower and upper bounds for on-line scheduling
• On randomized online scheduling
• An On-Line Scheduling Heuristic with Better Worst-Case Ratio Than Graham’s List Scheduling
• Improved Bounds for the Online Scheduling Problem
• Bounds for Certain Multiprocessing Anomalies

This page was built for publication: Pseudo lower bounds for online parallel machine scheduling