Semi-online scheduling on 2 machines under a grade of service provision with bounded processing times
From MaRDI portal
(Redirected from Publication:626449)
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
- scientific article; zbMATH DE number 1232130 (Why is no real title available?)
- Online and semi-online scheduling of two machines under a grade of service provision
- Online scheduling on parallel machines with two goS levels
- Optimal online algorithms for scheduling on two identical machines under a grade of service
- Parallel machine scheduling under a grade of service provision
- Semi on-line scheduling on two identical machines
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
- Semi-online hierarchical load balancing problem with bounded processing times
- Semi-online multiprocessor scheduling with bounded jobs
- Bin stretching with migration on two hierarchical machines
- Online scheduling for jobs with nondecreasing release times and similar lengths on parallel machines
- 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
- Online and semi-online scheduling of two machines under a grade of service provision
- Makespan minimization in online scheduling with machine eligibility
- Optimal online algorithms on two hierarchical machines with tightly-grouped processing times
- 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)
