Scheduling of resource constrained project

Free ebooks ==> www.Ebook777.com Scheduling of Resource-Constrained Projects www.Ebook777.com Free ebooks ==> www.Ebook777.com OPERATIONS RESEARCH/COMPUTER SCIENCE INTERFACES SERIES Series Editors Professor Ramesh Sharda Oklahoma State University Prof Dr Stefan VoB Technische Universitdt Braunschweig Other published titles in the series: Brown, Donald/Scherer, William T Intelligent Scheduling Systems Nash, Stephen G.lSofer, Ariela The Impact of Emerging Technologies on Computer Science and Operations Research Barth, Peter Logic-Based 0-1 Constraint Programming Jones, Christopher V Visualization and Optimization Barr, Richard S.I Helgason, Richard V.I Kennington, Jeffery L Interfaces in Computer Science and Operations Research: Advances in Metaheuristics, Optimization, and Stochastic Modeling Technologies Ellacott, Stephen W I Mason, John C.I Anderson, lain J Mathematics of Neural Networks: Models, Algorithms & Applications Woodruff, David L Advances in Computational and Stochastic Optimization, Logic Programming, and Heuristic Search www.Ebook777.com Free ebooks ==> www.Ebook777.com Scheduling of Resource-Constrained Projects by Robert Klein " ~ Springer-Science+ Business Media, LLC www.Ebook777.com Free ebooks ==> www.Ebook777.com Library of Congress Cataloging-in-Publication Klein, Robert Scheduling of resource-constrained projects / by Robert Klein p.cm (Operations research/ computer science interfaces series ; OReS 10) Includes bibIiographical references and index ISBN 978-1-4613-7093-2 ISBN 978-1-4615-4629-0 (eBook) DOI 10.1007/978-1-4615-4629-0 Production scheduIing TitIe II Series TSI57.5.K5541999 658.5'3 dc21 99-046684 Copyright e 2000 by Springer Science+Business Media New York Origina1ly published by Kluwer Academic Publishers in 2000 Softcover reprint of the hardcover 1st edition 2000 AlI rights reserved No part of this publication may be reproduced, stored in a retrieval system or transmitted in any form or by any means, mechanical, photocopying, record ing, or otherwise, without the prior written permission of the publisher, Springer-Science+Business Media, LLC Printed on acid-free paper www.Ebook777.com Free ebooks ==> www.Ebook777.com Contents Notations XI Preface XV Part I Project Management: Basics and Scheduling Problems The Project Management Process 1.1 Definition ofa Project 1.2 The Project Life Cycle 1.3 Project Conception 1.3.1 Feasibility Study 1.3.2 Economic Analysis 1.3.3 Risk Analysis 10 1.3.4 Project Selection 12 1.4 Project Definition 1.4.1 Project Specification 1.4.2 Project Organization 1.4.3 Process Organization 1.4.4 Budgeting 15 IS 16 17 19 1.5 Project Planning 1.5.1 Structuring 1.5.2 Scheduling 1.5.3 Resource Allocation 22 22 24 24 1.6 Project Execution 1.6.1 Reporting, Monitoring, and Control 1.6.2 Configuration Management 1.6.3 Quality Management 26 27 28 29 www.Ebook777.com Free ebooks ==> www.Ebook777.com VI 1.7 Contents Project Termination 30 1.7.1 Final Evaluation and Reporting 30 1.7.2 Dissolution 31 Project Planning and Control 33 2.1 Structuring 2.1.1 Work Breakdown Structure 2.1.2 Activity-on-Node Networks 2.1.3 Activity-on-Arc Networks 34 34 37 41 2.2 Scheduling 2.2.1 Critical Path Analysis 2.2.2 Slack Time Computations 2.2.3 Gantt Charts 43 43 46 49 2.3 Resource Allocation 2.3.1 Resource Loading 2.3.2 Resource-Constrained Scheduling 2.3.3 Time-Constrained Scheduling 50 50 52 54 2.4 Control 55 2.4.1 Schedule Control 56 2.4.2 Cost Control 60 2.5 Project Management Software 2.5.1 Features for Project Conception, Definition, and Termination 2.5.2 Features for Project Planning 2.5.3 Features for Project Execution 2.5.4 General Features 63 64 65 68 70 Resource-Constrained Scheduling Problems 73 3.1 Notations and Definitions 73 3.2 Basic Models 3.2.1 The Resource-Constrained Project Scheduling Problem (RCPSP) 3.2.1.1 Properties ofRCPSP 3.2.1.2 Formulation I 3.2.1.3 Formulation 3.2.1.4 Formulation 3.2.1.5 Formulation 3.2.1.6 Formulation 3.2.1.7 Formulation www.Ebook777.com 76 77 77 79 80 82 84 86 87 Free ebooks ==> www.Ebook777.com Contents VII 3.2.2 The Generalized Resource-Constrained Project Scheduling Problem 3.2.2.1 Properties ofGRCPSP 3.2.2.2 Formulations 3.2.3 Problem Complexity 89 91 92 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 3.4.1 The Time-Constrained Project Scheduling Problem 3.4.2 The Resource Leveling Problem 3.4.3 The Resource Investment Problem 3.4.4 The Net Present Value Problem 3.4.5 The Weighted Tardiness Problem 3.4.6 Further Resource-Constrained Project Scheduling Problems 102 103 104 105 106 108 108 Part II Resource-Constrained Project Scheduling: Solution Methods Lower Bound Methods 113 4.1 Constructive Lower Bound Methods for RCPSP 4.1.1 Simple Bound Arguments 4.1.1.1 Critical Path and Capacity Bounds 4.1.1.2 Bin Packing Bounds 4.1.1.3 Node Packing Bounds 4.1.1.4 Parallel Machine Bounds 4.1.1.5 Precedence Bounds 4.1.2 Complex Bound Arguments 4.1.2.1 LP-Relaxation with Cutting Planes 4.1.2.2 Lagrangean Relaxation 4.1.2.3 Set Covering Based Approach 114 114 114 117 120 124 128 129 130 132 134 4.2 Destructive Improvement 4.2.1 Meta-Strategies for Computing Lower Bounds 4.2.2 Applying Destructive Improvement to RCPSP 4.2.2.1 Reduction Techniques 4.2.2.2 Lower Bound Arguments for Contradicting Feasibility 136 136 141 141 147 www.Ebook777.com Free ebooks ==> www.Ebook777.com VIII 4.3 Contents Lower Bound Methods for GRCPSP 4.3.1 Simple Bound Arguments 4.3.1.1 Critical Path and Capacity Bounds 4.3.1.2 Node Packing Bounds 4.3.1.3 Parallel Machine Bounds 4.3.1.4 Precedence Based Bounds 4.3.2 Destructive Improvement 149 150 152 153 157 158 159 Heuristic Procedures 161 5.1 Types of Schedules 162 5.2 Priority-Rule Based Methods 5.2.1 Scheduling Schemes 5.2.1.1 Serial Scheduling Scheme 5.2.1.2 Parallel Scheduling Scheme 5.2.1.3 A Critique of the Scheduling Schemes 5.2.2 Multiple Planning Directions 5.2.2.1 Backward Planning 5.2.2.2 Bidirectional Planning 5.2.3 Priority Rules 5.2.4 Multi-Pass Priority-Rule Based Heuristics 167 169 169 171 173 175 175 178 181 187 5.3 Improvement Methods 5.3.1 The Meta-Heuristic Tabu Search 5.3.1.1 Moves, Neighborhood, and Descent Procedures 5.3.1.2 Basic Principles of Tabu Search 5.3.1.3 Extensions of the Basic Approach 5.3.2 The Tabu Search Procedure RETAPS 5.3.2.1 Definition of the Neighborhood 5.3.2.2 Tabu Management and Diversification 5.3.3 Other Meta-Heuristic Based Procedures for RCPSP 190 191 191 193 196 198 198 204 208 Exact Procedures 213 6.1 Components of Branch and Bound Procedures 6.1.1 Branching Schemes 6.1.2 Search Strategies 6.1.3 Bounding Rules 6.1.4 Reduction Rules 6.1.5 Dominance Rules www.Ebook777.com 214 215 216 218 219 220 Free ebooks ==> www.Ebook777.com Contents IX 6.2 The Branch and Bound Procedure PROGRESS • 6.2.1 The Branching Scheme 6.2.2 Local Lower Bound Method 6.2.3 Bounding Rules 6.2.4 Reduction and Dominance Rules 6.2.4.1 Core Time Rule 6.2.4.2 Active Schedule Rules 6.2.4.3 Supersession Rule 6.2.4.4 Schedule Storing Rules 6.2.5 Example 221 222 224 226 228 228 229 231 232 236 6.3 Scattered Branch and Bound • 6.3.1 Principles ofScauered Branch and Bound 6.3.1.1 A Critique of Traditional Branch and Bound 6.3.1.2 Subdividing the Solution Space into Regions 6.3.1.3 Swapping Regions 6.3.2 SCATTER: Scattered Branch and Bound for GRCPSP 6.3.2.1 Outline 6.3.2.2 Decomposing the Solution Space 6.3.2.3 Swapping Regions 6.3.2.4 Example 240 241 241 243 245 247 247 248 249 251 6.4 Existing Procedures 6.4.1 Parallel Branching Scheme 6.4.2 Serial Branching Scheme 6.4.3 Delaying Alternatives 6.4.4 Schedule Schemes 252 253 254 256 258 Computational Experiments 261 7.1 Hardware and Software Environment 262 7.2 Complexity Measures and Data Sets 7.2.1 Complexity Measures 7.2.2 Data Sets for RCPSP 7.2.3 Data Sets for GRCPSP 263 263 267 269 7.3 Lower Bound Arguments 7.3.1 Simple Bound Arguments 7.3.2 Destructive Improvement 7.3.3 Influence of the Problem Structure 7.3.4 Comparison with Complex Bound Arguments 274 275 278 281 284 www.Ebook777.com Free ebooks ==> www.Ebook777.com X Contents 7.4 Heuristic Procedures 7.4.1 Priority-Rule Based Heuristics 7.4.1.1 Combinations of Scheduling Schemes and Priority Rules 7.4.1.2 Influence of the Problem Structure 7.4.1.3 Multi-Pass Performance 7.4.1.4 Comparison to Proprietary Heuristics of Standard Software 7.4.1.5 Results for GRCPSP 7.4.2 The Tabu Search Procedure RETAPS 7.4.2.1 Analysis of GRCPSP Performance 7.4.2.2 Comparing RETAPS to Multi-Pass Heuristics 7.4.2.3 Comparing RETAPS to Other Heuristic Procedures for RCPSP 286 286 287 290 293 295 296 300 301 304 305 7.5 Exact Procedures 7.5.1 The Branch and Bound Procedure PROGRESS 7.5.1.1 Comparing PROGRESS to GOH 7.5.1.2 Analyzing the Efficiency of PROGRESS 7.5.2 Scattered Branch and Bound 7.5.2.1 Comparing SCATTER to PROGRESS 7.5.2.2 Comparing SCATTER to Existing RCPSP Procedures 7.5.2.3 Comparing SCATTER to RETAPS 306 306 307 309 313 313 318 321 Summary and Conclusions 325 References 333 Index 365 www.Ebook777.com Free ebooks ==> www.Ebook777.com References 355 Pascoe, T.L (1966): Allocation of Resources C.P.M Revue Francaise de Recherche Operationelle 38, 31-38 Patterson, J.H (1973): Alternate Methods of Project Scheduling with Limited Resources Naval Research Logistics Quarterly 20,767-785 Patterson, J.H (1976): Project Scheduling: The Effects of Problem Structure in Heuristic Performance Naval Research Logistics Quarterly 23,95-123 Patterson, J.H (1984): A Comparison of Exact Approaches for Solving the Multiple Constrained Resource, Project Scheduling Problem Management Science 30,854-867 Patterson, J.H and W.D Huber (1974): A Horizon-Varying, Zero-One Approach to Project Scheduling Management Science 20, 990-998 Patterson, J.H and G.W Roth (1976): Scheduling a Project under Multiple Resource Constraints: A Zero-One Programming Approach AIlE Transactions 8, 449-455 Patterson, J.H.; R Slowinski, F.B Talbot, and J Weglarz (1989): An Algorithm for a General Class of Precedence and Resource Constrained Project Scheduling Problems In: Slowinski, R and J Weglarz (Eds.): Advances in Project Scheduling Elsevier, Amsterdam, 3-29 Patterson, J.H.; F.B Talbot, R Slowinski, and J Weglarz (1990): Computational Experience with a Backtracking Alogrithm for Solving a General Class of Precedence and Resource-Constrained Project Scheduling Problems European Journal of Operational Research 49, 68-79 Pesch, E (1999): Lower Bounds in Different Problem Classes of Project Schedules with Resource Constraints In: Weglarz, (Ed.): Handbook on Recent Advances in Project Scheduling Kluwer, Dordrecht, 53-75 Pesch, E and U Tetzlaff(1996): Constraint Propagation Based Scheduling of Job Shops INFORMS Journal on Computing 8,144-157 Phillips, S and M.I Dessouky (1977): Solving the Project Time/Cost Tradeoff Problem Using the Minimal Cut Concept Management Science 24, 393-400 Pirlot, M (1996): General Local Search Methods European Journal of Operational Research 92, 493-511 Pollack-Johnson, B (1995): Hybrid Structures and Improving Forecasting and Scheduling in Project Management Journal of Operations Management 12, 101-117 Popescu, C.M and S Pasiphol (1995): Total Float Management in CPM Project Scheduling AACE Transactions, C&SM/C.5.1-C&SM/C.5.5 Pritsker, A.A.B.; LJ Watters, and Ph.M Wolfe (1969): Multiproject Scheduling with Limited Resources: A Zero-One Programming Approach Management Science 16, 93-108 Radermacher (1985/86): Scheduling of Project Networks Annals of Operations Research 4, 227-252 Ragsdale, C (1989): The Current State of Network Simulation in Project Management Theory and Practice Omega 17, 21-25 www.Ebook777.com Free ebooks ==> www.Ebook777.com 356 References Raz, T and B Marshall (1996): Effect of Resource Constraints on Float Calculations in Project Networks International Journal of Project Management 14,241-248 Realff, M.J and G Stephanopoulos (1998): On the Application of Explanation-Based Learning to Acquire Control Knowledge for Branch and Bound Algorithms INFORMS Journal on Computing 10, 56-71 Reeves, C.R (1997): Genetic Algorithms for the Operations Researcher INFORMS Journal on Computing 9, 231-250 Remer, D.S and A.P Nieto (1995): A Compendium and Comparison of25 Project Evaluation Techniques Part I: Net Present Value and Rate of Return Methods International Journal of Production Economics 42,79-96 Ritchie, E (1985): Network Based Planning Techniques: A Critical Review of Published Developments In: Rand, G and R Eglese (Eds.): Further Developments in Operations Research Pergamon Press, Oxford, 34-56 Roy, B (1964): Les Problemes d'Ordonnancement Dunod, Paris Roucairol, C (1996): Parallel Processing for Difficult Combinatorial Optimization Problems European Journal of Operational Research 92,573-590 Russell, A.H (1970): Cash Flows in Networks Management Science 16,357-373 Russell, R.A (1986): A Comparison of Heuristics for Scheduling Projects with Cash Flows and Resource Restrictions Management Science 32, 1291-1300 Rys, T.; R Stanek, and W Ziembla (1994): MIPS: A DSS for Multiobjective Interactive Project Scheduling European Journal of Operational Research 79,196-207 Salewski, F.; A Schirmer, and A Drexl (1995): Auftragsorientierte Bildung von PrUferteams fUr die taktische Personaleinsatzplanung in WirtschaftsprUfungsgesellschaften Zeitschrift fllr betriebswirtschaftliche Forschung 47, 211-236 Salewski, F.; A Schirmer, and A Drexl (1997): Project Scheduling under Resource and Mode Identity Constraints: Model, Complexity, Methods, and Application European Journal of Operational Research 102,88-110 Salkin, H.M (1975): Integer Programming Addison-Wesley, Reading Sampson, S.E and E.N Weiss (I993): Local Search Techniques for the Generalized Resource Constrained Project Scheduling Problem Naval Research Logistics 40, 665675 Savin, D.; S Alkass, and P Fazio (1996): Construction Resource Leveling Using Neural Networks Canadian Journal of Civil Engineering 23,917-925 Schirmer, A (1996 a): New Insights on the Complexity of Resource-Constrained Project Scheduling - A Case of Single-Mode Scheduling Manuskripte aus den Instituten fllr Betriebswirtschaftslehre 390, University ofKiel Schirmer, A (1996 b): New Insights on the Complexity of Resource-Constrained Project Scheduling - Two Cases of Multi-Mode Scheduling Manuskripte aus den Instituten fUr Betriebswirtschaftslehre 391, University of Kiel www.Ebook777.com Free ebooks ==> www.Ebook777.com References 357 Schirmer, A (1998): Case-Based Reasoning and Improved Adaptive Search for Project Scheduling Manuskripte aus den Instituten fUr Betriebswirtschaftslehre 472, University ofKiel Schirmer, A and A Drexl (1997): Allocation of Partially Renewable Resources - Concept, Models, and Application Manuskripte aus den Instituten fUr Betriebswirtschaftslehre 435, University of Kiel Schirmer, A and S Riesenberg (1997 a): Class-Based Control Schemes for Parameterized Project Scheduling Heuristics Manuskripte aus den Instituten fUr Betriebswirtschaftslehre 471, University of Kiel Schirmer, A and S Riesenberg (1997 b): Parameterized Heuristics for Project Scheduling - Biased Random Sampling Methods Manuskripte aus den Instituten fUr Betriebswirtschaftslehre 456, University of Kiel Schmidt, M.l (1988): Schedule Monitoring of Engineering Projects IEEE Transactions on Engineering Management 35, 108-115 Schmidt, R.L (1993): A Model for R&D Selection with Combined Benefit, Outcome and Resource Interactions IEEE Transactions on Engineering Management 40, 403-410 Schmidt, R.L and J.R Freeland (1992): Recent Progress in Modeling R&D Project Selection IEEE Transactions on Engineering Management 39, 189-201 Schneider, w.o and D Hieber (1997): Software zur ressourcenbeschrlinkten Projektplanung Technical Report WIOR 494, University of Karlsruhe Schniederjans, MJ and R Santhanam (1993): A Multi-Objective Constrained Resource Information System Project Selection Method European Journal of Operational Research 70, 244-253 Scholl, A (1999): Balancing and Sequencing of Assembly Lines 2nd Ed., Physica, Heidelberg Scholl, A and R Klein (1997): SALOME: A Bidirectional Approach for Assembly Line Balancing INFORMS Journal on Computing 9,319-335 Scholl, A and R Klein (1999 a): Balancing Assembly Lines Effectively - A Computational Comparison European Journal of Operational Research 114, 51-60 Scholl, A and R Klein (1999 b): ULINO: Optimally Balancing U-Shaped JlT Assembly Lines International Journal of Production Research 37, 721-736 Scholl, A.; R Klein, and W Domschke (1998): Pattern Based Vocabulary Building for Effectively Sequencing Mixed-Model Assembly-Lines Journal of Heuristics 4, 359381 Scholl, A.; R Klein, and Ch JUrgens (1997 a): BISON: A Fast Hybrid Procedure for Solving the One-Dimensional Bin Packing Problem Computers & Operations Research 24, 627-645 Scholl, A.; O Krispin, R Klein, and W Domschke (1997 b): Branch and Bound - Optimieren auf Bliumen: je beschrlinkter, desto besser c't - Magazin fUr Computer Technik, Issue 10,336-345 Scholl, A and S VoB (1996): Simple Assembly Line Balancing - Heuristic Approaches Journal of Heuristics 2, 217-244 www.Ebook777.com Free ebooks ==> www.Ebook777.com 358 References Schonert, S (1998): Kommunikation Uber aile 17 Kan~i1e Office Management, Issue 5, 16- Schott, E.; Ch Campana, and M I1gner (1998): Mehr Tempo mit dem Internet Office Management, Issue 2, 44-47 Schrage, L (1970): Solving Resource-Constrained Network Problems by Implicit Enumeration - Nonpreemptive Case Operations Research 18,263-278 Schrage, L and K.R Baker (1978): Dynamic Programming Solution of Sequencing Problems with Precedence Constraints Operations Research 26, 444-449 Schultz, V (1995): Projektkostenschatzung - Kostenermittlung in frUhen Phasen von technischen Auftragsprojekten Gabler, Wiesbaden Schwarze, l (1994): Netzplantechnik 7th Ed., Verlag Neue Wirtschaftsbriefe, Herne Schwindt, Ch (1995): ProGenimax: A New Problem Generator for Different ResourceConstrained Project Scheduling Problems with Minimal and Maximal Time Lags Technical Report WI OR 449, University of Karlsruhe Schwindt, Ch (1996): Generation of Resource-Constrained Project Scheduling Problems with Minimal and Maximal Time Lags Technical Report WIOR I 6, University of Karlsruhe Schwindt, Ch (1998 a): A Branch-and-Bound Algorithm for the Resource-Constrained Project Scheduling Problem Subject to Temporal Constraints Technical Report WIOR 544, University of Karlsruhe Schwindt, Ch (1998 b): Generation of Resource-Constrained Project Scheduling Problems Subject to Temporal Constraints Technical Report WIOR 543, University of Karlsruhe Schwindt, Ch (1998 c): Verfahren zur Uisung des ressourcenbeschrankten Projektdauerminimierungsproblems mit planungsabhangigen Zeitfenstern Shaker, Aachen Seibert, lE and G.W Evans (1991): Time-Constrained Resource-Leveling Journal of Construction Engineering 117,503-520 Selcuk Erenguc, S and O Icmeli Tukel (1999): Integrating Quality as a Measure of Performance in Resource-Constrained Project Scheduling Problems In: Weglarz, J (Ed.): Handbook on Recent Advances in Project Scheduling Kluwer, Dordrecht, 433450 Sepil, C (1994): Comment on Elmaghraby and Herroelen's "The Scheduling of Activities to Maximize the Net Present Value of Projects" European Journal of Operational Research 73, 185-187 Sepil, C and N Ortac (1997): Performance of the Heuristic Procedures for Constrained Projects with Progress Payments Journal of the Operational Research Society 48, 1123-1130 Serafini, P and M.G Speranza (1994): A Decomposition Approach in a DSS for a Resource Constrained Scheduling Problem European Journal of Operational Research 79,208-219 www.Ebook777.com Free ebooks ==> www.Ebook777.com References 359 Shaffer, L.R.; J.B Ritter, and W.L Meyer (1965): The Critical Path Method McGrawHill, New York Shipley, M.F.; A De Korvin, and K Orner (1996): A Fuzzy Logic Approach for Determining Expected Values: A Project Management Application Journal of the Operational Research Society 47, 562-569 Shewchuck, J and T.e Chang (1995): Resource-Constrained Job Scheduling with Recycable Resources European Journal of Operational Research 81, 364-375 Shtub, A.; IF Bard, and S Globerson (1994): Project Management - Engineering, Technology, and Implementation Prentice Hall, Englewood Cliffs Simpson, W.P and J.H Patterson (1996): A Multiple-Tree Search Procedure for the Resource-Constrained Project Scheduling Problem European Journal of Operational Research 89, 525-542 Skutella, M (1998): Approximation and Randomization in Scheduling Unpublished Ph.D Thesis, Department of Mathematics, Technological University of Berlin Slowinski, R (1977): Optimal and Heuristic Procedures for Project Scheduling with Multiple Constrained Resources - A Survey Foundations of Control Engineering 2, 33-49 Slowinski, R (1978): A Node Ordering Heuristic for Network Scheduling under Multiple Resource Constraints Foundations of Control Engineering 3, 19-27 Slowinski, R (1981): Multiobjective Network Scheduling with Efficient Use of Renewable and Nonrenewable Resources European Journal of Operational Research 7, 265273 Slowinski, R (1988): Multiobjective Project Scheduling under Multiple-Category Resource Constraints In: Slowinski, R and J Weglarz (Eds.): Advances in Project Scheduling, Elsevier, Amsterdam, 151-167 Slowinski, R.; B Soniewicki, and J Weglarz (1994): DSS for Multiobjective Project Scheduling European Journal of Operational Research 79, 220-229 Smith-Daniels, D.E and N.J Aquilano (1987): Using a Late-Start Resource-Constrained Project Schedule to Improve Project Net Present Value Decision Sciences 18, 369387 Smith-Daniels, D.E.; R Padman, and V.L Smith-Daniels (1996): Heuristic Scheduling of Capital Constrained Projects Journal of Operations Management 14,241-254 Smith-Daniels, D.E and V.L Smith-Daniels (1987): Maximizing the Net Present Value of a Project Subject to Materials and Capital Constraints Journal of Operations Management 5, 33-45 Sondergeld, L and S VoB (1997): Optimierung mit dem Ameisen-System - Eine kooperative heuristische Strategie zur L5sung komplexer Optimierungsprobleme WiSt Wirtschaftswissenschaftliches Studium 26, 568-573 Soroush, H.M (1994): The Most Critical Path in a PERT Network Journal of the Operational Research Society 45, 287-300 Souder, W.E (1984): Project Selection and Economic Appraisal Van Nostrand Reinhold, New York www.Ebook777.com Free ebooks ==> www.Ebook777.com 360 References Speranza, G.M and C Vercellis (1993): Hierarchical Models for Multi-Project Planning and Scheduling European Journal of Operational Research 64,312-325 Spinner, M.P (1997): Project Management - Principles and Practices Prentice-Hall, Englewood Cliffs Sprecher, A (1994): Resource-Constrained Project Scheduling - Exact Methods for the Multi-Mode Case Springer, Berlin Sprecher, A (1997): Solving the RCPSP Efficiently at Modest Memory Requirements Manuskripte aus den Instituten fUr Betriebswirtschaftslehre 425, University ofKiel Sprecher, A (1998): Non-Equivalent Search Strategies for Resource-Constrained Project Scheduling Manuskripte aus den Instituten fUr Betriebswirtschaftslehre 493, University of Kiel Sprecher, A and A Drexl (1996): Minimal Delaying Alternatives and Semi-Active Timetabling in Resource-Constrained Project Scheduling Manuskripte aus den Instituten fUr Betriebswirtschaftslehre 426, University of Kiel Sprecher, A and A Drexl (1998): Multi-Mode Resource-Constrained Project Scheduling by a Simple, General and Powerful Sequencing Algorithm European Journal ofOperational Research 107,431-450 Sprecher, A.; S Hartmann, and A Drexl (1997): An Exact Algorithm for Project Scheduling with Multiple Modes OR Spektrum 19, 195-203 Sprecher, A.; R Kolisch, and A Drexl (1995): Semi-Active, Active and Nondelay Schedules for the Resource-Constrained Project Scheduling Problem European Journal of Operational Research 80, 94-102 Stinson, J.P.; E.W Davis, and B.M Khumawala (1978): Multiple Resource-Constrained Scheduling Using Branch and Bound AIlE Transactions 10,252-259 Sunde, L and S Lichtenberg (1995): Net-Present-Value CostlTime Tradeoff International Journal of Project Management 13,45-49 Sung, C.S and S.K Kim (1994): A Project Activity Scheduling Problem with Net Present Value Measure International Journal of Production Economics 37,177-187 Syslo, M.M (1984): On the Computational Complexity of the Minimum-Dummy-Activity Problem in a PERT Network Networks 14,37-45 Takamoto, M.; N Yamada, Y Kobayashi, and H Nonaka (1995): Zero-One Programming Algorithm for Resource Leveling of Manufacturing Process Schedules Systems and Computers in Japan 26, 68-76 Talbot, F.B (1982): Resource-Constrained Project Scheduling with Time-Resource Tradeoffs: The Nonpreemptive Case Management Science 28, 1197-1210 Talbot, F B and J H Patterson (1978): An Efficient Integer Programming Algorithm with Network Cuts for Solving Resource-Constrained Scheduling Problems Management Science 24,1163-1175 Tavakoli, A (1990): Effective Progress Scheduling and Control for Construction Projects Journal of Management in Engineering 6,87-98 www.Ebook777.com Free ebooks ==> www.Ebook777.com References 361 Tavakoli, A and R Riachi (1990): CPM Use in ENR Top 400 Contractors Journal of Management in Engineering 6, 282-295 Tavares, L V (1986): Multicriteria Scheduling of a Railway Renewal Program European Journal of Operational Research 25, 395-405 Taylor, B.W.; LJ Moore, and E.R Clayton (1982): R&D Project Selection and Manpower Allocation with Integer Nonlinear Goal Programmming Management Science 28, 1149-1158 Thamhain, H.J (1993): Effective Leadership for Building Project Teams, Motivating People, and Creating Optimal Organizational Structures In: Dinsmore, P.C (Ed.): The AMA Handbook of Project Management Amacom, New York, 248-258 Thesen, A (1976): Heuristic Scheduling of Activities under Resource and Precedence Restrictions Management Science 23, 412-422 Thesen, A (1977): Measures of Restrictiveness of Project Networks Networks 7, 193208 Thomas, W (1969): Four Float Measures for Critical Path Scheduling Journal of Industrial Engineering 1, Issue 10, 19-23 Thomas, P.R and S Salhi (1997): An Investigation into the Relationship of Heuristic Performance with Network-Resource Characteristics Journal of the Operational Research Society 48, 34-43 Thomas, P.R and S Salhi (1998): A Tabu Search Approach for the Resource Constrained Project Scheduling Problem Journal of Heuristics 4, 123-139 Thomasen, O.B and L Butterfield (1993): Combining Risk Management and Resource Optimization in Project Management Software Cost Engineering 35, Issue 8, 19-24 Tsai, Y W and D.O Gemmill (1998): Using Tabu Search to Schedule Activities of Stochastic Resource-Constrained Projects European Journal of Operational Research Ill, 129-141 Tsubakitani, S and R.F Deckro (1990): A Heuristic for Multi-Project Scheduling with Limited Resources in the Housing Industry European Journal of Operational Research 49,80-91 U lusoy, G and L Ozdamar (1989): Heuristic Performance and Network/Resource Characteristics in Resource-Constrained Project Scheduling Journal of the Operational Research Society 40, 1145-1152 Ulusoy, G and L Ozdamar (1994): A Constraint-Based Perspective in Resource-Constrained Project Scheduling International Journal of Production Research 32, 693705 Ulusoy, G and L Ozdamar (1995): A Heuristic Scheduling Algorithm for Improving the Duration and Net Present Value of a Project International Journal of Operations & Production Management 15,89-98 www.Ebook777.com Free ebooks ==> www.Ebook777.com 362 References Valadares Tavares, L.; lA Antunes Ferreira, and J Silva Coelho (1998): On the Optimal Management of Project Risk European Journal of Operational Research 107, 451-469 Van Groenendaal, W.J.H (1998): Estimating NPV Variability for Deterministic Models European Journal of Operational Research 107,202-213 Vercellis, C (1994): Constrained Multi-Project Planning Problems: A Lagrangean Decomposition Approach European Journal of Operational Research 78, 267-275 Vose, D (1996): Quantitative Risk Analysis: A Guide to Monte Carlo Simulation Modeling Wiley, Chichester VoH, S (1993): Intelligent Search Manuscript, TH Darmstadt VoH, S (1995): Solving Quadratic Assignment Problems Using the Reverse Elimination Method In: Nash, S.G and S Sofer (Eds.): The Impact of Emerging Technologies on Computer Science and Operations Research Kluwer, Dordrecht, 281-296 Wasil, E.A and A.A Assad (1988): Project Management on the PC: Software, Applications and Trends Interfaces 18,75-84 Watts, K.M and J.C Higgins (1987): The Use of Advanced Management Techniques in R&D Omega 15,21-29 Weglarz, J (1981): Project Scheduling with Continuously Divisible, Doubly-Constrained Resources Management Science 27, 1040-1053 Weglarz, J (1989): Project Scheduling under Continuous Processing Speed vs Resource Amount Activity Models In: Slowinski, R and l Weglarz (Eds.): Advances in Project Scheduling, Elsevier, Amsterdam, 273-295 Weglarz, J.; J Blazewicz, W Cellary, and R Slowinski (1977): ALGORITHM 520: An Automatic Revised Simplex Method for Constrained Resource Network Scheduling ACM Transactions on Mathematical Software 3, 295-300 Weiss, E.N (1988): An Optimization Based Heuristic for Scheduling Parallel Project Networks with Constrained Renewable Resources liE Transactions 20, Issue 2, 137143 Wheelwright, S.C and S Makridakis (1985): Forecasting Methods for Management 4th Ed., Wiley, Chichester Whitehouse, G.E and J.R Brown (1979): GENRES: An Extension of Brooks Algorithm for Project Scheduling with Resource Constraints Computers and Industrial Engineering 3, 261-268 Wiest, J.D (1964): Some Properties of Schedules for Large Projects with Limited Resources Operations Research 12, 395-418 Wiest, J.D (1967): A Heuristic Model for Scheduling Large Projects with Limited Resources Management Science 13,359-377 Wiest, J.D (1981): Precedence Diagramming Method: Some Unusual Characteristics and their Implications for Project Managers Journal of Operations Management 1, 121130 www.Ebook777.com Free ebooks ==> www.Ebook777.com References 363 Wiest, J.D and F.K Levy (1977): A Management Guide to PERT/CPM 2nd Ed., Prentice Hall, Englewood Cliffs Wildausky, A.B (1986): Budgeting: A Comparative Theory of Budgetary Processes Transaction Books, New Brunswick Williams, G.S (1978): Resource Scheduling for Project Control Power Engineering, Issue 4, 66-69 Williams, T (1995 a): A Classified Bibliography of Recent Research Relating to Project Risk Management European Journal of Operational Research 85, 18-38 Williams, T (1995 b): What are PERT Estimates? Journal of the Operational Research Society 46, 1498-1504 Willis, R.J (1981): A Note on the Generation of Project Network Diagrams Journal of the Operational Research Society 32, 235-238 Willis, R.J (1982): The Definition of Float in Resource-Constrained Project Schedules Bulletin of the Australian Society of Operational Research I, Issue 2,5-7 Willis, R.J (1985): Critical Path Analysis and Resource Constrained Project Scheduling - Theory and Practice European Journal of Operational Research 23, 149-155 Woodruff, D.L and E Zemel (1993): Hashing Vectors for Tabu Search Annals ofOperations Research 41, 123-128 Woodworth, B.M (1993): A Statistical Evaluation of the Impact of Limited Resources on Project Scheduling Cost Engineering 35, Issue 2, 25-32 Woodworth, B.M and S Shanahan (1988): Identifying the Critical Sequence in a Resource Constrained Project Project Management 6, 90-96 Woodworth, B.M and Ch.J Willie (1975): A Heuristic Algorithm for Resource Leveling in Multi-Project, Multi-Resource Scheduling Decision Sciences 6, 525-540 Yang, K.-K and C.-C Sum (1993): A Comparison of Resource Allocation and Activity Scheduling Rules in a Dynamic Multi-Project Environment Journal of Operations Management 11,207-218 Yang, K.-K.; F.B Talbot, and J.H Patterson (1993 a): Scheduling a Project to Maximize its Net Present Value: An Integer Programming Approach European Journal ofOperational Research 64, 188-198 Yang, K.-K.; L.C Tay, and C.c Sum (1995): A Comparison of Stochastic Priority Rules for Maximizing Project Net Present Value European Journal of Operational Research 85, 327-339 Yang, T.; J.P Ingnizio, and J Song (1989): An Exchange Heuristic Algorithm for Project Scheduling with Limited Resources Engineering Optimization 14, 189-205 Yang, T.; J.P Ingnizio, J Yoo, and D Santos (1993 b): A Modified Exchange Heuristic for Resource-Constrained Scheduling Engineering Optimization 20, 303-321 Yau, C and E Ritchie (1988): A Linear Model Estimating Project Resource Levels and Target Completion Times Journal ofthe Operational Research Society 39, 855-862 www.Ebook777.com Free ebooks ==> www.Ebook777.com 364 References Yau, C and E Ritchie (1990): Project Compression: A Method for Speeding Up Resource Constrained Projects Which Preserves the Activity Schedule European Journal of Operational Research 49, 140-1S2 Yoo, J.; T Yang, and J.P Ingnizio (199S): An Exchange Heuristic for Resource Constrained Scheduling with Consideration Given to Opportunities for Parallel Processing Production Planning and Control 6, 140-1S0 Younis, M.A and B Saad (1996): Optimal Resource Leveling of Multi-Resource Projects Computers and Industrial Engineering 31, 1-4 Zamani, R and L.- Y Shue (1998): Solving Project Scheduling Problems with a Heuristic Learning Algorithm Journal ofthe Operational Research Society 49,709-716 Zhan, J (1992): Calendarization of Time Planning in MPM Networks Zeitschrift fUr Operations Research 36, 423-438 Zhan, J (1994): Heuristics for Scheduling Resource-Constrained Projects in MPM Networks European Journal of Operational Research 76, 192-20S Ziegler, H (198S): Minimal and Maximal Floats in Project Networks Engineering Costs and Production Economics 9, 91-97 Zimmermann, J (1997): Heuristics for Resource-Levelling Problems in Project Scheduling with Minimum and Maximum Time Lags Technical Report WIOR 491, University of Karlsruhe Zimmermann, J and H Engelhardt (1998): Lower Bounds and Exact Methods for Resource-Levelling Problems Technical Report WIOR S17, University of Karlsruhe www.Ebook777.com Free ebooks ==> www.Ebook777.com Index A additive bounding 137 algorithm 92 evolutionary 190, 210 exponential time 94 genetic 210 polynomial time 93 ant system 191 ascent method 133 aspiration criterion 197 global, local 197 aspiration-by-default 197, 207 attribute 194 complementary 194 B backward pass 24, 44, 78, 115 modified 91, 141, 176 bound argument (see lower bound) lower (see lower bound) upper 78, 218, 219 bounding 218, 226 branch 215 branch and bound 214 scattered 240 branching 215 branching scheme 215 delaying alternatives 256 parallel 222, 226, 253 schedule scheme 258 serial 254 break-off rule dynamic 246, 250 static 246 budgeting 19, 68 c candidate list global 217 local 216 strategy 196,202 completion phase 65 complexity index 265 measure 263 theory 92 conceptual phase 3, 5, 64 configuration management 18, 28 control 27, 55, 69 cost 28, 60 policy 56 schedule 28, 56 core time 145, 228 cost estimation 10 CPM (critical path method) 24, 43, 66 crashing 21 critical path analysis (see CPM) cut solution 243 dynamic generation 244 static generation 244, 248 cutting planes 130 cycling 193 D decision point 171, 222 smallest possible 225 decision problem 94 decision support system 14, 109 definition phase 3,15,65 destructive improvement 136, 141, 159 dissolution 31 diversification 198, 207, 246, 251 dominance rule 220, 241 active schedule 230 extended schedule storing 235 semi-active schedule 229 simple schedule storing 235 storing 221, 232, 256, 257 supersession 231 transformation 220, 229, 231 due date 90, 204 www.Ebook777.com Free ebooks ==> www.Ebook777.com 366 Index E early starting time approach 49 earned value analysis 28, 61, 70 economic analysis enumeration (see branching) evaluation 30 event 41 execution phase 4, 26, 68 F feasibility study financial appraisal methods finishing time earliest, latest 43, 78 scheduled 163 float (see slack time) follower (see successor) forecasting 7, 30 forward pass 24, 44, 78, 114 modified 91, 141, 164,222 G Gantt chart 24, 49, 66, 69 capacity-oriented 52 extensions 49 progress 56, 70 GERT (graphical evaluation and review technique) 11 GRCPSP (generalized resource-constrained project scheduling problem) 67, 89 H hashing function 205 head 124, 157 heuristic 161 adaptive sampling 189 biased random sampling 189 constructive 16 I mUlti-pass priority-rule based 187 multi-planning directions 188 multi-priority rule 188 priority-rule based 167 regret based biased random sampling 189 sampling 188 steepest descent 192 steepest descent I mildest ascent 193 I improvement method 161, 190 incompatible pair 76 partially 153 instance 93 intensification 197,25 I J job 23, 34 active 164 available 164 backward available 176 backward eligible 177 critical 46 dummy 38, 42 duration 37, 75 eligible 79,164,222 Hammock 69 list 200 state preserving 100 L Lagrangean multiplier 132 relaxation 132, 137 left shift global 165, 230 local 165, 230 linear responsibility chart 23, 66, 68 local lower bound method (LLBM) 216, 224 lower bound bin packing (LBBl, LBB2) 118 capacity (LBC2) 115, 148, 152, 227 constructive I 14 critical path (LBCl) 114, 152,222 critical sequence (LBC3) 116, 152 extended node packing (LBN2) 122, 156 generalized node packing (LBN3) 123, 156 global 216 local 216, 218, 224 www.Ebook777.com Free ebooks ==> www.Ebook777.com Index node packing (LBNl) 121, 148, 153 one-machine (LBM2) 126, 157, 227 parallel-machine (LBMl) 125, 157 precedence (LBPl, LBP2) 128, 158 simple 114, 150 two-machine (LBM3) 127, 158,227 lower bound argument (see lower bound) lower bound method (see lower bound) LP-relaxation 130, 134 M make-to-order production 77 maximum time lag 41, 99, 136 memory explicit 195, 205 frequency based 197,246 recency based 194, 206 meta-heuristic 190 method cancellation sequence 195 reverse elimination 196 milestone 17 plan 18, 20 planning 17, 34 minimum time lag 40,75,91 finish-to-finish 40 finish-to-start 40, 141 start-to-finish 40 start-to-start 40, 149 monitoring 19, 27, 69 move 191, 201 admissible 193 backward shift 20 I diversifYing 207 forward shift 201 swap 201 tabu active 193, 194, 206 MPM (metra-potential method) 41, 99 multiple modes 96 multi-project planning 70 N neighbor 191 neighborhood 191, 198 367 net present value 9, 21, 106 network activity-on-arc 18,23,41 activity-on-node 23, 37,66, 75 complexity 265 finish-to-start 75, 77 start-to-start 75, 90 neural network 191 node ancestor 215 descending 215 leaf215 root 215 NP-complete problem 94 NP-hard problem 95 in the strong sense 95 o objective function regular 166 optimization problem 94 order of a function 93 organizational breakdown structure 23, 28, 66,68 p path 75 critical 45, 114 length 75 PDM (precedence diagramming method) 40,90 period 37, 78 PERT (program evaluation and review technique) 11 phase model 4, 17 planning backward 175 bidirectional 178 planning phase 3, 22, 65 precedence relationship 23, 37 direct, immediate 38, 75 finish-to-finish 40, 91 finish-to-start 37, 75, 91 indirect, transitive 76 www.Ebook777.com Free ebooks ==> www.Ebook777.com 368 Index redundant 39, 76 start-to-finish 40, 91 start-to-start 40, 75, 91 predecessor 38, 75 preemption 96 priority rule 181 composite 181, 184 critical path based 181, 183 dynamic 181 network based 181,183 regret based 183, 185 resource based 181, 184 static 181 problem 93 bin packing 117,225 complexity 92 flow shop scheduling 77 job shop scheduling 77, 95, 117, 165 multi-period knapsack 14 net present value 21, 106 resource investment 105 resource leveling lO4 restricted 137 set covering 134 simple assembly line balancing 90, 225 time-constrained project scheduling 103 time-cost trade-off 21 type 93 weighted tardiness 108 weighted-node packing 120 process organization 17 product life cycle PROGRESS 221 progress plot 57 project calendar 66 control (see control) life cycle management software 63, 167 manager 17 network (see network) organization 16 planning 22, 33 selection 12 specification 15 stakeholder 4, 17 team 17 project scheduling 43, 66 resource-constrained 26, 52 time-constrained 26, 54, 103 Q quality management 18, 29 R Repsp (resource-constrained project scheduling problem) 53,77 reduction by core times 144, 160 by forward and backward pass 141, 159 by precedence 143, 160 by subprojects 141, 160 reduction rule 219, 228 core time 228 reduction technique 138, 141, 159 region 244 swapping 245, 249 release date 90, 204 reporting 19,27,68 resource allocation 24, 50, 67 availability profile 150 compatible set 87 conflict 25, 50, 79 constraints 24, 50, 77 factor 265 incompatible set 76, 86 leveling 26 loading 50 loading profile 25, 51, 67 residual availability 165 strength 266 usage 75 resource type 67 doubly-constrained 25, 97 non-renewable 25, 97 partially renewable 102 renewable 25, 50, 75, 77, 97 RETAPS 198 risk analysis 10 www.Ebook777.com Free ebooks ==> www.Ebook777.com Index s sample size 188 sampling (see heuristic) SCATTER 247 schedule 49 active 166, 170, 230 baseline 49 complete 163 feasible 163 non-delay 166, 172, 180 partial 164 semi-active 166, 229 schedule scheme 208, 258 scheduling scheme 169 backward parallel 177 backward serial 176 bidirectional parallel 180 bidirectional serial 178 parallel (PSS) 171, 222 serial (SSS) 169,200 search depth-first (DFS) 216 depth-first with complete branching (DFSB) 216 laser (DFSL) 216 minimal-lower-bound (MLB) 217 minimal-lower-bound with immediate branching (MLBI) 217 search trajectory 192, 205 selection rule dynamic 246, 249 static 246 simulated annealing 209 simulation 11 sink 75 slack time 46 free 46 independent 47 safety 47 total 46, 49, 249 solution representation 200 space 191,243 source 75 369 starting time earliest, latest 43, 78 scheduled 163 statement of work 15,36 structuring 22, 34, 65 subproblem 215 subtree swapping 245, 249 successor 38, 75 T tabu list 194 management 194, 205 tenure 194 tenure variation 196, 206 tabu search 191,208,242 reactive 197, 206 tail 124, 157 start 225 target analysis 240 termination phase 4, 30 time complexity function 93 time point 78 time window 44, 78, 90 topological ordering 43, 75 transitive closure 76 tree enumeration 215 minimal enumeration 240, 242 reference 247 trend analysis 59, 70 w work breakdown structure 20, 22 28 34 65,68 ' , , work package 23, 34 www.Ebook777.com ... function UB upper bound on the value of an objective function RCPSP resource- constrained project scheduling problem GRCPSP generalized resource- constrained project scheduling problem cf confer p page... Tardiness Problem 3.4.6 Further Resource- Constrained Project Scheduling Problems 102 103 104 105 106 108 108 Part II Resource- Constrained Project Scheduling: Solution Methods Lower Bound... Notations for Resource- Constrained Project Scheduling n number of jobs J set of all jobs; J = {I, ,n} j index for the jobs; j = 1, , n d duration of job j in periods rdj release date of job j dd·