Network scheduling techniques for construction project management:
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
Dordrecht [u.a.]
Kluwer
1997
|
| Schriftenreihe: | Nonconvex optimization and its applications
16 |
| Schlagworte: | |
| Online-Zugang: | Inhaltsverzeichnis |
| Beschreibung: | XII,333 |
| ISBN: | 0792343093 |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV011636223 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | t | ||
| 008 | 971119s1997 |||| 00||| eng d | ||
| 020 | |a 0792343093 |9 0-7923-4309-3 | ||
| 035 | |a (OCoLC)35865384 | ||
| 035 | |a (DE-599)BVBBV011636223 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-739 | ||
| 050 | 0 | |a T56.8 | |
| 082 | 0 | |a 658.4/04 |2 21 | |
| 084 | |a QH 465 |0 (DE-625)141600: |2 rvk | ||
| 100 | 1 | |a Hajdu, Miklós |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Network scheduling techniques for construction project management |c by Miklós Hajdu |
| 264 | 1 | |a Dordrecht [u.a.] |b Kluwer |c 1997 | |
| 300 | |a XII,333 | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 1 | |a Nonconvex optimization and its applications |v 16 | |
| 650 | 4 | |a Analyse de réseau (Planification) | |
| 650 | 4 | |a Emploi du temps | |
| 650 | 4 | |a Gestion de projets | |
| 650 | 7 | |a Netwerkanalyse |2 gtt | |
| 650 | 7 | |a Projectmanagement |2 gtt | |
| 650 | 7 | |a Wachttijdproblemen |2 gtt | |
| 650 | 4 | |a Network analysis (Planning) | |
| 650 | 4 | |a Project management | |
| 650 | 4 | |a Scheduling | |
| 650 | 0 | 7 | |a Projektplanung |0 (DE-588)4115649-3 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Netzplantechnik |0 (DE-588)4075297-5 |2 gnd |9 rswk-swf |
| 689 | 0 | 0 | |a Projektplanung |0 (DE-588)4115649-3 |D s |
| 689 | 0 | 1 | |a Netzplantechnik |0 (DE-588)4075297-5 |D s |
| 689 | 0 | |5 DE-604 | |
| 830 | 0 | |a Nonconvex optimization and its applications |v 16 |w (DE-604)BV010085908 |9 16 | |
| 856 | 4 | 2 | |m HBZ Datenaustausch |q application/pdf |u http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=007841858&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |3 Inhaltsverzeichnis |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-007841858 | ||
Datensatz im Suchindex
| _version_ | 1804126168551522304 |
|---|---|
| adam_text | CONTENTS
PREFACE xi
ACKNOWLEDGEMENTS xiii
CHAPTER 1
Introduction 1
1.1 What Is a Schedule? What Is It Good For? 1
1.2 Traditional Scheduling Techniques 2
1.3 Network Based Scheduling Techniques 5
1.4 Network Based Project Management: Basic Steps 7
Step 1. Defining Activities 7
Step 2. Defining Activity Interdependencies 8
Step 3. Drawing the Network 8
Step 4. Time and Resource Estimation 9
Step 5. Basic Calculations 11
Step 6. Advanced Calculations 11
Step 7. Project Control 12
Step 8. Project Review 12
1.5 Historical Review 13
vi
CHAPTER 2
CPM Scheduling 17
2.1 Introducing a Sample Project 18
2.2 Basic Definitions. Drawing Rules 25
2.3 Preceding (Succeeding) Activity Lists 29
2.4 Drawing of an Arrow Diagram 33
Method 1 34
Method 2 40
2.5 Levels of Network 46
2.6 CPM Calculations 47
Usual Procedure 49
Primal Dual Procedure 53
2.7 Information Obtained From Calculations 58
2.8 Pros and Cons of the CPM Technique 64
2.9 Practical Problems and Solutions 71
Problems 71
Solutions 74
2.10 Historical Review 78
CHAPTER 3
CPM Least Cost Scheduling 79
3.1 Introducing a Sample Project 80
3.2 Heuristic Solutions 84
Fondahl s Method 85
Siemens Method 94
3.3 Exact Solution 100
3.4 Maximal Cost Solution 116
3.5 Which Is Better? 122
3.6 Special Cases 124
3.7 Practical Problems and Solutions 126
Problems 126
Solutions 127
3.8 Historical Review 131
CHAPTER 6
Precedence Diagramming With Bounded Activity Duration 203
6.1 Introducing the Sample Project 204
6.2 Calculations With Minimal Relationships 206
Determining the Minimal Project Duration 207
Determining the Maximal Project Duration 209
6.3 Calculations With Maximal Relationships 211
Determining the Minimal Project Duration 211
Determining the Maximal Project Duration 212
6.4 Practical Problems and Solutions 213
Problems 213
Solutions 215
6.5 Historical Review 218
CHAPTER 7
PDM Least Cost Scheduling 219
7.1 Introducing The Sample Project 220
7.2 Differences Between CPM and PDM Cost Curves 223
7.3 Exact Solution 224
7.4 Special Cases 238
7.5 Practical Problems and Solutions 239
Problems 239
Solutions 240
7.6 Historical Review 241
CHAPTER 8
Resources In Scheduling 243
8.1 Using Optimal Procedures 244
8.2 Resource Leveling (Fixed Project Duration) 245
8.3 Resource Allocation (Limited Resources) 252
8.4 Maximal Precedence Relationships in Leveling 256
8.5 Maximal Precedence Relationships in Allocation 257
CHAPTER 9
Art of Scheduling 259
9.1 Work Breakdown Structure 260
9.2 Special Activity Types 265
9.3 Cash Flow Forecasting, Monitoring And Control 268
Cash Flow 269
Progress Curves 269
9.4 Loops In Networks 271
9.5 Multiproject Scheduling 278
9.6 Calendar Versus Workday Schedule 281
APPENDIX A
Mathematical Basis 285
1. Digraph 285
2. Duality Theorem of Path and Cut 287
3. Minimal Path Maximal Potential Problem 291
4. Maximal Flow Minimal Cut 296
5. The First K Longest Path 304
6. Linear Programming and Duality 309
7. Practical Problems and Solutions 312
Problems 312
Solutions 314
8. Historical Review 315
APPENDIX B
Computer Applications 317
1. Choosing Among Available Applications 317
2. ProjectDirector 321
BIBLIOGRAPHY 323
INDEX 329
CHAPTER 4
Precedence Diagramming 133
4.1 Introducing the Sample Project 134
4.2 Definitions. Precedence Relationships. 137
4.3 Preceding Activity List 141
4.4 Drawing of a Network 143
4.5 PDM Calculation 144
4.6 Notes on Calculation Rules. 148
4.7 PDM Calculation: Splitting Allowed 152
4.8 Loops in PDM Network 155
4.9 Notes on Negative Lag and Dangling Activities 156
4.10 The Paradox Behavior of PDM 157
4.11 Information Obtained from Calculations 158
Critical Activities: No Splitting Allowed 158
Activity Floats: No Splitting Allowed 159
Floats: Precedence Relationships 160
Critical Activities: Splitting Allowed 162
Activity Floats: Splitting Allowed 163
4.12 Conclusions 164
4.13 Practical Problems and Solutions 166
Problems 166
Solutions 167
4.14 Historical Review 170
CHAPTER 5
Advanced Precedence Diagramming 173
5.1 Introducing the Sample Project 174
5.2 Maximal Type of Relationships 175
5.3 Calculations with Maximal Relationships 183
5.4 Information Obtained from Calculations 189
5.5 Constraints in PDM 190
Minimal Type Of Constraints 190
Maximal Type Of Constraints 191
Mixed Type Of Constraints 191
5.6 PDM Versus CPM 194
5.7 Practical Problems and Solutions 196
Problems 196
Solutions 197
5.8 Historical Review 200
|
| any_adam_object | 1 |
| author | Hajdu, Miklós |
| author_facet | Hajdu, Miklós |
| author_role | aut |
| author_sort | Hajdu, Miklós |
| author_variant | m h mh |
| building | Verbundindex |
| bvnumber | BV011636223 |
| callnumber-first | T - Technology |
| callnumber-label | T56 |
| callnumber-raw | T56.8 |
| callnumber-search | T56.8 |
| callnumber-sort | T 256.8 |
| callnumber-subject | T - General Technology |
| classification_rvk | QH 465 |
| ctrlnum | (OCoLC)35865384 (DE-599)BVBBV011636223 |
| dewey-full | 658.4/04 |
| dewey-hundreds | 600 - Technology (Applied sciences) |
| dewey-ones | 658 - General management |
| dewey-raw | 658.4/04 |
| dewey-search | 658.4/04 |
| dewey-sort | 3658.4 14 |
| dewey-tens | 650 - Management and auxiliary services |
| discipline | Wirtschaftswissenschaften |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01813nam a2200493 cb4500</leader><controlfield tag="001">BV011636223</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">971119s1997 |||| 00||| eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">0792343093</subfield><subfield code="9">0-7923-4309-3</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)35865384</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV011636223</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rakddb</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-739</subfield></datafield><datafield tag="050" ind1=" " ind2="0"><subfield code="a">T56.8</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">658.4/04</subfield><subfield code="2">21</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">QH 465</subfield><subfield code="0">(DE-625)141600:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Hajdu, Miklós</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Network scheduling techniques for construction project management</subfield><subfield code="c">by Miklós Hajdu</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Dordrecht [u.a.]</subfield><subfield code="b">Kluwer</subfield><subfield code="c">1997</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">XII,333</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="490" ind1="1" ind2=" "><subfield code="a">Nonconvex optimization and its applications</subfield><subfield code="v">16</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Analyse de réseau (Planification)</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Emploi du temps</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Gestion de projets</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Netwerkanalyse</subfield><subfield code="2">gtt</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Projectmanagement</subfield><subfield code="2">gtt</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Wachttijdproblemen</subfield><subfield code="2">gtt</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Network analysis (Planning)</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Project management</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Scheduling</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Projektplanung</subfield><subfield code="0">(DE-588)4115649-3</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Netzplantechnik</subfield><subfield code="0">(DE-588)4075297-5</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Projektplanung</subfield><subfield code="0">(DE-588)4115649-3</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="1"><subfield code="a">Netzplantechnik</subfield><subfield code="0">(DE-588)4075297-5</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="830" ind1=" " ind2="0"><subfield code="a">Nonconvex optimization and its applications</subfield><subfield code="v">16</subfield><subfield code="w">(DE-604)BV010085908</subfield><subfield code="9">16</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="m">HBZ Datenaustausch</subfield><subfield code="q">application/pdf</subfield><subfield code="u">http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=007841858&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA</subfield><subfield code="3">Inhaltsverzeichnis</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-007841858</subfield></datafield></record></collection> |
| id | DE-604.BV011636223 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-09T18:13:10Z |
| institution | BVB |
| isbn | 0792343093 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-007841858 |
| oclc_num | 35865384 |
| open_access_boolean | |
| owner | DE-739 |
| owner_facet | DE-739 |
| physical | XII,333 |
| publishDate | 1997 |
| publishDateSearch | 1997 |
| publishDateSort | 1997 |
| publisher | Kluwer |
| record_format | marc |
| series | Nonconvex optimization and its applications |
| series2 | Nonconvex optimization and its applications |
| spelling | Hajdu, Miklós Verfasser aut Network scheduling techniques for construction project management by Miklós Hajdu Dordrecht [u.a.] Kluwer 1997 XII,333 txt rdacontent n rdamedia nc rdacarrier Nonconvex optimization and its applications 16 Analyse de réseau (Planification) Emploi du temps Gestion de projets Netwerkanalyse gtt Projectmanagement gtt Wachttijdproblemen gtt Network analysis (Planning) Project management Scheduling Projektplanung (DE-588)4115649-3 gnd rswk-swf Netzplantechnik (DE-588)4075297-5 gnd rswk-swf Projektplanung (DE-588)4115649-3 s Netzplantechnik (DE-588)4075297-5 s DE-604 Nonconvex optimization and its applications 16 (DE-604)BV010085908 16 HBZ Datenaustausch application/pdf http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=007841858&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA Inhaltsverzeichnis |
| spellingShingle | Hajdu, Miklós Network scheduling techniques for construction project management Nonconvex optimization and its applications Analyse de réseau (Planification) Emploi du temps Gestion de projets Netwerkanalyse gtt Projectmanagement gtt Wachttijdproblemen gtt Network analysis (Planning) Project management Scheduling Projektplanung (DE-588)4115649-3 gnd Netzplantechnik (DE-588)4075297-5 gnd |
| subject_GND | (DE-588)4115649-3 (DE-588)4075297-5 |
| title | Network scheduling techniques for construction project management |
| title_auth | Network scheduling techniques for construction project management |
| title_exact_search | Network scheduling techniques for construction project management |
| title_full | Network scheduling techniques for construction project management by Miklós Hajdu |
| title_fullStr | Network scheduling techniques for construction project management by Miklós Hajdu |
| title_full_unstemmed | Network scheduling techniques for construction project management by Miklós Hajdu |
| title_short | Network scheduling techniques for construction project management |
| title_sort | network scheduling techniques for construction project management |
| topic | Analyse de réseau (Planification) Emploi du temps Gestion de projets Netwerkanalyse gtt Projectmanagement gtt Wachttijdproblemen gtt Network analysis (Planning) Project management Scheduling Projektplanung (DE-588)4115649-3 gnd Netzplantechnik (DE-588)4075297-5 gnd |
| topic_facet | Analyse de réseau (Planification) Emploi du temps Gestion de projets Netwerkanalyse Projectmanagement Wachttijdproblemen Network analysis (Planning) Project management Scheduling Projektplanung Netzplantechnik |
| url | http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=007841858&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |
| volume_link | (DE-604)BV010085908 |
| work_keys_str_mv | AT hajdumiklos networkschedulingtechniquesforconstructionprojectmanagement |