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

DOI10.1016/j.cor.2005.09.014zbMath1147.90391OpenAlexW1966898882WikidataQ56920654 ScholiaQ56920654MaRDI QIDQ869006

El-Ghazali Talbi, J. Lemesre, 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

permutation flowshopexact methodBi-objective problem

Mathematics Subject Classification ID

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

Related Items

Generation of the exact Pareto set in multi-objective traveling salesman and set covering problems, \(K\)-PPM: a new exact method to solve multi-objective combinatorial optimization problems, A hybrid approach for biobjective optimization, Effective anytime algorithm for multiobjective combinatorial optimization problems, Modeling and solving the bi-objective minimum diameter-cost spanning tree problem, Finding a representative nondominated set for multi-objective mixed integer programs, A branch-and-bound based heuristic algorithm for convex multi-objective MINLPs, Solving multi-criteria scheduling flow shop problem through compromise programming and satisfaction functions, A Generic Branch-and-Cut Algorithm for Multiobjective Optimization Problems: Application to the Multilabel Traveling Salesman Problem, Multiobjective Integer Programming: Synergistic Parallel Approaches, An exact method for solving the bi-objective Minimum Diameter-Cost Spanning Tree Problem

Cites Work

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