Single machine bicriteria scheduling with equal-length jobs to minimize total weighted completion time and maximum cost

DOI10.1007/s10288-013-0244-1zbMath1334.90051OpenAlexW1977916582MaRDI QIDQ457296

Cheng He, Xiumei Wang, Hao Lin

Publication date: 26 September 2014

Published in: 4OR (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10288-013-0244-1

zbMATH Keywords

bicriteria schedulingtotal weighted completion timemaximum costPareto optimal schedules

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Deterministic scheduling theory in operations research (90B35)

Related Items (3)

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

Cites Work

• Minimizing total completion time and maximum cost simultaneously is solvable in polynomial time
• Multicriteria scheduling
• Multicriteria scheduling problems: a survey
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Single-Machine Scheduling to Minimize a Function of Two or Three Maximum Cost Criteria
• Optimal Sequencing of a Single Machine Subject to Precedence Constraints
• Unnamed Item

This page was built for publication: Single machine bicriteria scheduling with equal-length jobs to minimize total weighted completion time and maximum cost