Jacques Teghem - Academia.edu (original) (raw)

Papers by Jacques Teghem

arXiv (Cornell University), Jul 23, 2010

The knapsack problem (KP) and its multidimensional version (MKP) are basic problems in combinator... more The knapsack problem (KP) and its multidimensional version (MKP) are basic problems in combinatorial optimization. In this paper we consider their multiobjective extension (MOKP and MOMKP), for which the aim is to obtain or to approximate the set of efficient solutions. In a first step, we classify and describe briefly the existing works, that are essentially based on the use of metaheuristics. In a second step, we propose the adaptation of the twophase Pareto local search (2PPLS) to the resolution of the MOMKP. With this aim, we use a very-large scale neighborhood (VLSN) in the second phase of the method, that is the Pareto local search. We compare our results to state-of-the-art results and we show that we obtain results never reached before by heuristics, for the biobjective instances. Finally we consider the extension to three-objective instances.

Springer eBooks, 1990

Chapter 1. Multiobjective programming under uncertainty and goals of the book. R. SLOWINSKI (PL),... more Chapter 1. Multiobjective programming under uncertainty and goals of the book. R. SLOWINSKI (PL), J. TEGHEM (B) scope Chapter 2. Multiobjective programming approaches. basic concepts and D. VANDERPOOTEN (F) Chapter 3. Stochastic programming numerical solution vii 3 7 techniques by semi-stochastic approximation methods. 23 K. MARTI (D) Chapter 4. Fuzzy programming : a survey of recent developments. 45 M. INUIGUCHI (J), H. ICHlHASHI (J), H. TANAKA (J) Part II. THE STOCHASTIC APPROACH. Chapter 1. OVerview of different stochastic programming objective functions. I.M. STANCU-MINASIAN (R) approaches for problems with solving multiple Chapter 2. "STRANGE" : an interactive method for multiobjective stochastic linear programming, and "STRANGE-MOMIX" : 71 its extension to integer variables. 103 J. TEGHEM (B) Chapter 3. Application of STRANGE to energy studies. 117 P. L. KUNSCH (B) Chapter 4. Multiobjective stochastic linear programming with incomplete information: a general methodology. 131 B. URLI (CON), R. NADEAU (CON) Chapter 5. Computation of efficient solutions of stochastic optimization problems with applications to regression and scenario analysis. 163 K. MARTI (D) vi Part III. THE FUZZY APPROACH. Chapter 1. Interactive decision-making for mUltiobjective programming problems with fuzzy parameters. M. SAKAWA (J), H. YANO (J) Chapter 2. A possibilistic approach for multiobjective programming problems. Efficiency of solutions. M. DELGADO (E), J.L. VERDEGAY (E), M.A. VILA (E) Chapter 3. "FLIP" an interactive method for multiobjective linear programming with fuzzy coefficients. R. S~OWINSKI (PL) Chapter 4. Application of "FLIP" method to farm structure optimization under uncertainty. P. CZYZAK (PL) Chapter 5. "FULPAL" an interactive method for solving (multiobjective) fuzzy linear programming problems. H. ROMMELFANGER (D) Chapter 6. Multiple objective linear programming problems in the presence of fuzzy coefficients. 301 M.K. LUHANDJULA (DZ), M. SAKAWA (J) Chapter 7. Inequality constraints between fuzzy numbers and their use in mathematical programming. M. ROUBENS (B) Chapter 8. Using fuzzy logic with linguistic quantifiers in multiobjective decision making and optimization: A step towards more human-consistent models.

IFAC Proceedings Volumes, 2006

We first present in this paper the multicriteria case of the selective maintenance problem. This ... more We first present in this paper the multicriteria case of the selective maintenance problem. This problem consists in finding the best choice of maintenance actions to realize on a multicomponent system, so as to maximize the system reliability and minimize the maintenance cost, but with a limitation in the maintenance time. Since exact methods are inefficient when a lot of components compose the system, we applied a new general method, based on tabu search, for the resolution of multicriteria combinatorial optimization problems. The aim is to quickly generate a good approximation of the whole set of efficient solutions.

