Download or read book Algorithmes m taheuristiques pour l ordonnancement des syst mes de production de type job shop et flow shop written by Tarik Lamoudan and published by . This book was released on 2011 with total page 272 pages. Available in PDF, EPUB and Kindle. Book excerpt: La thèse traite de l’ordonnancent d’ateliers de type « job shop » et « flow shop », deux problèmes largement étudiés dans la littérature sous leurs formes classiques. Notre contribution porte sur l’intégration des contraintes de transport des tâches entre les machines en utilisant un nombre fini de convoyeurs. Pour les deux problèmes nous avons donné une nouvelle modélisation mathématique en tenant compte des contraintes additionnelles qui portent, entre autres, sur les temps de transport et les différentes caractéristiques des ressources (capacités, nombre, temps de disponibilité, etc). Puis nous avons proposé une nouvelle approche de résolution basée sur l’algorithme des colonies de fourmis.
Download or read book Flow shop deux machines avec des temps de latence written by and published by . This book was released on 2008 with total page pages. Available in PDF, EPUB and Kindle. Book excerpt: Un ordonnancement est défini comme étant une allocation, dans le temps, des ressources (machines) disponibles aux différents travaux (tâches, jobs) à réaliser, dans le but d'optimiser un ou plusieurs objectifs. La richesse de la problématique de l'ordonnancement est due aux différentes interprétations que peuvent prendre les ressources et tâches. Ainsi, les ressources peuvent être des machines dans un atelier, des pistes de décollage et d'atterrissage dans un aéroport, des équipes dans un terrain de construction, des processeurs dans les ordinateurs, etc. Les tâches, quant à elles, peuvent être des opérations dans un processus de production, le décollage et l'atterrissage dans un aéroport, les étapes d'un projet de construction, l'exécution d'un programme informatique, etc. Les différentes tâches sont caractérisées par un degré de priorité et un temps d'exécution. Les ressources, quant à elles, sont caractérisées entre autres par une capacité, des temps de réglage, etc. Les problèmes d'ordonnancement sont généralement classés en deux modèles dépendamment du nombre d'opérations que requièrent les jobs: les modèles à une opération (modèle à machine unique et modèle à machines parallèles) et les modèles à plusieurs opérations dits modèles en ateliers (flow-shop, open-shop et job-shop). Bien entendu, il est également possible de trouver d'autres modèles, hybrides, qui sont des mélanges de ces deux modèles. Cette classification a permis, un tant soit peu, de mieux comprendre et cerner les problèmes d'ordonnancement réels. Toutefois, l'expérience a montré qu'il existe toujours un gouffre entre la théorie et ce qui se passe réellement dans les centres de production ou les prestations de services. Parmi les contraintes que la théorie d'ordonnancement n'a pas considérées jusqu'à un passé récent, nous pouvons citer les temps de latence des travaux, correspondant aux différents temps nécessaires devant s'écouler entre la fin d'une opération et le début de la prochaine opératio.
Download or read book Metaheuristics for Production Scheduling written by Bassem Jarboui and published by John Wiley & Sons. This book was released on 2013-06-24 with total page 0 pages. Available in PDF, EPUB and Kindle. Book excerpt: This book describes the potentialities of metaheuristics for solving production scheduling problems and the relationship between these two fields. For the past several years, there has been an increasing interest in using metaheuristic methods to solve scheduling problems. The main reasons for this are that such problems are generally hard to solve to optimality, as well as the fact that metaheuristics provide very good solutions in a reasonable time. The first part of the book presents eight applications of metaheuristics for solving various mono-objective scheduling problems. The second part is itself split into two, the first section being devoted to five multi-objective problems to which metaheuristics are adapted, while the second tackles various transportation problems related to the organization of production systems. Many real-world applications are presented by the authors, making this an invaluable resource for researchers and students in engineering, economics, mathematics and computer science. Contents 1. An Estimation of Distribution Algorithm for Solving Flow Shop Scheduling Problems with Sequence-dependent Family Setup Times, Mansour Eddaly, Bassem Jarboui, Radhouan Bouabda, Patrick Siarry and Abdelwaheb Rebaï. 2. Genetic Algorithms for Solving Flexible Job Shop Scheduling Problems, Imed Kacem. 3. A Hybrid GRASP-Differential Evolution Algorithm for Solving Flow Shop Scheduling Problems with No-Wait Constraints, Hanen Akrout, Bassem Jarboui, Patrick Siarry and Abdelwaheb Rebaï. 4. A Comparison of Local Search Metaheuristics for a Hierarchical Flow Shop Optimization Problem with Time Lags, Emna Dhouib, Jacques Teghem, Daniel Tuyttens and Taïcir Loukil. 5. Neutrality in Flow Shop Scheduling Problems: Landscape Structure and Local Search, Marie-Eléonore Marmion. 6. Evolutionary Metaheuristic Based on Genetic Algorithm: Application to Hybrid Flow Shop Problem with Availability Constraints, Nadia Chaaben, Racem Mellouli and Faouzi Masmoudi. 7. Models and Methods in Graph Coloration for Various Production Problems, Nicolas Zufferey. 8. Mathematical Programming and Heuristics for Scheduling Problems with Early and Tardy Penalties, Mustapha Ratli, Rachid Benmansour, Rita Macedo, Saïd Hanafi, Christophe Wilbaut. 9. Metaheuristics for Biobjective Flow Shop Scheduling, Matthieu Basseur and Arnaud Liefooghe. 10. Pareto Solution Strategies for the Industrial Car Sequencing Problem, Caroline Gagné, Arnaud Zinflou and Marc Gravel. 11. Multi-Objective Metaheuristics for the Joint Scheduling of Production and Maintenance, Ali Berrichi and Farouk Yalaoui. 12. Optimization via a Genetic Algorithm Parametrizing the AHP Method for Multicriteria Workshop Scheduling, Fouzia Ounnar, Patrick Pujo and Afef Denguir. 13. A Multicriteria Genetic Algorithm for the Resource-constrained Task Scheduling Problem, Olfa Dridi, Saoussen Krichen and Adel Guitouni. 14. Metaheuristics for the Solution of Vehicle Routing Problems in a Dynamic Context, Tienté Hsu, Gilles Gonçalves and Rémy Dupas. 15. Combination of a Metaheuristic and a Simulation Model for the Scheduling of Resource-constrained Transport Activities, Virginie André, Nathalie Grangeon and Sylvie Norre. 16. Vehicle Routing Problems with Scheduling Constraints, Rahma Lahyani, Frédéric Semet and Benoît Trouillet. 17. Metaheuristics for Job Shop Scheduling with Transportation, Qiao Zhang, Hervé Manier, Marie-Ange Manier. About the Authors Bassem Jarboui is Professor at the University of Sfax, Tunisia. Patrick Siarry is Professor at the Laboratoire Images, Signaux et Systèmes Intelligents (LISSI), University of Paris-Est Créteil, France. Jacques Teghem is Professor at the University of Mons, Belgium.
Download or read book Sur l ordonnancement d ateliers job shop flexibles et flow shop en industries pharmaceutiques written by Hela Boukef and published by . This book was released on 2009 with total page 105 pages. Available in PDF, EPUB and Kindle. Book excerpt: Pour la résolution de problèmes d'ordonnancement d'ateliers de type flow-shop en industries pharmaceutiques et d'ateliers de type job-shop flexible, deux méthodes d'optimisation ont été développées : une méthode utilisant les algorithmes génétiques dotés d'un nouveau codage proposé et une méthode d'optimisation par essaim particulaire modifiée pour être exploitée dans le cas discret. Les critères retenus dans le cas de lignes de conditionnement considérées sont la minimisation des coûts de production ainsi que des coûts de non utilisation des machines pour les problèmes multi-objectifs relatifs aux industries pharmaceutiques et la minimisation du Makespan pour les problèmes mono-objectif des ateliers job-shop flexibles.Ces méthodes ont été appliquées à divers exemples d'ateliers de complexités distinctes pour illustrer leur mise en œuvre. L'étude comparative des résultats ainsi obtenus a montré que la méthode basée sur l'optimisation par essaim particulaire est plus efficace que celle des algorithmes génétiques, en termes de rapidité de la convergence et de l'approche de la solution optimale.
Download or read book ROBUST OPTIMIZATION ALGORITHMS FOR THE FLOW SHOP AND JOB SHOP SCHEDULING PROBLEMS WITH RANDOM FAILURES AND PREVENTIVE MAINTENANCE written by Rafael Lucas Costa Souza and published by . This book was released on 2021 with total page 0 pages. Available in PDF, EPUB and Kindle. Book excerpt: Inspired by a real-life problem in the kitchen cabinet manufacturing industry, this thesis proposes a suite of algorithms for solving the flow shop and the job shop scheduling problems (FSP & JSP) with both scheduled (preventive) maintenance and random breakdowns. These algorithms aim at obtaining schedules that strike a good balance between performance quality (i.e., shortest expected makespan) and solution robustness (i.e., least affected by breakdowns). The proposed scheduling framework approximates the fitness function of the original problem using three surrogate functions. The first considers only the actual jobs, the second adds scheduled maintenances and the third adds both scheduled maintenances and deterministic breakdowns based on the mean time to failure of machines. For the FSP, a local optimum solution of each surrogate problem is found either through a local search heuristic or a simulated annealing algorithm. For the JSP, given the extremely large search space, a genetic algorithm is used to find local optimal solutions. These solutions are then simulated with random breakdowns and the best among them is compared to the incumbent solution of the original problem. In different variants of the algorithm, it either terminates once the new solution is found to be worse than the incumbent, or non-improving solutions are accepted, yet with a decreasing probability, in a simulated annealing style. The first algorithm of the FSP showed no improvement over the initial solution for the 25-machine, 75-job problem. The second algorithm did not perform well due to premature termination. The third algorithm showed marginal improvement with an average of 1.25% over the initial solution with a much higher average run time. The first algorithm for the JSP showed an average marginal improvement of 5.33% and a quick run time of 10.01 minutes for the 50-job, 15-machine problem. The second algorithm showed good performance with an average improvement of 6.71% in an average time of 5.11 hours. These results show that the proposed framework can generate high-quality schedules while taking scheduled maintenance and random breakdowns into consideration.
Download or read book The Multi product Economic Lot Sizing Problem in Flow Shops the Powers of two Heuristic written by Boctor, Fayez F. (Fayez Fouad) and published by Québec : Faculté des sciences de l'administration de l'Université Laval, Direction de la recherche. This book was released on 1998 with total page 18 pages. Available in PDF, EPUB and Kindle. Book excerpt:
Download or read book A New and Efficient Heuristic to Solve the Multi product Multi stage Lot Sizing and Scheduling Problem in Flow Shops written by Boctor, Fayez F. (Fayez Fouad) and published by Québec : Faculté des sciences de l'administration de l'Université Laval, Direction de la recherche. This book was released on 1998 with total page 17 pages. Available in PDF, EPUB and Kindle. Book excerpt:
Download or read book The G group Heuristic to Solve the Multi product Sequencing Lot Sizing and Scheduling Problem in Flow Shops written by Boctor, Fayez F. (Fayez Fouad) and published by Québec : Faculté des sciences de l'administration de l'Université Laval, Direction de la recherche. This book was released on 1998 with total page 18 pages. Available in PDF, EPUB and Kindle. Book excerpt:
Download or read book Ordonnancement d ateliers sous contraintes de disponibilit des machines written by Riad Aggoune and published by . This book was released on 2002 with total page 130 pages. Available in PDF, EPUB and Kindle. Book excerpt: Nous étudions dans cette thèse des problèmes d'ordonnancement d'ateliers en présence de périodes d'indisponibilité des machines. Nous considérons le contexte d'indisponibilités dues à une activité de maintenance préventive, avec des tâches de maintenance soit fixes, soit flexibles. Les modèles étudiés sont ceux du flow shop et du job shop, avec des nombres quelconques de machines et d'indisponibilités sur chacune d'entre elles. Les opérations à ordonnancer sont strictement non-préemptives. Des algorithmes polynomiaux originaux sont développés pour des problèmes d'ordonnancement à deux travaux et nous nous servons de ces algorithmes généraux. Les méthodes approchées utilisent des méta-heuristiques et les méthodes exactes reposent sur des procédures par séparation et évaluation. Des résultats d'xpériences menées sur des instances générées aléatoirement attestent de l'efficacité des algorithmes proposés.
Download or read book Artificial Evolution written by Lhassane Idoumghar and published by Springer Nature. This book was released on 2020-04-29 with total page 233 pages. Available in PDF, EPUB and Kindle. Book excerpt: This book constitutes the thoroughly refereed post-conference proceedings of the 14th International Conference on Artificial Evolution, EA 2019, held in Mulhouse, France, in October 2019. The 16 revised papers were carefully reviewed and selected from 33 submissions. The papers cover a wide range of topics in the field of artificial evolution, such as evolutionary computation, evolutionary optimization, co-evolution, artificial life, population dynamics, theory, algorithmic and modeling, implementations, application of evolutionary paradigms to the real world (industry, biosciences...), other biologically-inspired paradigms (swarm, artificial ants, artificial immune systems, cultural algorithms...), memetic algorithms, multi-objective optimization, constraint handling, parallel algorithms, dynamic optimization, machine learning and hybridization with other soft computing techniques.
Download or read book Modelling Identification and Control written by International Association of Science and Technology for Development and published by Anaheim, Calif. ; Calgary : Acta Press. This book was released on 1984 with total page 310 pages. Available in PDF, EPUB and Kindle. Book excerpt:
Download or read book Metaheuristics and Nature Inspired Computing written by Bernabé Dorronsoro and published by Springer Nature. This book was released on 2022-02-21 with total page 230 pages. Available in PDF, EPUB and Kindle. Book excerpt: This volume constitutes selected papers presented during the 8th International Conference on Metaheuristics and Nature Inspired Computing, META 2021, held in Marrakech, Morocco, in October 201. Due to the COVID-19 pandemic the conference was partiqally held online. The 16 papers were thoroughly reviewed and selected from the 53 submissions. They are organized in the topical sections on combinatorial optimization; continuous optimization; optimization and machine learning; applications.
Download or read book Applied Computing written by Suresh Manandhar and published by . This book was released on 2014-01-15 with total page 352 pages. Available in PDF, EPUB and Kindle. Book excerpt:
Download or read book Proceedings of the IASTED International Conference written by M. H. Hamza and published by . This book was released on 1996 with total page 424 pages. Available in PDF, EPUB and Kindle. Book excerpt:
Download or read book Computational Intelligence in Software Engineering written by Witold Pedrycz and published by World Scientific. This book was released on 1998 with total page 504 pages. Available in PDF, EPUB and Kindle. Book excerpt: This unique volume is the first publication on software engineering and computational intelligence (CI) viewed as a synergistic interplay of neurocomputing, granular computation (including fuzzy sets and rough sets), and evolutionary methods. It presents a unified view of CI in the context of software engineering. The book addresses a number of crucial issues: what is CI, what role does it play in software development, how are CI elements built into successive phases of the software life cycle, and what is the role played by CI in quantifying fundamental features of software artifacts? With contributions from leading researchers and practitioners, the book provides the reader with a wealth of new concepts and approaches, complete algorithms, in-depth case studies, and thought-provoking exercises. The topics coverage include neurocomputing, granular as well as evolutionary computing, object-oriented analysis and design in software engineering. There is also an extensive bibliography.
