Pages that link to "Item:Q495685"
From MaRDI portal
The following pages link to A note on unbounded parallel-batch scheduling (Q495685):
Displaying 6 items.
- Pareto-scheduling with family jobs or ND-agent on a parallel-batch machine to minimize the makespan and maximum cost (Q2144217) (← links)
- Two-agent bounded parallel-batching scheduling for minimizing maximum cost and makespan (Q2172079) (← links)
- Unbounded parallel-batch scheduling with drop-line tasks (Q2304116) (← links)
- Bicriteria scheduling on an unbounded parallel-batch machine for minimizing makespan and maximum cost (Q2680241) (← links)
- Hierarchical optimization on an unbounded parallel-batching machine (Q4579881) (← links)
- Min–Max Scheduling of Batch or Drop-Line Jobs Under Agreeable Release and Processing Times (Q5865923) (← links)
