Pages that link to "Item:Q1019748"
From MaRDI portal
The following pages link to A best online algorithm for scheduling on two parallel batch machines (Q1019748):
Displaying 10 items.
- Online scheduling of equal length jobs on unbounded parallel batch processing machines with limited restart (Q281805) (← links)
- 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)
- Online scheduling on unbounded parallel-batch machines to minimize the makespan (Q990962) (← links)
- A best possible on-line algorithm for scheduling on uniform parallel-batch machines (Q1637343) (← links)
- Online scheduling on unbounded parallel-batch machines to minimize maximum flow-time (Q1944164) (← links)
- Online scheduling on two uniform unbounded parallel-batch machines to minimize makespan (Q2314063) (← links)
- A best possible deterministic on-line algorithm for minimizing makespan on parallel batch machines (Q2434270) (← links)
- On-line scheduling on a batch processing machine with unbounded batch size to minimize the makespan (Q2482805) (← links)
- Optimal Semi-Online Algorithm for Scheduling on Two Parallel Batch Processing Machines (Q2931174) (← links)
