Scheduling
Theory, Algorithms and Systems
Published on 31. January 1995
Book
Hardback
416 pages
978-0-13-706757-2 (ISBN)
Description
Dealing primarily with machine scheduling models, Pinedo's three-part approach covers deterministic models, stochastic models and applications in the real world.* only book available that covers deterministic models, stochastic models and applications together. * divides each chapters exercises into two parts - computational and theoretical - with over 100 of each type total, joined by over 50 worked examples. * text is self-contained, offering appendices on the basics in mathematical programming, dynamic programming and complexity theory. * devotes an entire chapter to practical techniques used by people developing scheduling systems in practice.
More details
Language
English
Place of publication
United States
Publishing group
Pearson Education (US)
Target group
College/higher education
Dimensions
Height: 240 mm
Width: 180 mm
Thickness: 15 mm
Weight
730 gr
ISBN-13
978-0-13-706757-2 (9780137067572)
Copyright in bibliographic data is held by Nielsen Book Services Limited or its licensors: all rights reserved.
Schweitzer Classification
Other editions
New editions
Book
12/2001
2nd Edition
Pearson
€71.79
Article is exhausted; no reprint
Content
1. Introduction I. DETERMINISTIC MODELS 2. Deterministic Models Preliminaries 3. Single Machine Deterministic Models 4. Parallel Machines Deterministic Models 5. Deterministic Flow Shops and Flexible Flow Shops 6. Deterministic Open Shops and Job Shops 7. General Purpose Procedures II. STOCHASTIC MODELS 8. Stochastic Scheduling Preliminaries 9. Single Machine Stochastic Models 10. Parallel Machine Stochastic Models 11. Stochastic Flows Shops, Open Shops and Job Shops III. APPLICATIONS 12. Modeling Scheduling Problems in Practice 13. Design, Development and Implementation of Scheduling Systems 14. Scheduling Systems: Case Studies Appendix A: Mathematical Programming: Formulations and Applications Appendix B: Deterministic and Stochastic Dynamic Programming Appendix C: Complexity Theory Appendix D: Complexity Classification of Scheduling Problems References