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.
Le informazioni nella sezione "Riassunto" possono far riferimento a edizioni diverse di questo titolo.
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.
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.
Le informazioni nella sezione "Su questo libro" possono far riferimento a edizioni diverse di questo titolo.
EUR 17,05 per la spedizione da U.S.A. a Italia
Destinazione, tempi e costiEUR 10,38 per la spedizione da Regno Unito a Italia
Destinazione, tempi e costiDa: New Book Sale, London, Regno Unito
Hardcover. Condizione: New. Usually Dispatched within 1-2 Business Days , Buy with confidence , excellent customer service. Codice articolo 1848210345--A29
Quantità: 1 disponibili
Da: GreatBookPrices, Columbia, MD, U.S.A.
Condizione: New. Codice articolo 5510716-n
Quantità: Più di 20 disponibili
Da: GreatBookPrices, Columbia, MD, U.S.A.
Condizione: As New. Unread book in perfect condition. Codice articolo 5510716
Quantità: Più di 20 disponibili
Da: GreatBookPricesUK, Woodford Green, Regno Unito
Condizione: As New. Unread book in perfect condition. Codice articolo 5510716
Quantità: Più di 20 disponibili
Da: INDOO, Avenel, NJ, U.S.A.
Condizione: New. Brand New. Codice articolo 9781848210349
Quantità: Più di 20 disponibili
Da: moluna, Greven, Germania
Gebunden. Condizione: New. Resource-Constrained Project Scheduling 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 const. Codice articolo 597090960
Quantità: Più di 20 disponibili
Da: Kennys Bookshop and Art Galleries Ltd., Galway, GY, Irlanda
Condizione: New. Resource-Constrained Project Scheduling 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. Editor(s): Artigues, Christian; Demassey, Sophie; Neron, Emmanuel. Series: ISTE. Num Pages: 288 pages, Illustrations. BIC Classification: KJMV5. Category: (UP) Postgraduate, Research & Scholarly. Dimension: 238 x 164 x 22. Weight in Grams: 612. . 2008. 1st Edition. Hardcover. . . . . Codice articolo V9781848210349
Quantità: 15 disponibili
Da: GreatBookPricesUK, Woodford Green, Regno Unito
Condizione: New. Codice articolo 5510716-n
Quantità: Più di 20 disponibili
Da: Ubiquity Trade, Miami, FL, U.S.A.
Condizione: New. Brand new! Please provide a physical shipping address. Codice articolo 9781848210349
Quantità: Più di 20 disponibili
Da: Grand Eagle Retail, Mason, OH, U.S.A.
Hardcover. Condizione: new. Hardcover. 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. Resource-Constrained Project Scheduling 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. Shipping may be from multiple locations in the US or from the UK, depending on stock availability. Codice articolo 9781848210349
Quantità: 1 disponibili