Pages that link to "Item:Q2014051"
From MaRDI portal
The following pages link to An optimal online algorithm for scheduling on two parallel machines with GoS eligibility constraints (Q2014051):
Displaying 7 items.
- On the optimality of the \(TLS\) algorithm for solving the online-list scheduling problem with two job types on a set of multipurpose machines (Q358659) (← links)
- Improved bounds for online scheduling with eligibility constraints (Q719259) (← links)
- Online scheduling on parallel machines with two goS levels (Q941832) (← links)
- On the optimality of the LP-based algorithm for online scheduling with GoS eligibility constraints (Q1785422) (← links)
- Heuristics for online scheduling on identical parallel machines with two GoS levels (Q2320626) (← links)
- Optimal online algorithms for scheduling on two identical machines under a grade of service (Q2508148) (← links)
- Online scheduling on two parallel identical machines under a grade of service provision (Q2683376) (← links)