Chapman and Hall/CRC eBooks, Jun 3, 2014

HAL (Le Centre pour la Communication Scientifique Directe), Jun 6, 2012

The scheduling of parallel machines is a well-known problem in many companies. Nevertheless, not ... more The scheduling of parallel machines is a well-known problem in many companies. Nevertheless, not always all the jobs can be manufactured in any machine and the eligibility appears. Based on a real-life situation, we present a company which has three different sets of machines, called as high-level, medium-level and low-level respectively. Besides, there are release times and delivery times related to the respective previous operations and following operations to the main process to be carried in the parallel machines. A set of n jobs to be scheduled on these m parallel machines are also distributed among levels. One job from a level can be manufactured in a machine of the same or higher level. Initially all the jobs are processed on the machines of high level. But a penalty appears when a job is manufactured in a machine different of this initial level. The proposed algorithm solves the problem with two criteria: the minimization of the completion time or makespan, C max , and the minimization of the total penalty. The objective is to determine or to approximate the Pareto front. Several alternatives are presented according to different rules to move a job from one machine to another and compared through numerical experiments.

Control and Cybernetics, 2000

A bstract: Most of multiple criteria scheduling problems are NP-hard, so that exact procedures ca... more A bstract: Most of multiple criteria scheduling problems are NP-hard, so that exact procedures can only solve small problems and with two criteria. The complexity and the diversity of multiple criteria scheduling problems resulted in many alternative approaches to solve them. Exact and approximate procedures proposed in the literature are mainly dedicated to the problem to be solved and their performance depends on the problem data, on the criteria optimized, and are generally difficult to implement. We propose in this paper a Tabu Search approach to multiple criteria scheduling problems. The proposed procedure is a general flexible method, able to solve hard multiple criteria scheduling problems, easy to implement, and providing a set of potential efficient schedules. The criteria are any combination chosen from (Cmax, Tmax ,I, Nr and F).

Se plantea un problema de programacion de un conjunto de piezas en un sistema productivo formado ... more Se plantea un problema de programacion de un conjunto de piezas en un sistema productivo formado por tres maquinas identicas en paralelo, con elegibilidad, una vez definidos unos tiempos de pre-proceso, proceso y post-proceso para cad a pieza. Este problema no solo considera como objetivo minimizar el instante de finalizacion de la ultima pieza en el sistema, sino que ademas busca minimizar la penalizacion asociada al coste de utilizar maquinas con tecnologias menos eficientes para producir las piezas. Los procedimie ntos desarrollados para obtener el conjunto de soluciones (programaciones de piezas en maquinas) no dominadas se basan en la exploracion arborescente a partir de una solucion inicial. Inic ialmente no se tiene en cuenta si el movimiento realizado para encontrar una nueva solucion sera beneficioso o no para los futuros. Posteriormente, se disenan variantes mas complejas modificando los criterios de exploracion donde si se tiene en cuenta, lo que lleva a obtener soluciones de mayo r calidad. Para verificar la eficiencia de los procedimientos de resolucion propuestos, en la experiencia computacional se resuelven problemas de hasta 200 piezas.

Applied Mathematics and Computation, 1993

In this paper, we present an application of a MCDM decision support software (ORESTE) in an indus... more In this paper, we present an application of a MCDM decision support software (ORESTE) in an industrial context. The interactive implementation on a PC with graphical capabilities is especially appropriate to deal with data without crisp numerical knowledge. The input is highly interactive and the technical analysis is guided by dialogues. The case study concerns the assignment of available products to orders. The feasible assignments must be ranked taking into account different qualitative or quantitative characteristics of the products. 1.

HAL (Le Centre pour la Communication Scientifique Directe), Jul 21, 2016

