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

Authors:
J. Lemesre;C. Dhaenens;E. G. Talbi
Affiliations:
LIFL, Bítiment M3, Université de Lille I, 59655 Villeneuve d'Ascq cedex, France;LIFL, Bítiment M3, Université de Lille I, 59655 Villeneuve d'Ascq cedex, France;LIFL, Bítiment M3, Université de Lille I, 59655 Villeneuve d'Ascq cedex, France
Venue:
Computers and Operations Research
Year:
2007

Citing 7
Cited 4

Minimizing total tardiness on one machine is NP-hard

Mathematics of Operations Research
A genetic algorithm for flowshop sequencing

Computers and Operations Research - Special issue on genetic algorithms
Two-phases Method and Branch and Bound Procedures to Solve the Bi–objective Knapsack Problem

Journal of Global Optimization
Improved genetic algorithm for the permutation flowshop scheduling problem

Computers and Operations Research
Comparison of heuristics for flowtime minimisation in permutation flowshops

Computers and Operations Research
Permutation flowshop scheduling problems with maximal and minimal time lags

Computers and Operations Research
Multicriteria Scheduling: Theory, Models and Algorithms

Multicriteria Scheduling: Theory, Models and Algorithms

Parallel Approaches for Multiobjective Optimization

Multiobjective Optimization
A survey on multi-constrained optimal path computation: Exact and approximate algorithms

Computer Networks: The International Journal of Computer and Telecommunications Networking
A Generic Branch-and-Cut Algorithm for Multiobjective Optimization Problems: Application to the Multilabel Traveling Salesman Problem

INFORMS Journal on Computing
Approximating multi-objective scheduling problems

Computers and Operations Research

Quantified Score

Hi-index	0.01

Visualization

Abstract

In this paper, we propose a new exact method, called the parallel partitioning method (PPM), able to solve efficiently bi-objective problems. This method is based on the splitting of the search space into several areas leading to elementary exact searches. We compare this method with the well-known two-phase method (TPM). Experiments are carried out on a bi-objective permutation flowshop problem (BOFSP). During experiments the proposed PPM is compared with two versions of TPM: the basic TPM and an improved TPM dedicated to scheduling problems. Experiments show the efficiency of the new proposed method.