Pages that link to "Item:Q457296"
From MaRDI portal
The following pages link to Single machine bicriteria scheduling with equal-length jobs to minimize total weighted completion time and maximum cost (Q457296):
Displaying 6 items.
- Bi-criteria Pareto-scheduling on a single machine with due indices and precedence constraints (Q1751234) (← links)
- Minimizing total completion time and maximum cost simultaneously is solvable in polynomial time (Q1924612) (← links)
- A note on competing-agent Pareto-scheduling (Q1996756) (← links)
- Bicriteria scheduling of equal length jobs on uniform parallel machines (Q2307491) (← links)
- Pareto optimal algorithms for minimizing total (weighted) completion time and maximum cost on a single machine (Q2686863) (← links)
- Bicriteria Scheduling on a Single Batching Machine with Transportation and Deterioration to Minimize Total Completion Time and Production Costs (Q5348802) (← links)
