Stochastic project networks. Temporal analysis, scheduling and cost minimization (Q1202111)

To deal with projects that cannot be treated within the framework of ``classical'' project networks, namely stochastic project networks, also called GERT networks, is an important task. This monograph presents the state-of-the-art of temporal analysis and cost minimization of projects, as well as project planning under limited resources where the projects are modeled by GERT networks. The book focuses on analytical networks only and does not contain any applications. This book, in general, will be useful to readers who are interested in stochastic models in operations research and in particular to graduate students and researchers in project planning and scheduling, machine scheduling and stochastic networks. The chapter headings are: (1) Basic Concepts, (2) Temporal Analysis of GERT Networks, (3) STEOR Networks and EOR Networks, (4) Reducible GERT Networks, (5) Scheduling with GERT Precedence Constraints, (6) Cost Minimization for STEOR and TEOR Networks, (7) Cost and Time Minimization for Decision Project Networks, (8) References. Chapter 1 is introductory in nature and summarizes the most important concepts from the theory of graphs and project networks. After defining GERT networks, some basic assumptions and results are stated. Chapter 2 contains the basic concepts and results from the temporal analysis of GERT networks and mentions some methods for evaluating admissible GERT networks. Chapter 3 discusses GERT networks all of whose nodes have exclusive-or entrance (EOR networks), which can be associated with Markov renewal processes. Results from the Markov renewal processes are used for their evaluation. Chapter 4 focuses in GERT networks that may contain all kinds of GERT nodes and can be reduced to EOR networks. Chapter 5 studies single-machine scheduling problems with precedence constraints given by a GERT network. In addition single-machine min-sum scheduling problems with general GERT precedence constraints are solved by dynamic programming. Polynomial algorithms are also presented for scheduling problems with EOR precedence constraints, where the weighted expected flow-time or maximum expected lateness are to be minimized. Chapter 6 discusses a general cost minimization problem for STEOR networks with time-dependent execution probabilities and duration of activities with several types of cost. This is solved by a dynamic programming approach. Chapter 7 deals with cost and time minimization of decision project networks, with stochastic evaluation structure. By exploiting an optimality equation, a cost-minimal policy is determined by the policy iteration technique in a finite number of stages. This monograph assumes a knowledge of elements of mathematical programming, probability theory and Markov chains. Otherwise, it is self- contained. Proofs of some theorems are omitted if they are not of sufficient intrinsic interest or can be found in the literature. The presentation is clear and the printing and the get-up are excellent.