A note on Pareto minimizing total completion time and maximum cost
From MaRDI portal
(Redirected from Publication:1785326)
Recommendations
- Pareto minimizing total completion time and maximum cost with positional due indices
- Pareto optima for total weighted completion time and maximum lateness on a single machine
- Minimizing total completion time and maximum cost simultaneously is solvable in polynomial time
- Pareto optimization scheduling with two competing agents to minimize the number of tardy jobs and the maximum cost
- Pareto‐optimization of three‐agent scheduling to minimize the total weighted completion time, weighted number of tardy jobs, and total weighted late work
Cites work
- Minimizing total completion time and maximum cost simultaneously is solvable in polynomial time
- Optimal Sequencing of a Single Machine Subject to Precedence Constraints
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Solving a bicriterion scheduling problem
- Tradeoff solutions in single machine production scheduling for minimizing flow time and maximum penalty
Cited in
(5)- Bi-criteria Pareto-scheduling on a single machine with due indices and precedence constraints
- Single-machine hierarchical scheduling with release dates and preemption to minimize the total completion time and a regular criterion
- Pareto optimal algorithms for minimizing total (weighted) completion time and maximum cost on a single machine
- Min-max scheduling of batch or drop-line jobs under agreeable release and processing times
- Pareto minimizing total completion time and maximum cost with positional due indices
This page was built for publication: A note on Pareto minimizing total completion time and maximum cost
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1785326)
