Optimal algorithm for semi-online scheduling on two machines under GoS levels

DOI10.1007/s11590-014-0838-3zbMath1332.90115OpenAlexW1997228113MaRDI QIDQ5963701

Yin-Feng Xu, Taibo Luo

Publication date: 23 February 2016

Published in: Optimization Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11590-014-0838-3

zbMATH Keywords

algorithmsgrade of serviceonline schedulingbounded processing timestotal processing time

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (2)

Bin stretching with migration on two hierarchical machines ⋮ Online scheduling with migration on two hierarchical machines

Cites Work

• Semi-online scheduling with two GoS levels and unit processing time
• Semi-online scheduling on 2 machines under a grade of service provision with bounded processing times
• Online and semi-online scheduling of two machines under a grade of service provision
• An FPTAS for parallel-machine scheduling under a grade of service provision to minimize makespan
• A comment on parallel-machine scheduling under a grade of service provision to minimize makespan
• Parallel machine scheduling under a grade of service provision
• Semi-online hierarchical scheduling problems with buffer or rearrangements
• Optimal online algorithms for scheduling on two identical machines under a grade of service

This page was built for publication: Optimal algorithm for semi-online scheduling on two machines under GoS levels