Project Scheduling - Recent Models, Algorithms and Applications (Hardcover, 1999 ed.)

The problem of allocating scarce resources over time to perform a given set of activities - that is, project scheduling - appears in the vast spectrum of real-world situations. Over the last forty years project scheduling problems have been carefully studied, resulting in a considerable body of knowledge. Recently, however, the power and ubiquity of the computer has had a pronounced effect on research in project scheduling and project scheduling models. As a result, considerable progress has been made in all directions of modeling and finding solutions to these problems. This volume is a state-of-the-art treatment of Project Scheduling in general and of recent developments in particular. Part I deals with classical models. By classical model' we mean the deterministic problems involving discrete resources only and the evaluation of schedules on the basis of a single criterion. This term covers a wide variety of problems, including (discrete) resource-duration interaction, i.e. multi-mode models. Part 2 deals with heuristic algorithms for these models. It is complemented by chapters treating such important problems as benchmark instances, interval capacity consistency tests, and the evolution of software quality for (classical) project scheduling problems. In Part 3 the most important new or non-classical' models are considered. These include probabilistic and fuzzy models, and continuous resources as well as multi-criteria formulations and knowledge-based systems. Part 4 contains some important extensions and/or applications of the project scheduling problems considered in the previous chapters.