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

DOI10.1007/S11590-014-0838-3MaRDI QIDQ5963701zbMATH OpenOpenAlexFDO

Authors Taibo Luo, Yinfeng Xu

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

algorithmsbounded processing timesgrade of serviceonline schedulingtotal processing time

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Recommendations

• Optimal semi-online scheduling algorithms on two parallel identical machines under a grade of service provision
• Online and semi-online scheduling of two machines under a grade of service provision
• Semi-online scheduling on 2 machines under a grade of service provision with bounded processing times
• Semi-online scheduling problems on two uniform machines under a grade of service provision
• Semi-online scheduling with two GoS levels and unit processing time

Cites work

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

Cited in

(6)

• Online scheduling with migration on two hierarchical machines
• Optimal semi-online scheduling algorithms on two parallel identical machines under a grade of service provision
• Semi-online scheduling with two GoS levels and unit processing time
• Bin stretching with migration on two hierarchical machines
• Semi-online scheduling on 2 machines under a grade of service provision with bounded processing times
• An optimal semi-online algorithm for 2-machine scheduling with an availability constraint

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

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