L'objectif principal en proposant ces applications est de proposer l'approche "Data EnvelopmentAn... more L'objectif principal en proposant ces applications est de proposer l'approche "Data EnvelopmentAnalysis (DEA)" comme coutil de suivi et d'évaluation des programmes, projets ou le développement des activités du système national de santé. L'approche DEA est appliquée en utilisant le modèle de Charnes, Cooper and Rhodes(CCR), pour calculer les indices de mesure de performance et les indices de productivité de Malmquist pour mesurer les variations de productivité dans les régions et districts sanitaires. Les résultats obtenus montrent que le système de santé au Burkina Faso à travers les régions ou districts a connu un faible progrès mais le système relativement aux critères utilisés aurait pu accroître en termes de résultats vu les ressources allouées. Ces résultats permettent de constater une grande disparité en termes de performance des régions et districts du système national de santé. Des méthodes conventionnelles classiques sont déjà utilisées pour le cas du Burkina Faso pour analyser les performances, il nous semble être la première fois que l'approche DEA est utilisée pour analyser les performances du système burkinabè de santé. ABSTRACT.Our main concern in proposing these applications is to provide a tool, with is the Data Envelopment Analysis (DEA) approach, for contributing to monitoring and evaluating programs, projects or development activities of the national health system. DEA approach was applied using the Charnes, Cooper and Rhodes (CCR) model, to calculate the indices measuring the performance efficiencies and Malmquist indices for measuring changes in productivity of health regions and districts. The results obtained show that the health system of Burkina Faso through the regions or districts had a low progress but that the system on variables used may well occur with the inputs allocated. This can also be seen through the huge disparities in performance efficiency scores of different regions and districts of the health system. While conventional methods are already used for the case of Burkina Faso to analyze the performances, it will be a first time that DEA approach was used to analyze the performance of the health system.

International Journal of Industrial Engineering Computations, 2016

In this paper we investigate the use of lot streaming in non-permutation flowshop scheduling prob... more In this paper we investigate the use of lot streaming in non-permutation flowshop scheduling problems. The objective is to minimize the makespan subject to the standard flowshop constraints, but where it is now permitted to reorder jobs between machines. In addition, the jobs can be divided into manageable sublots, a strategy known as lot streaming. Computational experiments show that lot streaming reduces the makespan up to 43% for a wide range of instances when compared to the case in which no job splitting is applied. The benefits grow as the number of stages in the production process increases but reach a limit. Beyond a certain point, the division of jobs into additional sublots does not improve the solution.

Lecture Notes in Economics and Mathematical Systems, 1993

Simulated Annealing and a variant we call Locally Optimized Simulated Annealing are applied to an... more Simulated Annealing and a variant we call Locally Optimized Simulated Annealing are applied to an industrial problem : a collection of small containers of nuclear fuel have to be grouped in subsets that are as homogeneous as possible with respect to several criteria. The two algorithms are compared on real data and the sensitivity to parameter choice is explored.

Readings in Multiple Criteria Decision Aid, 1990

ABSTRACT

International Journal of …, 2010

A Hybrid Grouping Genetic Algorithm for the Inventory Routing Problem with multi-tours of the Veh... more A Hybrid Grouping Genetic Algorithm for the Inventory Routing Problem with multi-tours of the Vehicle International Journal of Combinatorial Optimization Problems and Informatics, vol. 1, núm. 2, septiembre-diciembre, 2010, pp. 42-61 International Journal of Combinatorial ...

Zeitschrift für Operations Research, 1979

The problem is to determine an explicit form for the stationary distribution of an imbedded Marko... more The problem is to determine an explicit form for the stationary distribution of an imbedded Markov Chain in aGI/M/S queue with balking and reneging.We first construct the discrete transforms — introduced bySubba Rao/Jaiswal [1969] — for this queueing system. Then, using this concept, we resolve the problem, obtaining a new way for determining the transition probabilities of the imbedded Markov chain.ZusammenfassungThema dieses Aufsatzes ist die Bestimmung der stationären Verteilung einer eingebetteten Markov-Kette in einemGI/M/S Wartesystem mit ungeduldigen Kunden. Anhand der vonSubba Rao/Jaiswal [1969] eingeführten diskreten Transformation gelingt es, die Übergangswahrscheinlichkeiten der eingebetteten Markov-Kette explizit zu bestimmen.

