Semi-online scheduling on 2 machines under a grade of service provision with bounded processing times
From MaRDI portal
Publication:626449
DOI10.1007/S10878-009-9231-ZzbMATH Open1209.90179DBLPjournals/jco/LiuCXZ11OpenAlexW2041066538WikidataQ57185701 ScholiaQ57185701MaRDI QIDQ626449FDOQ626449
Authors: Ming Liu, Chengbin Chu, Feifeng Zheng, Yinfeng Xu 
Publication date: 18 February 2011
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10878-009-9231-z
Recommendations
- Online and semi-online scheduling of two machines under a grade of service provision
- Optimal algorithm for semi-online scheduling on two machines under GoS levels
- Semi-online scheduling problems on two uniform machines under a grade of service provision
- 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
Cites Work
- Title not available (Why is that?)
- Semi on-line scheduling on two identical machines
- 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
- Online scheduling on parallel machines with two goS levels
- Parallel machine scheduling under a grade of service provision
Cited In (19)
- Makespan minimization in online scheduling with machine eligibility
- Optimal semi-online scheduling algorithms on two parallel identical machines under a grade of service provision
- Semi-Online Hierarchical Scheduling on Two Machines for lp-Norm Load Balancing
- Optimal algorithm for semi-online scheduling on two machines under GoS levels
- Bin stretching with migration on two hierarchical machines
- Online scheduling for jobs with nondecreasing release times and similar lengths on parallel machines
- Semi-online multiprocessor scheduling with bounded jobs
- Semi-online hierarchical load balancing problem with bounded processing times
- A modified list scheduling algorithm for the online hierarchical load balancing problem with bounded processing times
- Semi-online hierarchical scheduling for \(l_p\)-norm load balancing with buffer or rearrangements
- Semi-online scheduling: a survey
- Total completion time minimization in online hierarchical scheduling of unit-size jobs
- Makespan minimization in online scheduling with machine eligibility
- Optimal online algorithms on two hierarchical machines with tightly-grouped processing times
- Online and semi-online scheduling of two machines under a grade of service provision
- Online scheduling with migration on two hierarchical machines
- Optimal algorithms for semi-online machine covering on two hierarchical machines
- 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
This page was built for publication: Semi-online scheduling on 2 machines under a grade of service provision with bounded processing times
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q626449)
