Pages that link to "Item:Q837188"
From MaRDI portal
The following pages link to Online scheduling on two uniform machines subject to eligibility constraints (Q837188):
Displaying 12 items.
- Improved bounds for online scheduling with eligibility constraints (Q719259) (← links)
- Online and semi-online scheduling of two machines under a grade of service provision (Q867934) (← links)
- Online scheduling on two uniform machines to minimize the makespan (Q1019187) (← links)
- General parametric scheme for the online uniform machine scheduling problem with two different speeds (Q1707972) (← links)
- Fast approximation algorithms for uniform machine scheduling with processing set restrictions (Q1753462) (← links)
- On the optimality of the LP-based algorithm for online scheduling with GoS eligibility constraints (Q1785422) (← links)
- Online scheduling with equal processing times and machine eligibility constraints (Q2257291) (← links)
- Online Scheduling on Two Uniform Machines to Minimize the Makespan with a Periodic Availability Constraint (Q3578374) (← links)
- (Q4252304) (← links)
- Makespan minimization in online scheduling with machine eligibility (Q5894207) (← links)
- Makespan minimization in online scheduling with machine eligibility (Q5919997) (← links)
- Randomized on-line scheduling on two uniform machines (Q5937432) (← links)