Geza Paul Bottlik

An Introduction to the Mathematics of Planning and Scheduling (eBook, PDF)

• Format: PDF

Produktbeschreibung

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.

---

Dieser Download kann aus rechtlichen Gründen nur mit Rechnungsadresse in A, B, BG, CY, CZ, D, DK, EW, E, FIN, F, GR, HR, H, IRL, I, LT, L, LR, M, NL, PL, P, R, S, SLO, SK ausgeliefert werden.

Produktdetails

• Verlag: Taylor & Francis eBooks
• Seitenzahl: 226
• Erscheinungstermin: 16. März 2017
• Englisch
• ISBN-13: 9781482259254
• Artikelnr.: 47995468

Autorenporträt

Geza Paul Bottlik is an Associate Professor of Engineering Practice at the University of Southern California, USA.

Inhaltsangabe

List of Figures
Preface
1. Introduction
2. A brief history
3. Inventory
4. Production Planning
5. Manufacturing Requirements Planning
6. Scheduling Problems
7. Generation of Schedules
8. Algorithms for One-Machine Problems
9. Algorithms for Two-Machine Problems and Extensions to Multiple Machines
10. Implicit Enumerations
11. Optimization
12. Heuristic Approaches
13. Parallel Machines and Worst Case Bounds
14. Relaxation of Assumptions
15. 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