This book deals with dynamic and stochastic methods for multi-project planning. Based on the idea of using queueing networks for the analysis of dynamic-stochastic multi-project environments this book addresses two problems: detailed scheduling of project activities, and integrated order...

Network optimization is important in the modeling of problems and processes from such fields as engineering, computer science, operations research, transportation, telecommunication, decision support systems, manufacturing, and airline scheduling. Recent advances in data structures, computer...

Summary of Assumptions -- 1 Basic Concepts -- 1.1 Directed Graphs and Activity Networks -- 1.2 GERT Networks -- 1.3 Assumptions Required for GERT Networks -- 1.4 Evaluation of GERT Networks -- 1.5 Subnetworks of GERT Networks -- 2 STEOR Networks -- 2.1 Stochastic Processes Connected with STEOR...

The subject of the book is project scheduling under resource-constraints. Several well-known scheduling problems, like e.g. the job-shop-scheduling and the assembly line balancing problem, are embedded in the mathematical programming formulation used. Exact solution procedures for a broad class...

Approaches to project scheduling under resource constraints are discussed in this book. After an overview of different models, it deals with exact and heuristic scheduling algorithms. The focus is on the development of new algorithms. Computational experiments demonstrate the efficiency of the...

This book 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 modelled by GERT networks. These projects are characterized by a stochastic evolution structure and possible feedback. The...

The monograph deals with deterministic project scheduling with time windows for activities and with limited resources. In addition to project duration or makespan, a large number of mostly nonregular objective functions are considered, for example, net present value, earliness plus tardiness...

Network flow and matching are often treated separately in the literature and for each class a variety of different algorithms has been developed. These algorithms are usually classified as primal, dual, primal-dual etc. The question the author addresses in this work is that of the existence of a...