Pages that link to "Item:Q957356"
From MaRDI portal
The following pages link to An improved on-line algorithm for scheduling on two unrestrictive parallel batch processing machines (Q957356):
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)
- Online scheduling on unbounded parallel-batch machines to minimize the makespan (Q990962) (← links)
- A best online algorithm for scheduling on two parallel batch machines (Q1019748) (← links)