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.90179WikidataQ57185701 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
90B35: Deterministic scheduling theory in operations research
Related Items
Semi-Online Hierarchical Scheduling on Two Machines for lp-Norm Load Balancing, Online scheduling for jobs with nondecreasing release times and similar lengths on parallel machines, Makespan minimization in online scheduling with machine eligibility, Makespan minimization in online scheduling with machine eligibility, Optimal algorithm for semi-online scheduling on two machines under GoS levels, Semi-online scheduling with two GoS levels and unit processing time, Semi-online hierarchical load balancing problem with bounded processing times, Semi-online hierarchical scheduling for \(l_p\)-norm load balancing with buffer or rearrangements, Optimal online algorithms on two hierarchical machines with tightly-grouped processing times, Total completion time minimization in online hierarchical scheduling of unit-size jobs, Optimal algorithms for semi-online machine covering on two hierarchical machines
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
