Parallel partitioning method (PPM): A new exact method to solve bi-objective problems

DOI10.1016/J.COR.2005.09.014MaRDI QIDQ869006zbMATH OpenOpenAlexDBLPWikidataFDO

Authors J. Lemesre, El-Ghazali Talbi, Clarisse Dhaenens

Publication date 26 February 2007

Published in Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL https://hal.inria.fr/inria-00269956/file/COR_07_Dhaenens.pdf

zbMATH Keywords

exact methodpermutation flowshopBi-objective problem

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Combinatorial optimization (90C27)

Recommendations

• \(K\)-PPM: a new exact method to solve multi-objective combinatorial optimization problems
• An exact parallel method for a bi-objective permutation flowshop problem
• An exact parallel objective space decomposition algorithm for solving multi-objective integer programming problems
• Parallel hybrid algorithm for solving pseudomonotone equilibrium and split common fixed point problems
• A new approach for bicriteria partitioning problem
• A parallel algorithm for multiple objective linear programs
• A Parallel Macro Partitioning Framework for Solving Mixed Integer Programs
• scientific article; zbMATH DE number 1206103
• scientific article; zbMATH DE number 6303703

Cites work

• scientific article; zbMATH DE number 915988 (Why is no real title available?)
• A genetic algorithm for flowshop sequencing
• A survey and annotated bibliography of multiobjective combinatorial optimization
• An exact parallel method for a bi-objective permutation flowshop problem
• Benchmarks for basic scheduling problems
• Comparison of heuristics for flowtime minimisation in permutation flowshops
• Improved genetic algorithm for the permutation flowshop scheduling problem.
• Minimizing Total Tardiness on One Machine is NP-Hard
• Multicriteria scheduling problems: a survey
• Multiple and bicriteria scheduling: A literature survey
• On a Bicriterion Formulation of the Problems of Integrated System Identification and System Optimization
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Permutation flowshop scheduling problems with maximal and minimal time lags
• The Complexity of Flowshop and Jobshop Scheduling
• Two-phases method and branch and bound procedures to solve the bi-objective knapsack problem

Cited in

(12)

• Generation of the exact Pareto set in multi-objective traveling salesman and set covering problems
• A hybrid approach for biobjective optimization
• A generic branch-and-cut algorithm for multiobjective optimization problems: application to the multilabel traveling salesman problem
• An exact parallel method for a bi-objective permutation flowshop problem
• Effective anytime algorithm for multiobjective combinatorial optimization problems
• Solving multi-criteria scheduling flow shop problem through compromise programming and satisfaction functions
• \(K\)-PPM: a new exact method to solve multi-objective combinatorial optimization problems
• Multiobjective Integer Programming: Synergistic Parallel Approaches
• An exact method for solving the bi-objective minimum diameter-cost spanning tree problem
• Finding a representative nondominated set for multi-objective mixed integer programs
• Modeling and solving the bi-objective minimum diameter-cost spanning tree problem
• A branch-and-bound based heuristic algorithm for convex multi-objective MINLPs

This page was built for publication: Parallel partitioning method (PPM): A new exact method to solve bi-objective problems

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