Download or read book Designing and Implementing a Heuristic for Solving Instances of an Open Shop Scheduling Problem Including Sequence dependent Setup Times and Transportation Delays written by and published by . This book was released on 2021 with total page 0 pages. Available in PDF, EPUB and Kindle. Book excerpt:

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-12 with total page 381 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 The Two machine Open Shop Problem with Time Delays written by Li Chuan Zhang and published by . This book was released on 2012 with total page 196 pages. Available in PDF, EPUB and Kindle. Book excerpt:

Download or read book Worst case Analysis of Heuristic Algorithms for Two machine Open Shop Scheduling Problem with Route dependent Processing Times written by Vitalij A. Strusevič and published by . This book was released on 1993 with total page 26 pages. Available in PDF, EPUB and Kindle. Book excerpt:

Download or read book Worst case Performance of Scheduling Heuristics written by Bo Chen and published by I.B.D. Limited. This book was released on 1994 with total page 156 pages. Available in PDF, EPUB and Kindle. Book excerpt: "Attempts to cope with the challenge of optimal utilization of limited resources in accomplishing variegated tasks have resulted in an exciting field known as scheduling theory. The resources and tasks are commonly referred to as machines and jobs, respectively. In this thesis efficient heuristic algorithms are developed, which quickly provide near optimal solutions for various problems in scheduling theory that are practically intractable to solve to optimality. The worst-case performance of the heuristic algorithms is thoroughly analyzed. With respect to machine environments, the scheduling problems considered range from parallel machine shops, through open and flow shops, to common generalizations of the classical shop models. With respect to the job characteristics, these problems may involve preemptive or non-preemptive scheduling, with setup times included in or separated from processing times. With respect to the ways jobs are released and scheduled, both off-line and on-line problems are investigated."--BOOK JACKET.Title Summary field provided by Blackwell North America, Inc. All Rights Reserved

Download or read book A Tabu Search Algorithm for the Open Shop Scheduling Problem with Sequence Dependent Setup Times written by Jesus Jose Aguirre-Solis and published by . This book was released on 2003 with total page pages. Available in PDF, EPUB and Kindle. Book excerpt:

Download or read book Worst case Analysis of Heuristic Algorithms for Two machine Open Shop Scheduling Problem with Route dependent Processing Times written by Vitalij Aleksandrovič Strusevič and published by . This book was released on 1993 with total page 26 pages. Available in PDF, EPUB and Kindle. Book excerpt:

Download or read book An Efficient Relax and Solve Heuristic for Open Shop Scheduling Problem to Minimize Total Weighted Earliness Tardiness written by Mohammad Mahdi Ahmadian and published by . This book was released on 2020 with total page 0 pages. Available in PDF, EPUB and Kindle. Book excerpt: An open-shop scheduling problem to minimize the total weighted earliness-tardiness of job-on-machine operations is studied. Each operation has its own due date, earliness weight and tardiness weight. An efficient relax-and-solve heuristic is developed. A feature that makes the proposed heuristic distinctive from the existing heuristics of this kind is that it operates by iterative relaxation and optimization of a series of sub-problems. Performance of the proposed heuristic is verified on a set of 72 benchmark instances with up to 200 operations, adapted from the literature on a similar job-shop scheduling problem. The heuristic delivers best solutions for nearly 71 % of the instances (i.e., 51 out of 72 instances), including the best solution for all instances with 150 and 200 operations. Its running time is around three minutes, while CLPEX was run for 30 minutes.