European Journal of Operational Research, 2002

International Journal of Production Economics, 1991

ABSTRACT

ABSTRACT Pour assurer une production de biens de qualité, de manière fiable et dans des délais ma... more ABSTRACT Pour assurer une production de biens de qualité, de manière fiable et dans des délais maîtrisés, les organisations ont besoin d’outils d'exécution optimale de tâches tels que l’ordonnancement. Le succès des méthodologies de résolution des problèmes d’ordonnancement de production basées sur les métaheuristiques s’explique par leur capacité à fournir des solutions proches de l’optimum, dans des temps raisonnables. Cet ouvrage se consacre, dans un premier temps, aux métaheuristiques appliquées aux problèmes d’ordonnancement multicritère, qui sont des cas particuliers des problèmes d’optimisation combinatoire multicritère, généralement NP-difficiles. Puis, il s’intéresse aux préoccupations d’ordonnancement dans le secteur du transport qui suscitent également de multiples problèmes d’optimisation. Deux grands domaines d’application se distinguent, celui des systèmes de transport et celui des ressources de transport intervenant dans un atelier.

In the last few decades, a number of powerful methods have been proposed to find satisfactory sol... more In the last few decades, a number of powerful methods have been proposed to find satisfactory solutions to management problems of great importance in economies open to competition. They have been successfully applied to solve a large variety of operational problems both in the private and public sector: for example, production scheduling and sequencing, transportation, traffic management, distribution of goods and portfolio selection. The first half of this book presents an overview of these methods, while the second half focuses on applications. More precisely, it describes how to tailor heuristics to get the best results in a variety of selected typical problems.

arXiv (Cornell University), Jul 23, 2010

The knapsack problem (KP) and its multidimensional version (MKP) are basic problems in combinator... more The knapsack problem (KP) and its multidimensional version (MKP) are basic problems in combinatorial optimization. In this paper we consider their multiobjective extension (MOKP and MOMKP), for which the aim is to obtain or to approximate the set of efficient solutions. In a first step, we classify and describe briefly the existing works, that are essentially based on the use of metaheuristics. In a second step, we propose the adaptation of the twophase Pareto local search (2PPLS) to the resolution of the MOMKP. With this aim, we use a very-large scale neighborhood (VLSN) in the second phase of the method, that is the Pareto local search. We compare our results to state-of-the-art results and we show that we obtain results never reached before by heuristics, for the biobjective instances. Finally we consider the extension to three-objective instances.

Springer eBooks, 1990

