Algorithms better than LPT for semi-online scheduling with decreasing processing times
From MaRDI portal
Publication:1758275
DOI10.1016/j.orl.2012.05.009zbMath1251.90123MaRDI 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
90B35: Deterministic scheduling theory in operations research
Related Items
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 survey on makespan minimization in semi-online environments, A 2-competitive largest job on least loaded machine online algorithm based on the multi list scheduling model, Semi-online scheduling: a survey
Cites Work