Pages that link to "Item:Q2931723"
From MaRDI portal
The following pages link to BATCHING MACHINE SCHEDULING WITH BICRITERIA: MAXIMUM COST AND MAKESPAN (Q2931723):
Displayed 5 items.
- A note on unbounded parallel-batch scheduling (Q495685) (← links)
- Pareto-scheduling with family jobs or ND-agent on a parallel-batch machine to minimize the makespan and maximum cost (Q2144217) (← 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)