Project Scheduling Under Limited Resources: Models, Methods, and Applications

ISBN-13: 9783540663928 / Angielski / Miękka / 1999 / 221 str.

Sonke Hartmann; S. Hartmann; Sc6nke Hartmann

Opis

After an overview of different models of project scheduling, this work deals with exact and heuristic scheduling algorithms and the development of new algorithms. Finally, it shows how the models and methods can be applied to projects in research and development as well as market research.

Spis treści

Introduction.- Project Scheduling Models.- Basic Model: The RCPSP.- Variants and Extensions.- Relations to Packing and Cutting Problems.- Exact Multi-Mode Algorithms.- Enumeration Schemes.- Bounding Rules.- Theoretical Comparison of Schedule Enumeration.- Computational Results.- Classification of Single-Mode Heuristics.- Schedule Generation Schemes.- Priority Rule Based Heuristics.- Metaheuristic Approaches.- Other Heuristics.- Single-Mode Genetic Algorithms.- Evolution and Optimization.- Activity List Based Genetic Algorithm.- Random Key Based Genetic Algorithm.- Priority Rule Based Genetic Algorithm.- Computational Results.- Extending the Genetic Algorithm.- Evaluation of Single-Mode Heuristics.- Test Design.- Computational Results.- Multi-Mode Genetic Algorithm.- Components of the Genetic Algorithm.- Improving Schedules by Local Search.- Computational Results.- Case Studies.- Scheduling Medical Research Experiments.- Selecting Market Research Interviewers.- Conclusions.