Heuristics, Metaheuristics and Approximate Methods in Planning and Scheduling
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 w
- PDF / 4,602,381 Bytes
- 271 Pages / 439.43 x 683.15 pts Page_size
- 53 Downloads / 255 Views
Ghaith Rabadi Editor
Heuristics, Metaheuristics and Approximate Methods in Planning and Scheduling
International Series in Operations Research & Management Science Volume 236
Series Editor Camille C. Price Stephen F. Austin State University, TX, USA Associate Series Editor Joe Zhu Worcester Polytechnic Institute, MA, USA Founding Series Editor Frederick S. Hillier Stanford University, CA, USA
More information about this series at http://www.springer.com/series/6161
Ghaith Rabadi Editor
Heuristics, Metaheuristics and Approximate Methods in Planning and Scheduling
123
Editor Ghaith Rabadi Engineering Management and Systems Engineering Old Dominion University Norfolk, VA, USA
ISSN 0884-8289 ISSN 2214-7934 (electronic) International Series in Operations Research & Management Science ISBN 978-3-319-26022-8 ISBN 978-3-319-26024-2 (eBook) DOI 10.1007/978-3-319-26024-2 Library of Congress Control Number: 2015954630 Springer Cham Heidelberg New York Dordrecht London © Springer International Publishing Switzerland 2016 This work is subject to copyright. All rights are reserved by the Publisher, whether the whole or part of the material is concerned, specifically the rights of translation, reprinting, reuse of illustrations, recitation, broadcasting, reproduction on microfilms or in any other physical way, and transmission or information storage and retrieval, electronic adaptation, computer software, or by similar or dissimilar methodology now known or hereafter developed. The use of general descriptive names, registered names, trademarks, service marks, etc. in this publication does not imply, even in the absence of a specific statement, that such names are exempt from the relevant protective laws and regulations and therefore free for general use. The publisher, the authors and the editors are safe to assume that the advice and information in this book are believed to be true and accurate at the date of publication. Neither the publisher nor the authors or the editors give a warranty, express or implied, with respect to the material contained herein or for any errors or omissions that may have been made. Printed on acid-free paper Springer International Publishing AG Switzerland is part of Springer Science+Business Media (www. springer.com)
To the most important women in my life: Shereen, Celine, Renee, Karoline, and Lana.
Introduction
Planning and scheduling research has started at the early years of Operation Research (OR) more than 50 years ago. Since then, people have been motivated and challenged by the complexity of planning and scheduling problems. Most of the research in this field is commonly published in various theoretical and applied OR journals, which are also home to many other OR topics. Traditionally, planning and scheduling problems are a class of discrete optimization problems, which have mostly been addressed by linear and nonlinear mathematical programming models. Despite all the progress achieved in mathematical programming methods and the advancement in the computer technology, the va
Data Loading...
