Heuristics, metaheuristics and approximate methods in planning and scheduling / edited by Ghaith Rabadi.

"The 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 div...

Full description

Saved in:
Bibliographic Details
Other Authors: Rabadi, Ghaith (Editor)
Format: Ebook
Language:English
Published: Cham. Switzerland : Springer, [2017]
Series:International series in operations research & management science volume 236.
Subjects:
Online Access:Springer eBooks
Description
Summary:"The 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-Ra PS."--Publisher's website.
Physical Description:1 online resource (xii, 264 pages) : illustrations.
Bibliography:Includes bibliographical references.
ISBN:3319260243
9783319260242
3319260227
9783319260228
ISSN:0884-8289 ;
Availability
Requests
Request this item Request this AUT item so you can pick it up when you're at the library.
Interlibrary Loan With Interlibrary Loan you can request the item from another library. It's a free service.