Chapter 1. Multiobjective programming under uncertainty and goals of the book. R. SLOWINSKI (PL),... more Chapter 1. Multiobjective programming under uncertainty and goals of the book. R. SLOWINSKI (PL), J. TEGHEM (B) scope Chapter 2. Multiobjective programming approaches. basic concepts and D. VANDERPOOTEN (F) Chapter 3. Stochastic programming numerical solution vii 3 7 techniques by semi-stochastic approximation methods. 23 K. MARTI (D) Chapter 4. Fuzzy programming : a survey of recent developments. 45 M. INUIGUCHI (J), H. ICHlHASHI (J), H. TANAKA (J) Part II. THE STOCHASTIC APPROACH. Chapter 1. OVerview of different stochastic programming objective functions. I.M. STANCU-MINASIAN (R) approaches for problems with solving multiple Chapter 2. "STRANGE" : an interactive method for multiobjective stochastic linear programming, and "STRANGE-MOMIX" : 71 its extension to integer variables. 103 J. TEGHEM (B) Chapter 3. Application of STRANGE to energy studies. 117 P. L. KUNSCH (B) Chapter 4. Multiobjective stochastic linear programming with incomplete information: a general methodology. 131 B. URLI (CON), R. NADEAU (CON) Chapter 5. Computation of efficient solutions of stochastic optimization problems with applications to regression and scenario analysis. 163 K. MARTI (D) vi Part III. THE FUZZY APPROACH. Chapter 1. Interactive decision-making for mUltiobjective programming problems with fuzzy parameters. M. SAKAWA (J), H. YANO (J) Chapter 2. A possibilistic approach for multiobjective programming problems. Efficiency of solutions. M. DELGADO (E), J.L. VERDEGAY (E), M.A. VILA (E) Chapter 3. "FLIP" an interactive method for multiobjective linear programming with fuzzy coefficients. R. S~OWINSKI (PL) Chapter 4. Application of "FLIP" method to farm structure optimization under uncertainty. P. CZYZAK (PL) Chapter 5. "FULPAL" an interactive method for solving (multiobjective) fuzzy linear programming problems. H. ROMMELFANGER (D) Chapter 6. Multiple objective linear programming problems in the presence of fuzzy coefficients. 301 M.K. LUHANDJULA (DZ), M. SAKAWA (J) Chapter 7. Inequality constraints between fuzzy numbers and their use in mathematical programming. M. ROUBENS (B) Chapter 8. Using fuzzy logic with linguistic quantifiers in multiobjective decision making and optimization: A step towards more human-consistent models.

IFAC Proceedings Volumes, 2006

We first present in this paper the multicriteria case of the selective maintenance problem. This ... more We first present in this paper the multicriteria case of the selective maintenance problem. This problem consists in finding the best choice of maintenance actions to realize on a multicomponent system, so as to maximize the system reliability and minimize the maintenance cost, but with a limitation in the maintenance time. Since exact methods are inefficient when a lot of components compose the system, we applied a new general method, based on tabu search, for the resolution of multicriteria combinatorial optimization problems. The aim is to quickly generate a good approximation of the whole set of efficient solutions.

Chapman and Hall/CRC eBooks, Jun 3, 2014

HAL (Le Centre pour la Communication Scientifique Directe), Jun 6, 2012

The scheduling of parallel machines is a well-known problem in many companies. Nevertheless, not ... more The scheduling of parallel machines is a well-known problem in many companies. Nevertheless, not always all the jobs can be manufactured in any machine and the eligibility appears. Based on a real-life situation, we present a company which has three different sets of machines, called as high-level, medium-level and low-level respectively. Besides, there are release times and delivery times related to the respective previous operations and following operations to the main process to be carried in the parallel machines. A set of n jobs to be scheduled on these m parallel machines are also distributed among levels. One job from a level can be manufactured in a machine of the same or higher level. Initially all the jobs are processed on the machines of high level. But a penalty appears when a job is manufactured in a machine different of this initial level. The proposed algorithm solves the problem with two criteria: the minimization of the completion time or makespan, C max , and the minimization of the total penalty. The objective is to determine or to approximate the Pareto front. Several alternatives are presented according to different rules to move a job from one machine to another and compared through numerical experiments.

Control and Cybernetics, 2000

A bstract: Most of multiple criteria scheduling problems are NP-hard, so that exact procedures ca... more A bstract: Most of multiple criteria scheduling problems are NP-hard, so that exact procedures can only solve small problems and with two criteria. The complexity and the diversity of multiple criteria scheduling problems resulted in many alternative approaches to solve them. Exact and approximate procedures proposed in the literature are mainly dedicated to the problem to be solved and their performance depends on the problem data, on the criteria optimized, and are generally difficult to implement. We propose in this paper a Tabu Search approach to multiple criteria scheduling problems. The proposed procedure is a general flexible method, able to solve hard multiple criteria scheduling problems, easy to implement, and providing a set of potential efficient schedules. The criteria are any combination chosen from (Cmax, Tmax ,I, Nr and F).

