K-PPM: A new exact method to solve multi-objective combinatorial optimization problems

European Journal of Operational Research

Volumn 200, Issue 1, 2010, Pages 45-53

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

^a ECOLE CENTRALE DE LILLE   (France)

Author keywords

Combinatorial optimization; Exact method; Flow shop problem; Multi objective problem

Indexed keywords

EXACT METHOD; EXACT METHODS; FLOW SHOP PROBLEMS; FLOW-SHOP PROBLEM; MULTI OBJECTIVE; MULTI-OBJECTIVE PROBLEM; MULTIOBJECTIVE COMBINATORIAL OPTIMIZATION; PARTITIONING METHODS; SEARCH SPACES;

MULTIOBJECTIVE OPTIMIZATION; PULSE MODULATION; PULSE POSITION MODULATION;

COMBINATORIAL OPTIMIZATION;

EID: 69249226219     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ejor.2008.12.034     Document Type: Article

References (18)

1. https://www.grid5000.fr/mediawiki/index.php/.
2. Du J., and Leung J.Y.T. Minimizing total tardiness on one machine is NP-hard. Mathematics of Operations Research 15 (1990) 483-495
3. Ehrgott M., and Tenfelde-Podehl D. Computation of ideal and nadir values and implications for their use in MCDM methods. European Journal of Operational Research 151 1 (2003) 119-139
4. Ehrgott M., Tenfelde-Podehl D., and Stephan T. A level set method for multiobjective combinatorial optimization: Application to the quadratic assignment problem. Pacific Journal of Optimization 2 3 (2006) 521-544
5. Garey M.R., Johnson D.S., and Sethi R. The complexity of flow-shop and job-shop scheduling. Mathematics of Operations Research 1 (1976) 117-129
6. Graham R.L., Lawler E.L., Lenstra J.K., and Rinnooy Kan A.H.G. Optimization and approximation in deterministic sequencing and scheduling: A survey. In Annals of Discrete Mathematics 5 (1979) 287-326
7. 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
8. M. Laumanns, L. Thiele, E. Zitzler, An adaptive scheme to generate the Pareto front based on the epsilon-constraint method, in: Practical Approaches to Multi-Objective Optimization, 2005.
9. Lemesre J., Dhaenens C., and Talbi E.G. An exact parallel method for a bi-objective permutation flowshop problem. European Journal of Operational Research 177 3 (2007) 1641-1655
10. Lemesre J., Dhaenens C., and Talbi E.G. Parallel Partitioning Method (PPM): A new exact method to solve bi-objective problems. Computers and Operations Research (Elsevier) 34 (2007) 2450-2462
11. Lenstra J.K., Rinnooy Kan A.H.G., and Brucker P. Complexity of machine scheduling problems. Annals of Discrete Mathematics 1 (1977) 343-362
12. Nagar A., Haddock J., and Heragu S. Multiple and bicriteria scheduling: A literature survey. European Journal of Operational Research 81 (1995) 88-104
13. Reeves C.R. A genetic algorithm for flow-shop sequencing. Computers and Operations Research 22 (1995) 5-13
14. Sayin S., and Karabati S. A bicriteria approach to the two-machine flow shop scheduling problem. European Journal of Operational Research 113 (1999) 435-449
15. Taillard E. Benchmarks for basic scheduling problems. European Journal of Operational Research 64 (1993) 278-285
16. D. Tenfelde-Podehl, A recursive algorithm for multi-objective combinatorial optimization problems with q-criteria, Unpublished, 2003.
17. T'Kindt V., and Billaut J.-C. Multicriteria Scheduling: Theory Models and Algorithms (2002), Springer-Verlag
18. Ulungu E.L., and Teghem J. The two-phase method: An efficient procedure to solve bi-objective combinatorial optimization problems. Foundations of Computing and Decision Sciences 20 2 (1995) 149-165