A note on Pareto minimizing total completion time and maximum cost
From MaRDI portal
Publication:1785326
DOI10.1016/J.ORL.2014.12.001zbMath1408.90127OpenAlexW2041043169MaRDI QIDQ1785326
Publication date: 28 September 2018
Published in: Operations Research Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.orl.2014.12.001
Analysis of algorithms and problem complexity (68Q25) Multi-objective and goal programming (90C29) Deterministic scheduling theory in operations research (90B35)
Related Items (5)
Pareto minimizing total completion time and maximum cost with positional due indices ⋮ Pareto optimal algorithms for minimizing total (weighted) completion time and maximum cost on a single machine ⋮ 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 ⋮ Min–Max Scheduling of Batch or Drop-Line Jobs Under Agreeable Release and Processing Times
Cites Work
- Tradeoff solutions in single machine production scheduling for minimizing flow time and maximum penalty
- Solving a bicriterion scheduling problem
- Minimizing total completion time and maximum cost simultaneously is solvable in polynomial time
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Optimal Sequencing of a Single Machine Subject to Precedence Constraints
This page was built for publication: A note on Pareto minimizing total completion time and maximum cost
