Pages that link to "Item:Q1121167"
From MaRDI portal
The following pages link to Tradeoff solutions in single machine production scheduling for minimizing flow time and maximum penalty (Q1121167):
Displaying 12 items.
- Pareto optimization scheduling with two competing agents to minimize the number of tardy jobs and the maximum cost (Q668562) (← links)
- Pareto minimizing total completion time and maximum cost with positional due indices (Q888315) (← links)
- Multiple and bicriteria scheduling: A literature survey (Q1130028) (← links)
- Use of variable range in solving multiple criteria scheduling problems (Q1200841) (← links)
- A note on Pareto minimizing total completion time and maximum cost (Q1785326) (← links)
- Minimizing total completion time and maximum cost simultaneously is solvable in polynomial time (Q1924612) (← links)
- Multivariate composite distributions for coefficients in synthetic optimization problems (Q1969891) (← links)
- Pareto optimization scheduling of family jobs on a p-batch machine to minimize makespan and maximum lateness (Q2514124) (← links)
- A family of composite discrete bivariate distributions with uniform marginals for simulating realistic and challenging optimization-problem instances (Q2629710) (← links)
- Pareto optimal algorithms for minimizing total (weighted) completion time and maximum cost on a single machine (Q2686863) (← links)
- Multicriteria scheduling problems: a survey (Q2773166) (← links)
- Counting and enumeration complexity with application to multicriteria scheduling (Q5920490) (← links)
