|
|
|
|
|
|
|
|
1. |
Record Nr. |
UNINA9910876988103321 |
|
|
Titolo |
Resource-constrained project scheduling : models, algorithms, extensions and applications / / edited by Christian Artigues, Sophie Demassey, Emmanuel Neron |
|
|
|
|
|
|
|
Pubbl/distr/stampa |
|
|
London, : ISTE |
|
Hoboken, NJ, : John Wiley & Sons, 2008 |
|
|
|
|
|
|
|
|
|
ISBN |
|
1-282-16508-9 |
9786612165085 |
0-470-61122-7 |
0-470-39384-X |
|
|
|
|
|
|
|
|
Descrizione fisica |
|
1 online resource (310 p.) |
|
|
|
|
|
|
Collana |
|
|
|
|
|
|
Altri autori (Persone) |
|
DemasseySophie |
NeronEmmanuel |
ArtiguesChristian |
|
|
|
|
|
|
|
|
Disciplina |
|
|
|
|
|
|
Soggetti |
|
Production scheduling |
Scheduling |
|
|
|
|
|
|
|
|
Lingua di pubblicazione |
|
|
|
|
|
|
Formato |
Materiale a stampa |
|
|
|
|
|
Livello bibliografico |
Monografia |
|
|
|
|
|
Note generali |
|
Description based upon print version of record. |
|
|
|
|
|
|
Nota di bibliografia |
|
Includes bibliographical references and index. |
|
|
|
|
|
|
Nota di contenuto |
|
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; 1.1. A combinatorial optimization problem; 1.2. A simple resource-constrained project example; 1.3. Computational complexity; 1.4. Dominant and non-dominant schedule subsets; 1.5. Order-based representation of schedules and related dominant schedule sets; 1.6. Forbidden sets and resource flow network formulations of the RCPSP |
1.7. A simple method for enumerating a dominant set of quasi-active schedulesChapter 2. Resource and Precedence Constraint Relaxation; 2.1. Relaxing resource constraints; 2.2. Calculating the disjunctive subproblem; 2.3. Deducing identical parallel machine problems; 2.4. Single cumulative resource problem; 2.5. Conclusion and perspectives; Chapter 3. Mathematical Programming Formulations and Lower Bounds; |
|
|
|
|