Resource-Constrained Project Scheduling
Regular price
€189.66
14 days return policy
Shipping & Delivery
activities
algorithms
availabilities
Category=KJMV5
combinatorial optimization
eq_bestseller
eq_business-finance-law
eq_isMigrated=1
eq_isMigrated=2
eq_nobargain
eq_non-fiction
first
formulations
large
linear
models
part
presented
problem
problems
rcpsp
resourceconstrained
set
standard
subject
title
variant
variety
Product details
- ISBN 9781848210349
- Weight: 612g
- Dimensions: 163 x 241mm
- Publication Date: 10 Mar 2008
- Publisher: ISTE Ltd and John Wiley & Sons Inc
- Publication City/Country: GB
- Product Form: Hardback
Secure
checkout
Fast Shipping
Easy returns
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 surveyed. Computational experiments, aiming at providing an empirical insight on the difficulty of the problem, are provided.
The second part of the book focuses on several other variants of the RCPSP and on their solution methods. Each variant takes account of real-life characteristics which are not considered in the standard version, such as possible interruptions of activities, production and consumption of resources, cost-based approaches and uncertainty considerations.
The last part presents industrial case studies where the RCPSP plays a central part. Applications are presented in various domains such as assembly shop and rolling ingots production scheduling, project management in information technology companies and instruction scheduling for VLIW processor architectures.
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 surveyed. Computational experiments, aiming at providing an empirical insight on the difficulty of the problem, are provided.
The second part of the book focuses on several other variants of the RCPSP and on their solution methods. Each variant takes account of real-life characteristics which are not considered in the standard version, such as possible interruptions of activities, production and consumption of resources, cost-based approaches and uncertainty considerations.
The last part presents industrial case studies where the RCPSP plays a central part. Applications are presented in various domains such as assembly shop and rolling ingots production scheduling, project management in information technology companies and instruction scheduling for VLIW processor architectures.
Christian Artigues is a researcher at the Laboratory for Analysis and
Architecture of Systems (LAAS) of the French National Institute for
Scientific Research (CNRS).
Sophie Demassey is an Assistant Professor at the School of Mining Engineering (EMN), Nantes, France.
Emmanuel Néron is Assistant Professor at the Computer Science Department of Polytech'Tours, France, and is a member of the Computer Science Laboratory of the University of Tours, France.
Architecture of Systems (LAAS) of the French National Institute for
Scientific Research (CNRS).
Sophie Demassey is an Assistant Professor at the School of Mining Engineering (EMN), Nantes, France.
Emmanuel Néron is Assistant Professor at the Computer Science Department of Polytech'Tours, France, and is a member of the Computer Science Laboratory of the University of Tours, France.
