Pages that link to "Item:Q1022602"
From MaRDI portal
The following pages link to Online scheduling in a parallel batch processing system to minimize makespan using restarts (Q1022602):
Displayed 11 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)
- A best online algorithm for unbounded parallel-batch scheduling with restarts to minimize makespan (Q657251) (← links)
- On-line scheduling on a batch machine to minimize makespan with limited restarts (Q935242) (← links)
- On-line integrated production-distribution scheduling problems with capacitated deliveries (Q1042489) (← links)
- Online scheduling of equal length jobs on a bounded parallel batch machine with restart or limited restart (Q2250440) (← links)
- Semi-online two-level supply chain scheduling problems (Q2434290) (← links)
- Optimal Semi-Online Algorithm for Scheduling on Two Parallel Batch Processing Machines (Q2931174) (← links)
- OPTIMAL SEMI-ONLINE ALGORITHM FOR SCHEDULING ON A BATCH PROCESSING MACHINE (Q3397511) (← links)