Pages that link to "Item:Q2482805"
From MaRDI portal
The following pages link to On-line scheduling on a batch processing machine with unbounded batch size to minimize the makespan (Q2482805):
Displaying 7 items.
- Cost-based decision-making in middleware virtualization environments (Q531466) (← links)
- A flexible on-line scheduling algorithm for batch machine with infinite capacity (Q1772971) (← links)
- On-line scheduling algorithms for a batch machine with finite capacity (Q1781801) (← links)
- A best possible deterministic on-line algorithm for minimizing makespan on parallel batch machines (Q2434270) (← links)
- On-line problems of minimizing makespan on a single batch processing machine with nonidentical job sizes (Q2574421) (← links)
- On-line algorithms for minimizing makespan on batch processing machines (Q2741218) (← links)
- Online batch scheduling with known information in advance (Q2825064) (← links)