|
![]() |
|||
|
||||
OverviewThe book is a synthesis of the state-of-the-art in project management concepts and techniques. The author places particular emphasis on precedence diagramming (PDM), at present the most widely used scheduling method. New theoretical improvements of PDM are presented, several for the first time in a book, such as: maximal type of precedence relationships, calculating the minimal and maximal available project durations, leveling resources when maximal relationships are used, and precedence diagramming time-cost trade-off. Discussions of computer implementation are included throughout the book. A PC-based software package called 'ProjectDirector', containing the theoretical improvements described in the book, is available from the author. Audience: Researchers, and undergraduate and graduate students in civil engineering, industrial engineering and operations research, as well as practitioners, managers, and contractors interested in project management. Full Product DetailsAuthor: M. HajduPublisher: Springer-Verlag New York Inc. Imprint: Springer-Verlag New York Inc. Edition: Softcover reprint of hardcover 1st ed. 1997 Volume: 16 Dimensions: Width: 15.50cm , Height: 1.80cm , Length: 23.50cm Weight: 0.539kg ISBN: 9781441947659ISBN 10: 1441947655 Pages: 335 Publication Date: 07 December 2010 Audience: Professional and scholarly , Professional & Vocational Format: Paperback Publisher's Status: Active Availability: Out of stock ![]() The supplier is temporarily out of stock of this item. It will be ordered for you on backorder and shipped when it becomes available. Table of Contents1 Introduction.- 2 CPM Scheduling.- 3 CPM Least Cost Scheduling.- 4 Precedence Diagramming.- 5 Advanced Precedence Diagramming.- 6 Precedence Diagramming With Bounded Activity Duration.- 7 PDM Least Cost Scheduling.- 8 Resources In Scheduling.- 9 Art of Scheduling.- Appendix A Mathematical Basis.- 1. Digraph.- 2. Duality Theorem of Path and Cut.- 3. Minimal Path — Maximal Potential Problem.- 4. Maximal Flow Minimal Cut.- 5. The First “K” Longest Path.- 6. Linear Programming and Duality.- 7. Practical Problems and Solutions.- Problems.- Solutions.- 8. Historical Review.- Appendix B Computer Applications.- 1. Choosing Among Available Applications.- 2. ProjectDirector.Reviews'This is a rare book. ... I would recommend the book to anybody who wants to understand the mathematical theory behind networks ...' Journal of the Operational Research Society, 50:5 (1999) `This is a rare book. ... I would recommend the book to anybody who wants to understand the mathematical theory behind networks ...' Journal of the Operational Research Society, 50:5 (1999) Author InformationTab Content 6Author Website:Countries AvailableAll regions |