An Introduction to the Mathematics of Planning and Scheduling
Auteur : Bottlik Geza Paul
This 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 management will find this book useful in understanding optimization with respect to planning and scheduling.
List 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
Geza Paul Bottlik is an Associate Professor of Engineering Practice at the University of Southern California, USA.
Date de parution : 02-2017
17.8x25.4 cm
Date de parution : 02-2017
17.8x25.4 cm
Thèmes d’An Introduction to the Mathematics of Planning and... :
Mots-clés :
Optimal Schedule; optimal; Gantt Diagram; schedule; SPT; gantt; Johnson’s Algorithm; chart; Maximum Completion Time; processing; Gantt Chart; times; Scheduling Problems; maximum; Due Date; completion; EOQ; time; M3 M2 M1; diagram; Non-delay Schedules; Precedence Constraints; Permutation Schedule; Ready Times; J1 J2 J3 J4 J5; Dependent Items; ERP; Flow Shop; EDD; Active Schedule; Dynamic Programming; Single Machine Problem; Complete Enumeration; Technological Constraints; Unassigned Jobs