Pages that link to "Item:Q534351"
From MaRDI portal
The following pages link to Best semi-online algorithms for unbounded parallel batch scheduling (Q534351):
Displaying 9 items.
- Online algorithms for scheduling unit length jobs on parallel-batch machines with lookahead (Q413308) (← links)
- Online over time scheduling on parallel-batch machines: a survey (Q489147) (← links)
- A best possible on-line algorithm for scheduling on uniform parallel-batch machines (Q1637343) (← links)
- Online batch scheduling with kind release times and incompatible families to minimize makespan (Q1744626) (← links)
- Online scheduling of incompatible unit-length job families with lookahead (Q2250449) (← links)
- Online scheduling on two uniform unbounded parallel-batch machines to minimize makespan (Q2314063) (← links)
- Semi-online scheduling: a survey (Q2669808) (← links)
- Online batch scheduling with known information in advance (Q2825064) (← links)
- Online Parallel-Machine Scheduling in KRT Environment to Minimize Total Weighted Completion Time (Q4689382) (← links)