Del 16 i serien Nonconvex Optimization and Its Applications

Network Scheduling Techniques for Construction Project Management

Inbunden, Engelska, 1996

AvM. Hajdu

2 139 kr

Beställningsvara. Skickas inom 10-15 vardagar. Fri frakt för medlemmar vid köp för minst 249 kr.

Finns i fler format (1)

Häftad

2 079 kr

Skickas inom 10-15 vardagar

A synthesis of the state-of-the-art in project management concepts and techniques, placing 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.

Produktinformation

Utgivningsdatum1996-12-31
Mått156 x 234 x 24 mm
Vikt699 g
FormatInbunden
SpråkEngelska
SerieNonconvex Optimization and Its Applications
Antal sidor335
Upplaga1997
FörlagKluwer Academic Publishers
ISBN9780792343097

Tillhör följande kategorier

Projektledning inom Ekonomi och Ledarskap

1 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.