Optimal algorithm for semi-online scheduling on two machines under GoS levels
From MaRDI portal
Publication:5963701
DOI10.1007/S11590-014-0838-3zbMATH Open1332.90115OpenAlexW1997228113MaRDI QIDQ5963701FDOQ5963701
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
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
- Optimal online algorithms for scheduling on two identical machines under a grade of service
- Online and semi-online scheduling of two machines under a grade of service provision
- Parallel machine scheduling under a grade of service provision
- Semi-online scheduling on 2 machines under a grade of service provision with bounded processing times
- An FPTAS for parallel-machine scheduling under a grade of service provision to minimize makespan
- Semi-online hierarchical scheduling problems with buffer or rearrangements
- Semi-online scheduling with two GoS levels and unit processing time
- A comment on parallel-machine scheduling under a grade of service provision to minimize makespan
Cited In (6)
- Semi-online scheduling on 2 machines under a grade of service provision with bounded processing times
- Optimal semi-online scheduling algorithms on two parallel identical machines under a grade of service provision
- An optimal semi-online algorithm for 2-machine scheduling with an availability constraint
- Bin stretching with migration on two hierarchical machines
- Online scheduling with migration on two hierarchical machines
- Semi-online scheduling with two GoS levels and unit processing time
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)
