Resource-constrained project scheduling models, algorithms, extensions and applications /
This title presents a large variety of models and algorithms dedicated to the resource-constrained project scheduling problem (RCPSP), which aims at scheduling at minimal duration a set of activities subject to precedence constraints and limited resource availabilities. In the first part, the standa...
Saved in:
Group Author: | ; ; |
---|---|
Published: |
|
Literature type: | Electronic eBook |
Language: | English |
Series: |
Control systems, robotics and manufacturing series
|
Subjects: | |
Online Access: |
http://onlinelibrary.wiley.com/book/10.1002/9780470611227 |
Summary: |
This title presents a large variety of models and algorithms dedicated to the resource-constrained project scheduling problem (RCPSP), which aims at scheduling at minimal duration a set of activities subject to precedence constraints and limited resource availabilities. In the first part, the standard variant of RCPSP is presented and analyzed as a combinatorial optimization problem. Constraint programming and integer linear programming formulations are given. Relaxations based on these formulations and also on related scheduling problems are presented. Exact methods and heuristics are surve |
Carrier Form: | 1 online resource (308 pages) : illustrations. |
Bibliography: | Includes bibliographical references (pages 279-301) and index. |
ISBN: |
9780470393840 (electronic bk.) 047039384X (electronic bk.) 9780470611227 0470611227 1848210345 9781848210349 |
Index Number: | TS157 |
CLC: | F406.2 |
Contents: | Resource-Constrained Project Scheduling; Table of Contents; Preface; Part 1. Models and Algorithms for the Standard Resource-Constrained Project Scheduling Problem; Chapter 1. The Resource-Constrained Project Scheduling Problem; Chapter 2. Resource and Precedence Constraint Relaxation; Chapter 3. Mathematical Programming Formulations and Lower Bounds; Chapter 4. Constraint Programming Formulations and Propagation Algorithms; Chapter 5. Branching Schemes for Branch-and-Bound; Chapter 6. Heuristics; Chapter 7. Benchmark Instance Indicators and Computational Comparison of Methods; Part 2. Varia |