Pages that link to "Item:Q657251"
From MaRDI portal
The following pages link to A best online algorithm for unbounded parallel-batch scheduling with restarts to minimize makespan (Q657251):
Displayed 8 items.
- Online parallel-batch scheduling to minimize total weighted completion time on single unbounded machine (Q280944) (← links)
- Online scheduling of equal length jobs on unbounded parallel batch processing machines with limited restart (Q281805) (← links)
- Online over time scheduling on parallel-batch machines: a survey (Q489147) (← links)
- Best semi-online algorithms for unbounded parallel batch scheduling (Q534351) (← links)
- Online scheduling on two parallel-batching machines with limited restarts to minimize the makespan (Q656603) (← links)
- On-line scheduling on an unbounded parallel batch machine to minimize makespan of two families of jobs (Q835640) (← links)
- On-line scheduling on a batch machine to minimize makespan with limited restarts (Q935242) (← links)
- Online scheduling of equal length jobs on a bounded parallel batch machine with restart or limited restart (Q2250440) (← links)