Atnaujinkite slapukų nuostatas

El. knyga: Network Scheduling Techniques for Construction Project Management

DRM apribojimai

  • Kopijuoti:

    neleidžiama

  • Spausdinti:

    neleidžiama

  • El. knygos naudojimas:

    Skaitmeninių teisių valdymas (DRM)
    Leidykla pateikė šią knygą šifruota forma, o tai reiškia, kad norint ją atrakinti ir perskaityti reikia įdiegti nemokamą programinę įrangą. Norint skaityti šią el. knygą, turite susikurti Adobe ID . Daugiau informacijos  čia. El. knygą galima atsisiųsti į 6 įrenginius (vienas vartotojas su tuo pačiu Adobe ID).

    Reikalinga programinė įranga
    Norint skaityti šią el. knygą mobiliajame įrenginyje (telefone ar planšetiniame kompiuteryje), turite įdiegti šią nemokamą programėlę: PocketBook Reader (iOS / Android)

    Norint skaityti šią el. knygą asmeniniame arba „Mac“ kompiuteryje, Jums reikalinga  Adobe Digital Editions “ (tai nemokama programa, specialiai sukurta el. knygoms. Tai nėra tas pats, kas „Adobe Reader“, kurią tikriausiai jau turite savo kompiuteryje.)

    Negalite skaityti šios el. knygos naudodami „Amazon Kindle“.

Presents a synthesis of the state of the art in project management concepts and techniques, with emphasis on the precedence diagramming method (PDM), a widely used scheduling method. Describes new theoretical improvements of PDM, such as maximal type of precedence relationships and calculating the minimal and maximal project durations, and discusses computer implementation. A PC-based software package is available. For undergraduate and graduate students in civil and industrial engineering and operations research, as well as researchers, practitioners, managers, and contractors. Annotation c. by Book News, Inc., Portland, Or.

Industrial, financial, commercial or any kinds of project have at least one common feature: the better organized they are, the higher the profit or the lower the cost. Project management is the principle of planning different projects and keeping them on track within time, cost and resource constraints. The need for effective project management is ever-increasing. The complexity of the environment we live in requires more sophisticated methods than it did just a couple of decades ago. Project managers might face insurmountable obstacles in their work if they do not adapt themselves to the changing circumstances. On the other hand, better knowledge of project management can result in better plans, schedules and, last but not least, more contracts and more profit. This knowledge can help individuals and firms to stay alive in this competitive market and, in the global sense, utilize the finite resources of our planet in a more efficient way.

Recenzijos

