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-zzbMath1209.90179OpenAlexW2041066538WikidataQ57185701 ScholiaQ57185701MaRDI QIDQ626449
Feifeng Zheng, Ming Liu, Chengbin Chu, Yin-Feng 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
Related Items (14)
Total completion time minimization in online hierarchical scheduling of unit-size jobs ⋮ Semi-online scheduling: a survey ⋮ Semi-online hierarchical scheduling for \(l_p\)-norm load balancing with buffer or rearrangements ⋮ Semi-online scheduling with two GoS levels and unit processing time ⋮ Bin stretching with migration on two hierarchical machines ⋮ Semi-online hierarchical load balancing problem with bounded processing times ⋮ Optimal algorithms for semi-online machine covering on two hierarchical machines ⋮ Semi-Online Hierarchical Scheduling on Two Machines for lp-Norm Load Balancing ⋮ Makespan minimization in online scheduling with machine eligibility ⋮ Makespan minimization in online scheduling with machine eligibility ⋮ Online scheduling for jobs with nondecreasing release times and similar lengths on parallel machines ⋮ Optimal algorithm for semi-online scheduling on two machines under GoS levels ⋮ Online scheduling with migration on two hierarchical machines ⋮ Optimal online algorithms on two hierarchical machines with tightly-grouped processing times
Cites Work
- Unnamed Item
- Online and semi-online scheduling of two machines under a grade of service provision
- Online scheduling on parallel machines with two goS levels
- Semi on-line scheduling on two identical machines
- Parallel machine scheduling under a grade of service provision
- Optimal online algorithms for scheduling on two identical machines under a grade of service
This page was built for publication: Semi-online scheduling on 2 machines under a grade of service provision with bounded processing times
