Pareto minimizing total completion time and maximum cost with positional due indices

DOI10.1007/S40305-015-0083-1zbMath1327.90070OpenAlexW918221814MaRDI QIDQ888315

Jinjiang Yuan, Yuan Gao

Publication date: 30 October 2015

Published in: Journal of the Operations Research Society of China (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s40305-015-0083-1

zbMATH Keywords

schedulingPareto optimizationmaximum costpositional due indices

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (7)

Rescheduling with new orders and general maximum allowable time disruptions ⋮ Single-machine scheduling of proportional-linearly deteriorating jobs 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 ⋮ A note on competing-agent Pareto-scheduling ⋮ Single-machine scheduling with positional due indices and positional deadlines ⋮ ND-agent scheduling of linear-deteriorating tasks with positional due indices to minimize total completion time and maximum cost

Cites Work

• Tradeoff solutions in single machine production scheduling for minimizing flow time and maximum penalty
• Solving a bicriterion scheduling problem
• A note on Pareto minimizing total completion time and maximum cost
• Minimizing total completion time and maximum cost simultaneously is solvable in polynomial time
• Multicriteria scheduling
• 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: Pareto minimizing total completion time and maximum cost with positional due indices