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

Computers and Operations Research

Volumn 34, Issue 8, 2007, Pages 2450-2462

  Lemesre, J ^a   Dhaenens, C ^a   Talbi, E G ^a  

^a UNIV LILLE   (France)

Author keywords

Bi objective problem; Exact method; Permutation flowshop

Indexed keywords

NUMERICAL METHODS; PROBLEM SOLVING; SCHEDULING;

BI-OBJECTIVE PROBLEM; EXACT METHOD; PARALLEL PARTITIONING METHOD (PPM); PERMUTATION FLOWSHOP;

PARALLEL PROCESSING SYSTEMS;

EID: 33846076651     PISSN: 03050548     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cor.2005.09.014     Document Type: Article

References (17)

1. Ehrgott M., and Gandibleux X. A survey and annoted bibliography of multiobjective combinatorial optimization. OR Spektrum 22 4 (2000) 425-460
2. T'Kindt V., and Billaut J.-C. Multicriteria scheduling: theory, models and algorithms (2002), Springer, Berlin
3. Haimes Y., Ladson L., and Wismer D. On a bicriterion formulation of the problems of integrated system identification and system optimization. IEEE Transaction on System, Man and Cybernetics 1 (1971) 296-297
4. Haimes Y., Hall W., and Freedman H. Multiobjective optimization in water resource systems: the surrogate worth trade off method (1975), Elsevier, New York
5. Ulungu E., and Teghem J. The two phases method: an efficient procedure to solve bi-objective combinatorial optimization problems. Foundations of Computing and Decision Sciences 20 2 (1995) 149-165
6. Iyer S.K., and Saxena B. Improved genetic algorithm for the permutation flowshop scheduling problem. Computers and Operations Research 31 4 (2004) 593-606
7. Framinan J.M., Leisten R., and Ruiz-Usano R. Comparison of heuristics for flowtime minimisation in permutation flowshops. Computers and Operations Research 32 5 (2005) 1237-1254
8. Fondrevelle J, Oulamara A, Portmann M. Permutation flowshop scheduling problems with maximal and minimal time lags. Computers and Operations Research 2005;33(6):1540-56.
9. Nagar A., Haddock J., and Heragu S. Multiple and bicriteria scheduling: a literature survey. European Journal of Operational Research 81 (1995) 88-104
10. Graham R.L., Lawler E.L., Lenstra J.K., and Kan A.H.G.R. Optimization and approximation in deterministic sequencing and scheduling: a survey. Annals of Discrete Mathematics 5 (1979) 287-326
11. Garey M., Johnson D., and Sethi R. The complexity of flow-shop and job-shop scheduling. Mathematics of Operations Research 1 (1976) 117-129
12. Du J., and Leung J.Y.-T. Minimizing total tardiness on one machine is NP-hard. Mathematics of Operations Research 15 (1990) 483-495
13. Lemesre J, Dhaenens C, Talbi E. An exact parallel method for a bi-objective permutation flowshop problem. European Journal of Operational Research, to appear.
14. Visée M., Teghem J., Pirlot M., and Ulungu E. Two-phases method and branch and bound procedures to solve the bi-objective knapsack problem. Journal of Global Optimization 12 (1998) 139-155
15. Taillard E. Benchmarks for basic scheduling problems. European Journal of Operational Research 64 (1993) 278-285
16. Reeves C. A genetic algorithm for flowshop sequencing. Computers and Operations Research 22 (1995) 5-13
17. Basseur M, Lemesre J, Dhaenens C, Talbi E-G. Cooperation between branch and bound and evolutionary approaches to solve a biobjective flow shop problem. In: Workshop on experimental and efficient algorithms (WEA'04), Rio de Janeiro, Brasil; 2004. p. 72-86.