Vincent T'Kindt – författare

A large number of real-life optimisation problems can only be realistically modelled with several~often conflicting~objectives. This fact requires us to abandon the concept of "optimal solution" in favour of vector optimization notions dealing with "efficient solution" and "efficient set". To solve these challenging multiobjective problems, the metaheuristics community has put forward a number of techniques commonly referred to as multiobjective meta- heuristics (MOMH). By its very nature, the field of MOMH covers a large research area both in terms of the types of problems solved and the techniques used to solve these problems. Its theoretical interest and practical applicability have attracted a large number of researchers and generated numerous papers, books and spe- cial issues. Moreover, several conferences and workshops have been organised, often specialising in specific sub-areas such as multiobjective evolutionary op- timisation. The main purpose of this volume is to provide an overview of the current state-of-the-art in the research field of MOMH.This overview is necessar- ily non-exhaustive, and contains both methodological and problem-oriented contributions, and applications of both population-based and neighbourhood- based heuristics. This volume originated from the workshop on multiobjective metaheuristics that was organised at the Carre des Sciences in Paris on November 4-5, 2002. This meeting was a joint effort of two working groups: ED jME and PM20.

Scheduling and multicriteria optimisation theory have been subject, separately, to numerous studies. Since the last twenty years, multicriteria scheduling problems have been subject to a growing interest. However, a gap between multicriteria scheduling approaches and multicriteria optimisation field exits. This book is an attempt to collect the elementary of multicriteria optimisation theory and the basic models and algorithms of multicriteria scheduling. It is composed of numerous illustrations, algorithms and examples which may help the reader in understanding the presented concepts. This book covers general concepts such as Pareto optimality, complexity theory, and general method for multicriteria optimisation, as well as dedicated scheduling problems and algorithms: just-in-time scheduling, flexibility and robustness, single machine problems, parallel machine problems, shop problems, etc. The second edition contains revisions and new material.

MOPGP is an international conference series devoted to multi-objective p- gramming and goal programming (MOP/GP). This conference brings together researchers and practitioners from different disciplines of Computer Science, Operational Research, Optimisation Engineering, Mathematical Programming and Multi-criteria Decision Analysis. Theoretical results and algorithmic developments in the ?eld of MOP and GP are covered, including practice and applications of MOP/GP in real-life situations. The MOP/GP international conferences are organised in a biennial cycle. The previous editions were held in United Kingdom (1994), Spain (1996), Canada (1998), Poland (2000), Japan (2002), and Tunisia (2004). The Seventh me- ing (MOPGP'06) was organised in the Loire Valley (Center-West of France) by X. Gandibleux, (University of Nantes, chairman) and V. T'Kindt (University of Tours, co-chairman). The conference was hosted during three days (June 12-14, 2006) by the old city hall of Tours which is located in the city centre of Tours. The conference comprised four plenary sessions (M. Ehrgott; P. Perny; R. Caballero and F. Ruiz; S. Oussedik) and six semi-plenary sessions (N. Jussien and V.Barichard; D. Corne and J. Knowles; H. Hoogeveen; M. Wiecek; E. Bampis; F. Ben Abdelaziz) and 82 regular talks. The (semi-)plenary speakers were invited, while the regular talks were selected by the international scienti?c committee composed of 61 eminent researchers on basis of a 4-pages abstract.

Scheduling and multicriteria optimisation theory have been subject, separately, to numerous studies. Since the last twenty years, multicriteria scheduling problems have been subject to a growing interest. However, a gap between multicriteria scheduling approaches and multicriteria optimisation field exits. This book is an attempt to collect the elementary of multicriteria optimisation theory and the basic models and algorithms of multicriteria scheduling. It is composed of numerous illustrations, algorithms and examples which may help the reader in understanding the presented concepts. This book covers general concepts such as Pareto optimality, complexity theory, and general method for multicriteria optimisation, as well as dedicated scheduling problems and algorithms: just-in-time scheduling, flexibility and robustness, single machine problems, parallel machine problems, shop problems, etc. The second edition contains revisions and new material.