Pages that link to "Item:Q5894207"
From MaRDI portal
The following pages link to Makespan minimization in online scheduling with machine eligibility (Q5894207):
Displayed 10 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)
- An on-line scheduling problem of parallel machines with common maintenance time (Q394448) (← links)
- Improved bounds for online scheduling with eligibility constraints (Q719259) (← links)
- Surveys in operations research (Q1730527) (← links)
- Fast approximation algorithms for uniform machine scheduling with processing set restrictions (Q1753462) (← links)
- Online scheduling of two job types on a set of multipurpose machines with unit processing times (Q1761990) (← links)
- An optimal online algorithm for scheduling on two parallel machines with GoS eligibility constraints (Q2014051) (← links)
- Twelve surveys in operations research (Q2630815) (← links)
- Online mixed ring covering problem with two nodes (Q2677362) (← links)
- Makespan minimization in online scheduling with machine eligibility (Q5919997) (← links)