Project Scheduling

Project scheduling problems are, generally speaking, the problems of allocating scarce resources over time to perform a given set of activities. The resources are nothing other than the arbitrary means which activities complete for. Also the activities can have a variety of interpretations. Thus, project scheduling problems appear in a large spectrum of real-world situations, and, in consequence, they have been intensively studied for almost fourty years. Almost a decade has passed since the multi-author monograph: R. Slowinski, 1. W~glarz (eds. ), Advances in Project Scheduling, Elsevier, 1989, summarizing the state-of-the-art across project scheduling problems, was published. Since then, considerable progress has been made in all directions of modelling and finding solutions to these problems. Thus, the proposal by Professor Frederick S. Hillier to edit a handbook which reports on the recent advances in the field came at an exceptionally good time and motivated me to accept the challenge. Fortunately, almost all leading experts in the field have accepted my invitation and presented their completely new advances often combined with expository surveys. Thanks to them, the handbook stands a good chance of becoming a key reference point on the current state-of-the-art in project scheduling, as well as on new directions in the area. The contents are divided into four parts. The first one, dealing with classical models -exact algorithms, is preceded by a proposition of the classification scheme for scheduling problems.

Texte du rabat

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 ornon-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.

Résumé
`Most papers are of a high quality, and the whole collection contains a very good insight into the state of the art of current research in project scheduling. The book addresses its intended readership of "research workers, specialists and professional people" in project scheduling well and will be a useful and welcome addition to their bookshelves. I also recommend the book to libraries in such fields as production and operations management, applied mathematics, and (quantitatively oriented) business administration.'
Interfaces, 30:6(1999)

Contenu
I Classical Models Classification, Exact Algorithms.- 1. A Classification Scheme for Project Scheduling.- 2. Solving Large-Sized Resource-Constrained Project Scheduling Problems.- 3. Lower Bounds in Different Problem Classes of Project Schedules with Resource Constraints.- 4. Algorithms for Scheduling Projects with Generalized Precedence Relations.- 5. An Exact Solution Procedure for Maximizing the Net Present Value of Cash Flows in A Network.- 6. Solving A Preemptive Project Scheduling Problem With Coloring Techniques.- II Classical Models Heuristics, Benchmark Instances, Software Evolution.- 7. Heuristic Algorithms for the Resource-Constrained Project Scheduling Problem: Classification and Computational Analysis.- 8. A Heuristic Procedure for the Multi-Mode Project Scheduling Problem Based On Benders' Decomposition.- 9. Benchmark Instances for Project Scheduling Problems.- 10. A Survey Of Interval Capacity Consisitency Tests For Time- And Resource-Constrained Scheduling.- 11. The Evolution of Software Quality in Project Scheduling.- III New Models.- 12. Methods for Resource-Constrained Project Scheduling with Regular and Nonregular Objective Functions and Schedule-Dependent Time Windows.- 13. Project Scheduling Under Discrete and Continuous Resources.- 14. Scheduling of Projects With Stochastic Evolution Structure.- 15. Project Scheduling with Stochastic Activity Interruptions.- 16. Fuzzy Multi-Mode Resource-Constrained Project Scheduling with Multiple Objectives.- 17. Knowledge-Based Multiobjective Project Scheduling Problems.- IV Extensions and Applications.- 18. New Modelling Concepts And Their Impact On Resource-Constrained Project Scheduling.- 19. Integrating Quality as A Measure of Performance in Resource-Constrained Project SchedulingProblems.- 20.Cognitive Science and Project Scheduling: More Realistic Representation.- 21. On Payment Scheduling in Client-Contractor Negotiations in Projects: An Overview of the Problem And Research Issues.- 22. Project Management in Audit Staff Scheduling.