Description
Book SynopsisThis book introduces readers to the many variables and constraints involved in planning and scheduling complex systems, such as airline flights and university courses. Students will become acquainted with the necessity for scheduling activities under conditions of limited resources in industrial and service environments, and become familiar with methods of problem solving.
Written by an expert author with decades of teaching and industry experience, the book provides a comprehensive explanation of the mathematical foundations to solving complex requirements, helping students to understand underlying models, to navigate software applications more easily, and to apply sophisticated solutions to project management. This is emphasized by real-world examples, which follow the components of the manufacturing process from inventory to production to delivery.
Undergraduate and graduate students of industrial engineering, systems engineering, and operations managem
Trade Review
"Most textbooks on operations management focus more on the management of operations and case studies than on the actual specifics of algorithms. These specifics, though, are useful to students who focus more on the details of implementing such systems. An Introduction to the Mathematics of Planning and Scheduling fills this void in the marketplace by providing a detailed and thorough presentation of the mathematical models and algorithms involved in the planning and scheduling process. It is well suited for instruction to students."
Maged M. Dessouky, University of Southern California, Viterbi, USA
"Graduate students of production, scheduling, and planning will thank any instructor who relies on this text. The material is well-organized and appropriate for upper division undergraduates or master’s students. Concepts are presented with examples, and proofs are presented primarily in the form of pseudo code that enables students to implement new tools on their own. Combined with knowledge of data structures, this tool kit is quite powerful. Even students for whom programming is a foreign language will quickly grasp the algorithms presented and understand why and how they work."
Jim Moore, University of Southern California, Viterbi, USA
"This book is an important compilation of a variety of approaches to solving scheduling problems, supporting a variety of applications. It is the answer to the basic question: is complete enumeration the only way to develop an optimal schedule? Overall, I recommend this book to those wanting to frame a mathematical basis for everyday scheduling, sequencing, and inventory management problems."
Mark Werwath, Northwestern University, USA
Table of ContentsList of Figures
Preface
- Introduction
-
- A brief history
-
- Inventory
-
- Production Planning
-
- Manufacturing Requirements Planning
-
- Scheduling Problems
-
- Generation of Schedules
-
- Algorithms for One-Machine Problems
-
- Algorithms for Two-Machine Problems and Extensions to Multiple Machines
-
- Implicit Enumerations
-
- Optimization
-
- Heuristic Approaches
-
- Parallel Machines and Worst Case Bounds
-
- Relaxation of Assumptions
-
- Dynamic and Stochastic problems
Appendix A: Costing of Products and Services
Appendix B: Project Scheduling
Appendix C: Hard Problems and NP-Completeness
Appendix D: Problems
Bibliography
References
Index
