Some remarks about the `equivalence' of performance measures in scheduling problems

DOI10.1016/0377-2217(93)90253-JzbMath0782.90052OpenAlexW2066785232MaRDI QIDQ1310028

Yigal Gerchak, Michael J. Magazine

Publication date: 28 February 1994

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0377-2217(93)90253-j

zbMATH Keywords

heuristic solutionorder preservationscheduling performance measures

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Cites Work

• Unnamed Item
• Solving a bicriterion scheduling problem
• Worst-Case Analysis of Heuristic Algorithms
• Exceptional Paper—Location of Bank Accounts to Optimize Float: An Analytic Study of Exact and Approximate Algorithms
• On general routing problems

This page was built for publication: Some remarks about the `equivalence' of performance measures in scheduling problems