Pages that link to "Item:Q626449"
From MaRDI portal
The following pages link to Semi-online scheduling on 2 machines under a grade of service provision with bounded processing times (Q626449):
Displaying 14 items.
- Semi-online scheduling with two GoS levels and unit processing time (Q389944) (← links)
- Semi-online hierarchical load balancing problem with bounded processing times (Q897964) (← links)
- Semi-online hierarchical scheduling for \(l_p\)-norm load balancing with buffer or rearrangements (Q1680761) (← links)
- Online scheduling with migration on two hierarchical machines (Q2091110) (← links)
- Optimal online algorithms on two hierarchical machines with tightly-grouped processing times (Q2343998) (← links)
- Total completion time minimization in online hierarchical scheduling of unit-size jobs (Q2359792) (← links)
- Optimal algorithms for semi-online machine covering on two hierarchical machines (Q2441779) (← links)
- Semi-online scheduling: a survey (Q2669808) (← links)
- Semi-Online Hierarchical Scheduling on Two Machines for lp-Norm Load Balancing (Q4631681) (← links)
- Online scheduling for jobs with nondecreasing release times and similar lengths on parallel machines (Q5169463) (← links)
- Makespan minimization in online scheduling with machine eligibility (Q5894207) (← links)
- Makespan minimization in online scheduling with machine eligibility (Q5919997) (← links)
- Optimal algorithm for semi-online scheduling on two machines under GoS levels (Q5963701) (← links)
- Bin stretching with migration on two hierarchical machines (Q6093406) (← links)