Se plantea un problema de programacion de un conjunto de piezas en un sistema productivo formado ... more Se plantea un problema de programacion de un conjunto de piezas en un sistema productivo formado por tres maquinas identicas en paralelo, con elegibilidad, una vez definidos unos tiempos de pre-proceso, proceso y post-proceso para cad a pieza. Este problema no solo considera como objetivo minimizar el instante de finalizacion de la ultima pieza en el sistema, sino que ademas busca minimizar la penalizacion asociada al coste de utilizar maquinas con tecnologias menos eficientes para producir las piezas. Los procedimie ntos desarrollados para obtener el conjunto de soluciones (programaciones de piezas en maquinas) no dominadas se basan en la exploracion arborescente a partir de una solucion inicial. Inic ialmente no se tiene en cuenta si el movimiento realizado para encontrar una nueva solucion sera beneficioso o no para los futuros. Posteriormente, se disenan variantes mas complejas modificando los criterios de exploracion donde si se tiene en cuenta, lo que lleva a obtener soluciones de mayo r calidad. Para verificar la eficiencia de los procedimientos de resolucion propuestos, en la experiencia computacional se resuelven problemas de hasta 200 piezas.

Applied Mathematics and Computation, 1993

In this paper, we present an application of a MCDM decision support software (ORESTE) in an indus... more In this paper, we present an application of a MCDM decision support software (ORESTE) in an industrial context. The interactive implementation on a PC with graphical capabilities is especially appropriate to deal with data without crisp numerical knowledge. The input is highly interactive and the technical analysis is guided by dialogues. The case study concerns the assignment of available products to orders. The feasible assignments must be ranked taking into account different qualitative or quantitative characteristics of the products. 1.

HAL (Le Centre pour la Communication Scientifique Directe), Jul 21, 2016

L'objectif principal en proposant ces applications est de proposer l'approche "Data EnvelopmentAn... more L'objectif principal en proposant ces applications est de proposer l'approche "Data EnvelopmentAnalysis (DEA)" comme coutil de suivi et d'évaluation des programmes, projets ou le développement des activités du système national de santé. L'approche DEA est appliquée en utilisant le modèle de Charnes, Cooper and Rhodes(CCR), pour calculer les indices de mesure de performance et les indices de productivité de Malmquist pour mesurer les variations de productivité dans les régions et districts sanitaires. Les résultats obtenus montrent que le système de santé au Burkina Faso à travers les régions ou districts a connu un faible progrès mais le système relativement aux critères utilisés aurait pu accroître en termes de résultats vu les ressources allouées. Ces résultats permettent de constater une grande disparité en termes de performance des régions et districts du système national de santé. Des méthodes conventionnelles classiques sont déjà utilisées pour le cas du Burkina Faso pour analyser les performances, il nous semble être la première fois que l'approche DEA est utilisée pour analyser les performances du système burkinabè de santé. ABSTRACT.Our main concern in proposing these applications is to provide a tool, with is the Data Envelopment Analysis (DEA) approach, for contributing to monitoring and evaluating programs, projects or development activities of the national health system. DEA approach was applied using the Charnes, Cooper and Rhodes (CCR) model, to calculate the indices measuring the performance efficiencies and Malmquist indices for measuring changes in productivity of health regions and districts. The results obtained show that the health system of Burkina Faso through the regions or districts had a low progress but that the system on variables used may well occur with the inputs allocated. This can also be seen through the huge disparities in performance efficiency scores of different regions and districts of the health system. While conventional methods are already used for the case of Burkina Faso to analyze the performances, it will be a first time that DEA approach was used to analyze the performance of the health system.

International Journal of Industrial Engineering Computations, 2016

