Pages that link to "Item:Q905848"
From MaRDI portal
The following pages link to Online scheduling on the unbounded drop-line batch machines to minimize the maximum delivery completion time (Q905848):
Displaying 5 items.
- Unbounded parallel-batch scheduling with drop-line tasks (Q2304116) (← links)
- Online scheduling on two uniform unbounded parallel-batch machines to minimize makespan (Q2314063) (← links)
- Unbounded parallel-batch scheduling under agreeable release and processing to minimize total weighted number of tardy jobs (Q2331580) (← links)
- An Online Scheduling Problem on a Drop-Line Parallel Batch Machine with Delivery Times and Limited Restart (Q5024917) (← links)
- Min–Max Scheduling of Batch or Drop-Line Jobs Under Agreeable Release and Processing Times (Q5865923) (← links)
