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

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.

[1]  E.L. Lawler,et al.  Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey , 1977 .

[2]  Colin R. Reeves,et al.  A genetic algorithm for flowshop sequencing , 1995, Comput. Oper. Res..

[3]  Ravi Sethi,et al.  The Complexity of Flowshop and Jobshop Scheduling , 1976, Math. Oper. Res..

[4]  A. Nagar,et al.  Multiple and bicriteria scheduling : A literature survey , 1995 .

[5]  Jean-Charles Billaut,et al.  Multicriteria scheduling , 2005, Eur. J. Oper. Res..

[6]  Xavier Gandibleux,et al.  A survey and annotated bibliography of multiobjective combinatorial optimization , 2000, OR Spectr..

[7]  Éric D. Taillard,et al.  Benchmarks for basic scheduling problems , 1993 .

[8]  Srikanth K. Iyer,et al.  Improved genetic algorithm for the permutation flowshop scheduling problem , 2004, Comput. Oper. Res..

[9]  Jacques Teghem,et al.  Two-phases Method and Branch and Bound Procedures to Solve the Bi–objective Knapsack Problem , 1998, J. Glob. Optim..

[10]  Ammar Oulamara,et al.  Permutation flowshop scheduling problems with maximal and minimal time lags , 2006, Comput. Oper. Res..

[11]  Jose M. Framiñan,et al.  Comparison of heuristics for flowtime minimisation in permutation flowshops Technical report IO-2003 / 01 Version 0 . 5 Last version : 26 / 07 / 2003 , 2004 .

[12]  Yacov Y. Haimes,et al.  Multiobjective optimization in water resources systems : the surrogate worth trade-off method , 1975 .

[13]  Clarisse Dhaenens,et al.  Cooperation between Branch and Bound and Evolutionary Approaches to Solve a Bi-objective Flow Shop Problem , 2004, WEA.

[14]  Clarisse Dhaenens,et al.  An exact parallel method for a bi-objective permutation flowshop problem , 2007, Eur. J. Oper. Res..

[15]  Joseph Y.-T. Leung,et al.  Minimizing Total Tardiness on One Machine is NP-Hard , 1990, Math. Oper. Res..

[16]  L. Lasdon,et al.  On a bicriterion formation of the problems of integrated system identification and system optimization , 1971 .