An Introduction to the Mathematics of Planning and Scheduling

Author:

Language: English

214.69 €

In Print (Delivery period: 15 days).

Add to cartAdd to cart
An Introduction to the Mathematics of Planning and Scheduling
Publication date:
· 17.8x25.4 cm · Hardback

73.59 €

In Print (Delivery period: 14 days).

Add to cartAdd to cart
An Introduction to the Mathematics of Planning and Scheduling
Publication date:
· 17.8x25.4 cm · Paperback

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

  1. Introduction
  2. A brief history
    1. Inventory
      1. Production Planning
        1. Manufacturing Requirements Planning
          1. Scheduling Problems
            1. Generation of Schedules
              1. Algorithms for One-Machine Problems
                1. Algorithms for Two-Machine Problems and Extensions to Multiple Machines
                  1. Implicit Enumerations
                    1. Optimization
                      1. Heuristic Approaches
                        1. Parallel Machines and Worst Case Bounds
                        2. Relaxation of Assumptions
                          1. 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.