A new lower bound approach for single-machine multicriteria scheduling

DOI10.1016/0167-6377(92)90060-GzbMath0764.90047MaRDI QIDQ1198623

Hoogeveen, J. A., Steef L. van de Velde

Publication date: 16 January 1993

Published in: Operations Research Letters (Search for Journal in Brave)

zbMATH Keywords

multicriteria schedulingcomposite objective functionslower bounds for single-machine schedulingmaximum potential improvementobjective splitting

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Deterministic scheduling theory in operations research (90B35) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items

Generalized pairwise interchanges and machine scheduling ⋮ A new lower bound approach for single-machine multicriteria scheduling

Cites Work

• A new lower bound approach for single-machine multicriteria scheduling
• Minimizing the Range of Lateness on a Single Machine
• Scheduling with Multiple Performance Measures: The One-Machine Case
• Note—A Branch-and-Bound Approach to the Bicriterion Scheduling Problem Involving Total Flowtime and Range of Lateness
• Improved Bounds for the Range of Lateness on a Single Machine
• The Single Machine Problem with Quadratic Penalty Function of Completion Times: A Branch-and-Bound Solution
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Minimizing Maximum Promptness and Maximum Lateness on a Single Machine