Download or read book Scheduling Theory Single Stage Systems written by V. Tanaev and published by Springer Science & Business Media. This book was released on 2012-12-06 with total page 382 pages. Available in PDF, EPUB and Kindle. Book excerpt: Scheduling theory is an important branch of operations research. Problems studied within the framework of that theory have numerous applications in various fields of human activity. As an independent discipline scheduling theory appeared in the middle of the fifties, and has attracted the attention of researchers in many countries. In the Soviet Union, research in this direction has been mainly related to production scheduling, especially to the development of automated systems for production control. In 1975 Nauka ("Science") Publishers, Moscow, issued two books providing systematic descriptions of scheduling theory. The first one was the Russian translation of the classical book Theory of Scheduling by American mathematicians R. W. Conway, W. L. Maxwell and L. W. Miller. The other one was the book Introduction to Scheduling Theory by Soviet mathematicians V. S. Tanaev and V. V. Shkurba. These books well complement each other. Both. books well represent major results known by that time, contain an exhaustive bibliography on the subject. Thus, the books, as well as the Russian translation of Computer and Job-Shop Scheduling Theory edited by E. G. Coffman, Jr., (Nauka, 1984) have contributed to the development of scheduling theory in the Soviet Union. Many different models, the large number of new results make it difficult for the researchers who work in related fields to follow the fast development of scheduling theory and to master new methods and approaches quickly.

Download or read book Principles of Sequencing and Scheduling written by Kenneth R. Baker and published by John Wiley & Sons. This book was released on 2013-06-05 with total page 407 pages. Available in PDF, EPUB and Kindle. Book excerpt: An up-to-date and comprehensive treatment of the fundamentals of scheduling theory, including recent advances and state-of-the-art topics Principles of Sequencing and Scheduling strikes a unique balance between theory and practice, providing an accessible introduction to the concepts, methods, and results of scheduling theory and its core topics. With real-world examples and up-to-date modeling techniques, the book equips readers with the basic knowledge needed for understanding scheduling theory and delving into its applications. The authors begin with an introduction and overview of sequencing and scheduling, including single-machine sequencing, optimization and heuristic solution methods, and models with earliness and tardiness penalties. The most current material on stochastic scheduling, including correct scheduling of safety time and the use of simulation for optimization, is then presented and integrated with deterministic models. Additional topical coverage includes: Extensions of the basic model Parallel-machine models Flow shop scheduling Scheduling groups of jobs The job shop problem Simulation models for the dynamic job shop Network methods for project scheduling Resource-constrained project scheduling Stochastic and safe scheduling Extensive end-of-chapter exercises are provided, some of which are spreadsheet-oriented, and link scheduling theory to the most popular analytic platform among today's students and practitioners—the Microsoft Office Excel® spreadsheet. Extensive references direct readers to additional literature, and the book's related Web site houses material that reinforces the book's concepts, including research notes, data sets, and examples from the text. Principles of Sequencing and Scheduling is an excellent book for courses on sequencing and scheduling at the upper-undergraduate and graduate levels. It is also a valuable reference for researchers and practitioners in the fields of statistics, computer science, operations research, and engineering.

Download or read book A Heuristic for Machine Setup Problems with Total sequence Dependent Setup Times written by Chun-Ming Ko and published by . This book was released on 1989 with total page 94 pages. Available in PDF, EPUB and Kindle. Book excerpt:

Download or read book Heuristic Scheduling Systems written by Thomas E. Morton and published by John Wiley & Sons. This book was released on 1993-09-10 with total page 718 pages. Available in PDF, EPUB and Kindle. Book excerpt: Reflects exact and heuristic methods of scheduling techniques suitable for creating customized sequencing and scheduling systems for flexible manufacturing, project management, group and cellular manufacturing operations. Summarizes complex computational studies demonstrating how they work in practice. Contains new theories and techniques developed by the author. Includes a software disk to reinforce and practice the methods described.

Download or read book A Tabu Search Heuristic for the Multiprocessor Scheduling Problem with Sequence Dependent Setup Times written by Paulo M. Franc̜a and published by Montréal : Centre for Research on Transportation = Centre de recherche sur les transports. This book was released on 1995 with total page 32 pages. Available in PDF, EPUB and Kindle. Book excerpt:

