Springer, 2016. — 271 p. — (International Series in Operations Research & Management Science). — ISBN: 9783319260228, 9783319260242The scope of this book is limited to heuristics, metaheuristics, and approximate methods and algorithms as applied to planning and scheduling problems. While it is not possible to give a comprehensive treatment of this topic in one book, the aim of this work is to provide the reader with a diverse set of planning and scheduling problems and different heuristic approaches to solve them. The problems range from traditional single stage and parallel machine problems to more modern settings such as robotic cells and flexible job shop networks. Furthermore, some chapters deal with deterministic problems while some others treat stochastic versions of the problems. Unlike most of the literature that deals with planning and scheduling problems in the manufacturing and production environments, in this book the environments were extended to nontraditional applications such as spatial scheduling (optimizing space over time), runway scheduling, and surgical scheduling. The solution methods used in the different chapters of the book also spread from well-established heuristics and metaheuristics such as Genetic Algorithms and Ant Colony Optimization to more recent ones such as Meta-RaPS.Contents: Approximation Algorithms for Spatial Scheduling Estimating the Costs of Planned Changes Implied by Freezing Production Plans Stochastic Scheduling for a Network of Flexible Job Shops A Free-Slack-Based Genetic Algorithm for the Robotic Cell Problem with Controllable Processing Times Metaheuristic for Randomized Priority Search (Meta-RaPS): A Tutorial Performance of an Intensification Strategy Based on Learning in a Metaheuristic: Meta-RaPS with Path Relinking Meta-RaPS for a Bi-objective Unrelated Parallel Machine Scheduling Problem Heuristics and Meta-heuristics for Runway Scheduling Problems A Tabu Search Algorithm for the Multiple Runway Aircraft Scheduling Problem Metaheuristic Approaches for Scheduling Jobs on Parallel Batch Processing Machines Worm Optimization for the Traveling Salesman Problem Heuristics and Simulated Annealing Algorithm for the Surgical Scheduling Problem Product Wheels in Manufacturing Operations Planning
Чтобы скачать этот файл зарегистрируйтесь и/или войдите на сайт используя форму сверху.