Pages that link to "Item:Q990962"
From MaRDI portal
The following pages link to Online scheduling on unbounded parallel-batch machines to minimize the makespan (Q990962):
Displayed 5 items.
- Online algorithms for scheduling unit length jobs on parallel-batch machines with lookahead (Q413308) (← links)
- Online scheduling on unbounded parallel-batch machines with incompatible job families (Q533882) (← links)
- Online scheduling on two parallel-batching machines with limited restarts to minimize the makespan (Q656603) (← links)
- A best possible online algorithm for scheduling equal-length jobs on two machines with chain precedence constraints (Q714856) (← links)
- Online batch scheduling on parallel machines with delivery times (Q719274) (← links)