Scheduling of resource-constrained projects:
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
Boston [u.a.]
Kluwer Acad. Publ.
2000
|
| Schriftenreihe: | Operations research, computer science interfaces series
10 |
| Schlagworte: | |
| Online-Zugang: | Inhaltsverzeichnis |
| Beschreibung: | XVI, 369 S. graph. Darst. |
| ISBN: | 079238637X |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV012817860 | ||
| 003 | DE-604 | ||
| 005 | 20060703 | ||
| 007 | t | ||
| 008 | 991019s2000 d||| |||| 00||| eng d | ||
| 020 | |a 079238637X |9 0-7923-8637-X | ||
| 035 | |a (OCoLC)42454047 | ||
| 035 | |a (DE-599)BVBBV012817860 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-945 |a DE-703 |a DE-384 | ||
| 050 | 0 | |a TS157.5 | |
| 082 | 0 | |a 658.5/3 |2 21 | |
| 084 | |a QP 542 |0 (DE-625)141900: |2 rvk | ||
| 084 | |a ZM 9220 |0 (DE-625)157217: |2 rvk | ||
| 100 | 1 | |a Klein, Robert |d 1969- |e Verfasser |0 (DE-588)171451589 |4 aut | |
| 245 | 1 | 0 | |a Scheduling of resource-constrained projects |c by Robert Klein |
| 264 | 1 | |a Boston [u.a.] |b Kluwer Acad. Publ. |c 2000 | |
| 300 | |a XVI, 369 S. |b graph. Darst. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 1 | |a Operations research, computer science interfaces series |v 10 | |
| 650 | 7 | |a Operations research |2 gtt | |
| 650 | 4 | |a Ordonnancement (Gestion) | |
| 650 | 7 | |a Ordonnancement (gestion) |2 ram | |
| 650 | 7 | |a Productieplanning |2 gtt | |
| 650 | 7 | |a Projectmanagement |2 gtt | |
| 650 | 7 | |a Wachttijdproblemen |2 gtt | |
| 650 | 4 | |a Production scheduling | |
| 650 | 0 | 7 | |a Fertigungsplanung |0 (DE-588)4113545-3 |2 gnd |9 rswk-swf |
| 689 | 0 | 0 | |a Fertigungsplanung |0 (DE-588)4113545-3 |D s |
| 689 | 0 | |5 DE-604 | |
| 830 | 0 | |a Operations research, computer science interfaces series |v 10 |w (DE-604)BV012124389 |9 10 | |
| 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=008719098&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |3 Inhaltsverzeichnis |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-008719098 | ||
Datensatz im Suchindex
| _version_ | 1804127492131258368 |
|---|---|
| adam_text | Contents
Notations XI
Preface XV
Part I Project Management: Basics and Scheduling Problems
1 The Project Management Process 1
1.1 Definition of a Project 1
1.2 The Project Life Cycle 2
1.3 Project Conception 5
1.3.1 Feasibility Study 7
1.3.2 Economic Analysis 8
1.3.3 Risk Analysis 10
1.3.4 Project Selection 12
1.4 Project Definition 15
1.4.1 Project Specification 15
1.4.2 Project Organization 16
1.4.3 Process Organization 17
1.4.4 Budgeting 19
1.5 Project Planning 22
1.5.1 Structuring 22
1.5.2 Scheduling 24
1.5.3 Resource Allocation 24
1.6 Project Execution 26
1.6.1 Reporting, Monitoring, and Control 27
1.6.2 Configuration Management 28
1.6.3 Quality Management 29
VI Contents
1.7 Project Termination 30
1.7.1 Final Evaluation and Reporting 30
1.7.2 Dissolution 31
2 Project Planning and Control 33
2.1 Structuring 34
2.1.1 Work Breakdown Structure 34
2.1.2 Activity on Node Networks 37
2.1.3 Activity on Arc Networks 41
2.2 Scheduling 43
2.2.1 Critical Path Analysis 43
2.2.2 Slack Time Computations 46
2.2.3 Gantt Charts 49
2.3 Resource Allocation 50
2.3.1 Resource Loading 50
2.3.2 Resource Constrained Scheduling 52
2.3.3 Time Constrained Scheduling 54
2.4 Control 55
2.4.1 Schedule Control 56
2.4.2 Cost Control 60
2.5 Project Management Software 63
2.5.1 Features for Project Conception, Definition, and Termination 64
2.5.2 Features for Project Planning 65
2.5.3 Features for Project Execution 68
2.5.4 General Features 70
3 Resource Constrained Scheduling Problems 73
3.1 Notations and Definitions 73
3.2 Basic Models 76
3.2.1 The Resource Constrained Project Scheduling Problem (RCPSP) 77
3.2.1.1 Properties of RCPSP 77
3.2.1.2 Formulation 1 79
3.2.1.3 Formulation 2 80
3.2.1.4 Formulation 3 82
3.2.1.5 Formulation 4 84
3.2.1.6 Formulation 5 86
3.2.1.7 Formulation 6 87
i
Contents VII
3.2.2 The Generalized Resource Constrained Project Scheduling Problem 89
3.2.2.1 Properties of GRCPSP 91
3.2.2.2 Formulations 92
3.2.3 Problem Complexity 92
3.3 Extensions of the Basic Models 95
3.3.1 Preemption 96
3.3.2 Multiple Modes 96
3.3.3 Maximum Time Lags 99
3.3.4 State Preserving Jobs 100
3.3.5 Further Extensions 102
3.4 Related Project Scheduling Problems 102
3.4.1 The Time Constrained Project Scheduling Problem 103
3.4.2 The Resource Leveling Problem 104
3.4.3 The Resource Investment Problem 105
3.4.4 The Net Present Value Problem 106
3.4.5 The Weighted Tardiness Problem 108
3.4.6 Further Resource Constrained Project Scheduling Problems 108
Part II Resource Constrained Project Scheduling:
Solution Methods
4 Lower Bound Methods H3
4.1 Constructive Lower Bound Methods for RCPSP 114
4.1.1 Simple Bound Arguments 114
4.1.1.1 Critical Path and Capacity Bounds 114
4.1.1.2 Bin Packing Bounds 117
4.1.1.3 Node Packing Bounds 120
4.1.1.4 Parallel Machine Bounds 124
4.1.1.5 Precedence Bounds 128
4.1.2 Complex Bound Arguments 129
4.1.2.1 LP Relaxation with Cutting Planes 130
4.1.2.2 Lagrangean Relaxation 132
4.1.2.3 Set Covering Based Approach 134
4.2 Destructive Improvement 36
4.2.1 Meta Strategies for Computing Lower Bounds 136
4.2.2 Applying Destructive Improvement to RCPSP 141
4.2.2.1 Reduction Techniques 141
4.2.2.2 Lower Bound Arguments for Contradicting Feasibility 147
VIII Contents
4.3 Lower Bound Methods for GRCPSP 149
4.3.1 Simple Bound Arguments 150
4.3.1.1 Critical Path and Capacity Bounds 152
4.3.1.2 Node Packing Bounds 153
4.3.1.3 Parallel Machine Bounds 157
4.3.1.4 Precedence Based Bounds 158
4.3.2 Destructive Improvement 159
5 Heuristic Procedures 161
5.1 Types of Schedules 162
5.2 Priority Rule Based Methods 167
5.2.1 Scheduling Schemes 169
5.2.1.1 Serial Scheduling Scheme 169
5.2.1.2 Parallel Scheduling Scheme 171
5.2.1.3 A Critique of the Scheduling Schemes 173
5.2.2 Multiple Planning Directions 175
5.2.2.1 Backward Planning 175
5.2.2.2 Bidirectional Planning 178
5.2.3 Priority Rules 181
5.2.4 Multi Pass Priority Rule Based Heuristics 187
5.3 Improvement Methods 190
5.3.1 The Meta Heuristic Tabu Search 191
5.3.1.1 Moves, Neighborhood, and Descent Procedures 191
5.3.1.2 Basic Principles of Tabu Search 193
5.3.1.3 Extensions of the Basic Approach 196
5.3.2 The Tabu Search Procedure Retaps 198
5.3.2.1 Definition of the Neighborhood 198
5.3.2.2 Tabu Management and Diversification 204
5.3.3 Other Meta Heuristic Based Procedures for RCPSP 208
6 Exact Procedures 213
6.1 Components of Branch and Bound Procedures 214
6.1.1 Branching Schemes 215
6.1.2 Search Strategies 216
6.1.3 Bounding Rules 218
6.1.4 Reduction Rules 219
6.1.5 Dominance Rules 220
Contents IX
6.2 The Branch and Bound Procedure PROGRESS 221
6.2.1 The Branching Scheme 222
6.2.2 Local Lower Bound Method 224
6.2.3 Bounding Rules 226
6.2.4 Reduction and Dominance Rules 228
6.2.4.1 Core Time Rule 228
6.2.4.2 Active Schedule Rules 229
6.2.4.3 Supersession Rule 231
6.2.4.4 Schedule Storing Rules 232
6.2.5 Example 236
6.3 Scattered Branch and Bound 240
6.3.1 Principles of Scattered Branch and Bound 241
6.3.1.1 A Critique of Traditional Branch and Bound 241
6.3.1.2 Subdividing the Solution Space into Regions 243
6.3.1.3 Swapping Regions 245
6.3.2 Scatter: Scattered Branch and Bound for GRCPSP 247
6.3.2.1 Outline 247
6.3.2.2 Decomposing the Solution Space 248
6.3.2.3 Swapping Regions 249
6.3.2.4 Example 251
6.4 Existing Procedures 252
6.4.1 Parallel Branching Scheme 253
6.4.2 Serial Branching Scheme 254
6.4.3 Delaying Alternatives 256
6.4.4 Schedule Schemes 258
7 Computational Experiments 261
7.1 Hardware and Software Environment 262
7.2 Complexity Measures and Data Sets 263
7.2.1 Complexity Measures 263
7.2.2 Data Sets for RCPSP 267
7.2.3 Data Sets for GRCPSP 269
7.3 Lower Bound Arguments 274
7.3.1 Simple Bound Arguments 275
7.3.2 Destructive Improvement 278
7.3.3 Influence of the Problem Structure 281
7.3.4 Comparison with Complex Bound Arguments 284
X Contents
7.4 Heuristic Procedures 286
7.4.1 Priority Rule Based Heuristics 286
7.4.1.1 Combinations of Scheduling Schemes and Priority Rules 287
7.4.1.2 Influence of the Problem Structure 290
7.4.1.3 Multi Pass Performance 293
7.4.1.4 Comparison to Proprietary Heuristics of Standard Software 295
7.4.1.5 Results for GRCPSP 296
7.4.2 The Tabu Search Procedure RETAPS 300
7.4.2.1 Analysis of GRCPSP Performance 301
7.4.2.2 Comparing RETAPS to Multi Pass Heuristics 304
7.4.2.3 Comparing RETAPS to Other Heuristic Procedures for RCPSP .. 305
7.5 Exact Procedures 306
7.5.1 The Branch and Bound Procedure PROGRESS 306
7.5.1.1 Comparing PROGRESS to Gdh 307
7.5.1.2 Analyzing the Efficiency of PROGRESS 309
7.5.2 Scattered Branch and Bound 313
7.5.2.1 Comparing Scatter to PROGRESS 313
7.5.2.2 Comparing SCATTER to Existing RCPSP Procedures 318
7.5.2.3 Comparing SCATTER to RETAPS 321
8 Summary and Conclusions 325
References 333
Index 365
|
| any_adam_object | 1 |
| author | Klein, Robert 1969- |
| author_GND | (DE-588)171451589 |
| author_facet | Klein, Robert 1969- |
| author_role | aut |
| author_sort | Klein, Robert 1969- |
| author_variant | r k rk |
| building | Verbundindex |
| bvnumber | BV012817860 |
| callnumber-first | T - Technology |
| callnumber-label | TS157 |
| callnumber-raw | TS157.5 |
| callnumber-search | TS157.5 |
| callnumber-sort | TS 3157.5 |
| callnumber-subject | TS - Manufactures |
| classification_rvk | QP 542 ZM 9220 |
| ctrlnum | (OCoLC)42454047 (DE-599)BVBBV012817860 |
| dewey-full | 658.5/3 |
| dewey-hundreds | 600 - Technology (Applied sciences) |
| dewey-ones | 658 - General management |
| dewey-raw | 658.5/3 |
| dewey-search | 658.5/3 |
| dewey-sort | 3658.5 13 |
| dewey-tens | 650 - Management and auxiliary services |
| discipline | Werkstoffwissenschaften / Fertigungstechnik Wirtschaftswissenschaften |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01761nam a2200457 cb4500</leader><controlfield tag="001">BV012817860</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20060703 </controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">991019s2000 d||| |||| 00||| eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">079238637X</subfield><subfield code="9">0-7923-8637-X</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)42454047</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV012817860</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-945</subfield><subfield code="a">DE-703</subfield><subfield code="a">DE-384</subfield></datafield><datafield tag="050" ind1=" " ind2="0"><subfield code="a">TS157.5</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">658.5/3</subfield><subfield code="2">21</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">QP 542</subfield><subfield code="0">(DE-625)141900:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">ZM 9220</subfield><subfield code="0">(DE-625)157217:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Klein, Robert</subfield><subfield code="d">1969-</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)171451589</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Scheduling of resource-constrained projects</subfield><subfield code="c">by Robert Klein</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Boston [u.a.]</subfield><subfield code="b">Kluwer Acad. Publ.</subfield><subfield code="c">2000</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">XVI, 369 S.</subfield><subfield code="b">graph. Darst.</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">Operations research, computer science interfaces series</subfield><subfield code="v">10</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Operations research</subfield><subfield code="2">gtt</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Ordonnancement (Gestion)</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Ordonnancement (gestion)</subfield><subfield code="2">ram</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Productieplanning</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">Production scheduling</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Fertigungsplanung</subfield><subfield code="0">(DE-588)4113545-3</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Fertigungsplanung</subfield><subfield code="0">(DE-588)4113545-3</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">Operations research, computer science interfaces series</subfield><subfield code="v">10</subfield><subfield code="w">(DE-604)BV012124389</subfield><subfield code="9">10</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=008719098&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-008719098</subfield></datafield></record></collection> |
| id | DE-604.BV012817860 |
| illustrated | Illustrated |
| indexdate | 2024-07-09T18:34:12Z |
| institution | BVB |
| isbn | 079238637X |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-008719098 |
| oclc_num | 42454047 |
| open_access_boolean | |
| owner | DE-945 DE-703 DE-384 |
| owner_facet | DE-945 DE-703 DE-384 |
| physical | XVI, 369 S. graph. Darst. |
| publishDate | 2000 |
| publishDateSearch | 2000 |
| publishDateSort | 2000 |
| publisher | Kluwer Acad. Publ. |
| record_format | marc |
| series | Operations research, computer science interfaces series |
| series2 | Operations research, computer science interfaces series |
| spelling | Klein, Robert 1969- Verfasser (DE-588)171451589 aut Scheduling of resource-constrained projects by Robert Klein Boston [u.a.] Kluwer Acad. Publ. 2000 XVI, 369 S. graph. Darst. txt rdacontent n rdamedia nc rdacarrier Operations research, computer science interfaces series 10 Operations research gtt Ordonnancement (Gestion) Ordonnancement (gestion) ram Productieplanning gtt Projectmanagement gtt Wachttijdproblemen gtt Production scheduling Fertigungsplanung (DE-588)4113545-3 gnd rswk-swf Fertigungsplanung (DE-588)4113545-3 s DE-604 Operations research, computer science interfaces series 10 (DE-604)BV012124389 10 HBZ Datenaustausch application/pdf http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=008719098&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA Inhaltsverzeichnis |
| spellingShingle | Klein, Robert 1969- Scheduling of resource-constrained projects Operations research, computer science interfaces series Operations research gtt Ordonnancement (Gestion) Ordonnancement (gestion) ram Productieplanning gtt Projectmanagement gtt Wachttijdproblemen gtt Production scheduling Fertigungsplanung (DE-588)4113545-3 gnd |
| subject_GND | (DE-588)4113545-3 |
| title | Scheduling of resource-constrained projects |
| title_auth | Scheduling of resource-constrained projects |
| title_exact_search | Scheduling of resource-constrained projects |
| title_full | Scheduling of resource-constrained projects by Robert Klein |
| title_fullStr | Scheduling of resource-constrained projects by Robert Klein |
| title_full_unstemmed | Scheduling of resource-constrained projects by Robert Klein |
| title_short | Scheduling of resource-constrained projects |
| title_sort | scheduling of resource constrained projects |
| topic | Operations research gtt Ordonnancement (Gestion) Ordonnancement (gestion) ram Productieplanning gtt Projectmanagement gtt Wachttijdproblemen gtt Production scheduling Fertigungsplanung (DE-588)4113545-3 gnd |
| topic_facet | Operations research Ordonnancement (Gestion) Ordonnancement (gestion) Productieplanning Projectmanagement Wachttijdproblemen Production scheduling Fertigungsplanung |
| url | http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=008719098&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |
| volume_link | (DE-604)BV012124389 |
| work_keys_str_mv | AT kleinrobert schedulingofresourceconstrainedprojects |