A new lower bound approach for single-machine multicriteria scheduling

DOI10.1016/0167-6377(92)90060-GMaRDI QIDQ1198623zbMATH OpenFDO

Authors Han Hoogeveen, Steef van de Velde

Publication date 16 January 1993

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

Full work available at URL https://doi.org/10.1016/0167-6377(92)90060-G

zbMATH Keywords

composite objective functionslower bounds for single-machine schedulingmaximum potential improvementmulticriteria schedulingobjective splitting

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 432995
• scientific article; zbMATH DE number 1149857
• On the equivalence of the Max-min transportation lower bound and the time-indexed lower bound for single-machine scheduling problems
• scientific article; zbMATH DE number 52239
• A Single Machine Bicriterion Scheduling Problem and an Optimizing Branch-and-Bound Procedure

Cites work

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

Cited in

(3)

• A new lower bound approach for single-machine multicriteria scheduling
• Generalized pairwise interchanges and machine scheduling
• Multi-machine scheduling lower bounds using decision diagrams

This page was built for publication: A new lower bound approach for single-machine multicriteria scheduling

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1198623)