Algorithms better than LPT for semi-online scheduling with decreasing processing times

DOI10.1016/J.ORL.2012.05.009zbMath1251.90123OpenAlexW2076290545MaRDI QIDQ1758275

Hans Kellerer, Vladimir Kotov, Cheng, T. C. Edwin

Publication date: 8 November 2012

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

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

zbMATH Keywords

multiprocessor schedulingonline algorithmscompetitive ratiosemi-online algorithms

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (7)

A survey on makespan minimization in semi-online environments ⋮ Semi-online scheduling: a survey ⋮ Parallel solutions for preemptive makespan scheduling on two identical machines ⋮ The LPT heuristic for minimizing total load on a proportionate openshop ⋮ Parallel solutions for ordinal scheduling with a small number of machines ⋮ Online bin stretching with bunch techniques ⋮ A 2-competitive largest job on least loaded machine online algorithm based on the multi list scheduling model

Cites Work

• Unnamed Item
• On-line scheduling revisited
• Bounds for Certain Multiprocessing Anomalies
• Bounds on Multiprocessing Timing Anomalies
• Optimal non-preemptive semi-online scheduling on two related machines
• Semi-online scheduling with decreasing job sizes

This page was built for publication: Algorithms better than LPT for semi-online scheduling with decreasing processing times