`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)

PREFACE xi(2)
ACKNOWLEDGEMENTS xiii
CHAPTER 1 Introduction
1(16)
1.1 What Is a Schedule? What Is It Good For?
1(1)
1.2 Traditional Scheduling Techniques
2(3)
1.3 Network-Based Scheduling Techniques
5(2)
1.4 Network-Based Project Management: Basic Steps
7(6)
Step
1. Defining Activities
7(1)
Step
2. Defining Activity Interdependencies
8(1)
Step
3. Drawing the Network
8(1)
Step
4. Time and Resource Estimation
9(2)
Step
5. Basic Calculations
11(1)
Step
6. Advanced Calculations
11(1)
Step
7. Project Control
12(1)
Step
8. Project Review
12(1)
1.5 Historical Review
13(4)
CHAPTER 2 CPM Scheduling
17(62)
2.1 Introducing a Sample Project
18(7)
2.2 Basic Definitions. Drawing Rules
25(4)
2.3 Preceding (Succeeding) Activity Lists
29(4)
2.4 Drawing of an Arrow Diagram
33(13)
Method 1
34(6)
Method 2
40(6)
2.5 Levels of Network
46(1)
2.6 CPM Calculations
47(11)
Usual Procedure
49(4)
Primal-Dual Procedure
53(5)
2.7 Information Obtained From Calculations
58(6)
2.8 Pros and Cons of the CPM Technique
64(7)
2.9 Practical Problems and Solutions
71(7)
Problems
71(3)
Solutions
74(4)
2.10 Historical Review
78(1)
CHAPTER 3 CPM Least Cost Scheduling
79(54)
3.1 Introducing a Sample Project
80(4)
3.2 Heuristic Solutions
84(16)
Fondahl's Method
85(9)
Siemens' Method
94(6)
3.3 Exact Solution
100(16)
3.4 Maximal Cost Solution
116(6)
3.5 Which Is Better?
122(2)
3.6 Special Cases
124(2)
3.7 Practical Problems and Solutions
126(5)
Problems
126(1)
Solutions
127(4)
3.8 Historical Review
131(2)
CHAPTER 4 Precedence Diagramming
133(40)
4.1 Introducing the Sample Project
134(3)
4.2 Definitions. Precedence Relationships.
137(4)
4.3 Preceding Activity List
141(2)
4.4 Drawing of a Network
143(1)
4.5 PDM Calculation
144(4)
4.6 Notes on Calculation Rules.
148(4)
4.7 PDM Calculation: Splitting Allowed
152(3)
4.8 Loops in PDM Network
155(1)
4.9 Notes on Negative Lag and Dangling Activities
156(1)
4.10 The Paradox Behavior of PDM
157(1)
4.11 Information Obtained from Calculations
158(6)
Critical Activities: No Splitting Allowed
158(1)
Activity Floats: No-Splitting Allowed
159(1)
Floats: Precedence Relationships
160(2)
Critical Activities: Splitting Allowed
162(1)
Activity Floats: Splitting Allowed
163(1)
4.12 Conclusions
164(2)
4.13 Practical Problems and Solutions
166(4)
Problems
166(1)
Solutions
167(3)
4.14 Historical Review
170(3)
CHAPTER 5 Advanced Precedence Diagramming
173(30)
5.1 Introducing the Sample Project
174(1)
5.2 Maximal Type of Relationships
175(8)
5.3 Calculations with Maximal Relationships
183(6)
5.4 Information Obtained from Calculations
189(1)
5.5 Constraints in PDM
190(4)
Minimal Type Of Constraints
190(1)
Maximal Type Of Constraints
191(1)
Mixed Type Of Constraints
191(3)
5.6 PDM Versus CPM
194(2)
5.7 Practical Problems and Solutions
196(4)
Problems
196(1)
Solutions
197(3)
5.8 Historical Review
200(3)
CHAPTER 6 Precedence Diagramming With Bounded Activity Duration
203(16)
6.1 Introducing the Sample Project
204(2)
6.2 Calculations With Minimal Relationships
206(5)
Determining the Minimal Project Duration
207(2)
Determining the Maximal Project Duration
209(2)
6.3 Calculations With Maximal Relationships
211(2)
Determining the Minimal Project Duration
211(1)
Determining the Maximal Project Duration
212(1)
6.4 Practical Problems and Solutions
213(5)
Problems
213(2)
Solutions
215(3)
6.5 Historical Review
218(1)
CHAPTER 7 PDM Least Cost Scheduling
219(24)
7.1 Introducing The Sample Project
220(3)
7.2 Differences Between CPM and PDM Cost Curves
223(1)
7.3 Exact Solution
224(14)
7.4 Special Cases
238(1)
7.5 Practical Problems and Solutions
239(2)
Problems
239(1)
Solutions
240(1)
7.6 Historical Review
241(2)
CHAPTER 8 Resources In Scheduling
243(16)
8.1 Using Optimal Procedures
244(1)
8.2 Resource Leveling (Fixed Project Duration)
245(7)
8.3 Resource Allocation (Limited Resources)
252(4)
8.4 Maximal Precedence Relationships in Leveling
256(1)
8.5 Maximal Precedence Relationships in Allocation
257(2)
CHAPTER 9 Art of Scheduling
259(26)
9.1 Work Breakdown Structure
260(5)
9.2 Special Activity Types
265(3)
9.3 Cash Flow Forecasting, Monitoring And Control
268(3)
Cash Flow
269(1)
Progress Curves
269(2)
9.4 Loops In Networks
271(7)
9.5 Multiproject Scheduling
278(3)
9.6 Calendar Versus Workday Schedule
281(4)
APPENDIX A Mathematical Basis
285(32)
1. Digraph
285(2)
2. Duality Theorem of Path and Cut
287(4)
3. Minimal Path-Maximal Potential Problem
291(5)
4. Maximal Flow Minimal Cut
296(8)
5. The First "K" Longest Path
304(5)
6. Linear Programming and Duality
309(3)
7. Practical Problems and Solutions
312(3)
Problems
312(2)
Solutions
314(1)
8. Historical Review
315(2)
APPENDIX B Computer Applications
317(6)
1. Choosing Among Available Applications
317(4)
2. ProjectDirector
321(2)
BIBLIOGRAPHY 323(6)
INDEX 329