In this paper we investigate the use of lot streaming in non-permutation flowshop scheduling prob... more In this paper we investigate the use of lot streaming in non-permutation flowshop scheduling problems. The objective is to minimize the makespan subject to the standard flowshop constraints, but where it is now permitted to reorder jobs between machines. In addition, the jobs can be divided into manageable sublots, a strategy known as lot streaming. Computational experiments show that lot streaming reduces the makespan up to 43% for a wide range of instances when compared to the case in which no job splitting is applied. The benefits grow as the number of stages in the production process increases but reach a limit. Beyond a certain point, the division of jobs into additional sublots does not improve the solution.

Lecture Notes in Economics and Mathematical Systems, 1993

Simulated Annealing and a variant we call Locally Optimized Simulated Annealing are applied to an... more Simulated Annealing and a variant we call Locally Optimized Simulated Annealing are applied to an industrial problem : a collection of small containers of nuclear fuel have to be grouped in subsets that are as homogeneous as possible with respect to several criteria. The two algorithms are compared on real data and the sensitivity to parameter choice is explored.

Readings in Multiple Criteria Decision Aid, 1990

ABSTRACT

International Journal of …, 2010

A Hybrid Grouping Genetic Algorithm for the Inventory Routing Problem with multi-tours of the Veh... more A Hybrid Grouping Genetic Algorithm for the Inventory Routing Problem with multi-tours of the Vehicle International Journal of Combinatorial Optimization Problems and Informatics, vol. 1, núm. 2, septiembre-diciembre, 2010, pp. 42-61 International Journal of Combinatorial ...

Zeitschrift für Operations Research, 1979

The problem is to determine an explicit form for the stationary distribution of an imbedded Marko... more The problem is to determine an explicit form for the stationary distribution of an imbedded Markov Chain in aGI/M/S queue with balking and reneging.We first construct the discrete transforms — introduced bySubba Rao/Jaiswal [1969] — for this queueing system. Then, using this concept, we resolve the problem, obtaining a new way for determining the transition probabilities of the imbedded Markov chain.ZusammenfassungThema dieses Aufsatzes ist die Bestimmung der stationären Verteilung einer eingebetteten Markov-Kette in einemGI/M/S Wartesystem mit ungeduldigen Kunden. Anhand der vonSubba Rao/Jaiswal [1969] eingeführten diskreten Transformation gelingt es, die Übergangswahrscheinlichkeiten der eingebetteten Markov-Kette explizit zu bestimmen.

European Journal of Operational Research, 2002

International Journal of Production Economics, 1991

ABSTRACT

ABSTRACT Pour assurer une production de biens de qualité, de manière fiable et dans des délais ma... more ABSTRACT Pour assurer une production de biens de qualité, de manière fiable et dans des délais maîtrisés, les organisations ont besoin d’outils d'exécution optimale de tâches tels que l’ordonnancement. Le succès des méthodologies de résolution des problèmes d’ordonnancement de production basées sur les métaheuristiques s’explique par leur capacité à fournir des solutions proches de l’optimum, dans des temps raisonnables. Cet ouvrage se consacre, dans un premier temps, aux métaheuristiques appliquées aux problèmes d’ordonnancement multicritère, qui sont des cas particuliers des problèmes d’optimisation combinatoire multicritère, généralement NP-difficiles. Puis, il s’intéresse aux préoccupations d’ordonnancement dans le secteur du transport qui suscitent également de multiples problèmes d’optimisation. Deux grands domaines d’application se distinguent, celui des systèmes de transport et celui des ressources de transport intervenant dans un atelier.

In the last few decades, a number of powerful methods have been proposed to find satisfactory sol... more In the last few decades, a number of powerful methods have been proposed to find satisfactory solutions to management problems of great importance in economies open to competition. They have been successfully applied to solve a large variety of operational problems both in the private and public sector: for example, production scheduling and sequencing, transportation, traffic management, distribution of goods and portfolio selection. The first half of this book presents an overview of these methods, while the second half focuses on applications. More precisely, it describes how to tailor heuristics to get the best results in a variety of selected typical problems.