Pages that link to "Item:Q719260"
From MaRDI portal
The following pages link to Optimal algorithms for online scheduling on parallel machines to minimize the makespan with a periodic availability constraint (Q719260):
Displaying 6 items.
- Makespan minimization for two parallel machines scheduling with a periodic availability constraint (Q1000962) (← links)
- Mixed integer programming formulations for two-machine flow shop scheduling with an availability constraint (Q1640598) (← links)
- Optimal online algorithm for scheduling on two identical machines with machine availability constraints. (Q1853092) (← links)
- Online and semi-online scheduling to minimize makespan on single machine with an availability constraint (Q3451058) (← links)
- Online Scheduling on Two Uniform Machines to Minimize the Makespan with a Periodic Availability Constraint (Q3578374) (← links)
- Absolute bounds of list algorithms for parallel machines scheduling with unavailability periods (Q6090983) (← links)