Download or read book A Particle Swarm Approach for Scheduling a Fixed Product Flexible Open Shop With Transportation Considerations written by Carlos Parra Forero and published by . This book was released on 2014 with total page pages. Available in PDF, EPUB and Kindle. Book excerpt: In the scheduling literature a lot of attention has been given to flow-shops and job-shops, since these problems usually have more constraints than open-shops. However, not only is the open-shop scheduling problem an NP-Complete problem for more than two machines, but is often encountered in several industrial applications. Additionally, due to the lack of constraints in open-shops, these problems have a much larger solution space. In this work, a Particle Swarm Optimization (PSO) heuristic is developed and implemented in order to solve a fixed product flexible open-shop with transportation considerations. That is, given a set of heterogeneous workers, a set of locations, and a set of tasks at each location, the methodology assigns the workers to the different tasks, and routes them through the different locations. All the workers begin and end their route at a depot or home location. This assignment and routing of the workers is done in such a way that a given performance measure is optimized; in this case, the goal is to minimize the makespan. The makespan is defined as the time period from the moment the first worker leaves, and the moment when the last worker returns. The travel times between locations are assumed to be non-trivial, and equal across workers. The proposed PSO approach was implemented on 10 sample problems and the results were compared to those obtained via a Mixed Integer Linear Program (MILP). The problems range from three to 10 workers, from two to five tasks per location and from four to 14 locations.The results show that the PSO could be potentially implemented to solve these types of problems. PSO was able to find a solution to the sample problems in a shorter time, than that required for the MILP to find the optimal. On average, the computational time was reduced by 60% when utilizing PSO; however, the quality of the solution can be further improved. The PSO heuristic achieved optimal results for five of the 10 problems, while the solution obtained for the remaining five problems was sub-optimal. It is clear that the problem size plays an important role on the behavior of PSO. For larger problems, the algorithm seems to be suffering from stagnation (early convergence). In the future, the performance of the algorithm can be improved by incorporating local search heuristics, as well as a better quality initial swarm. Additionally, some random movement of particles to prevent stagnation could be explored.

Download or read book A Branch and Bound Heuristic to Solve the Sequence Dependent Setup Time Flowshop Problem written by Bellur N. Srikar and published by . This book was released on 1984 with total page 9 pages. Available in PDF, EPUB and Kindle. Book excerpt:

Download or read book Planning and Scheduling Optimization written by Farouk Yalaoui and published by Mdpi AG. This book was released on 2021-11-05 with total page 344 pages. Available in PDF, EPUB and Kindle. Book excerpt: Although planning and scheduling optimization have been explored in the literature for many years now, it still remains a hot topic in the current scientific research. The changing market trends, globalization, technical and technological progress, and sustainability considerations make it necessary to deal with new optimization challenges in modern manufacturing, engineering, and healthcare systems. This book provides an overview of the recent advances in different areas connected with operations research models and other applications of intelligent computing techniques used for planning and scheduling optimization. The wide range of theoretical and practical research findings reported in this book confirms that the planning and scheduling problem is a complex issue that is present in different industrial sectors and organizations and opens promising and dynamic perspectives of research and development.

Download or read book A Book of Open Shop Scheduling written by Wieslaw Kubiak and published by Springer Nature. This book was released on 2022-01-03 with total page 290 pages. Available in PDF, EPUB and Kindle. Book excerpt: This book provides an in-depth presentation of algorithms for and complexity of open shop scheduling. Open shops allow operations of a job to be executed in any order, contrary to flow and job shops where the order is pre-specified. The author brings the field up to date with more emphasis on new and recent results, and connections with graph edge coloring and mathematical programming. The book explores applications to production and operations management, wireless network scheduling, and timetabling. The book is addressed to researchers, graduate students, and practitioners in Operations Research, Operations Management, computer science and mathematics, who are developing and using mathematical approaches to applications in manufacturing, services and distributed wireless network scheduling.