{"text_format":"2","workbook":"xls","n_sheets":1,"sheets":["report2"],"not_rendered":{"charts":0,"images":0,"macros":0,"external_links":1,"defined_names":2,"comments":0,"pivot_tables":0},"unopened":[],"bounds":{"document_bytes":16777216,"sheet_cells":100000,"run_cost":"one","rows_first":2000,"rows_last":500,"rows_between":2000,"halvings":0,"cell_chars":16384,"cell_head_chars":4096},"cells_cut":0,"cells_raw":0,"read":"whole","date_system":"1900","formulas":"cached_only"}

{"sheet":"report2","index":0,"n_rows":37,"n_cols":5,"rows_kept":37,"cut":false,"hidden":false,"merged":[[0,2,0,3],[0,4,0,5],[1,2,1,3],[1,4,1,5],[2,2,2,3],[2,4,2,5],[3,2,3,3],[4,2,4,3],[5,2,5,3],[6,2,6,3],[7,2,7,3],[8,2,8,3],[10,2,10,3],[10,4,10,5],[11,2,11,3],[11,4,11,5],[12,2,12,3],[14,2,14,3],[18,2,18,3],[19,2,19,3],[20,2,20,3],[22,2,22,3],[24,2,24,3],[25,2,25,3],[29,2,29,3]],"flags":["formulas_cached_only"]}
[null,"1.","Record Nr.",null,"UNINA990001225220403321"]
[null,null,"Autore",null,"Gemignani, Michael C."]
[null,null,"Titolo",null,"Finite probability / Michael C. Gemignani"]
[null,null,"Pubbl/distr/stampa",null,"Reading [MA] [etc.] : Addison-Wesley, c1970"]
[null,null,"Disciplina",null,"519.2"]
[null,null,"Locazione",null,"MA1"]
[null,null,"Collocazione",null,"9-F-20"]
[null,null,"Lingua di pubblicazione",null,"Inglese"]
[null,null,"Formato",null,"Materiale a stampa"]
[null,null,null,"Livello bibliografico","Monografia"]
[null,"2.","Record Nr.",null,"UNINA9910829972903321"]
[null,null,"Titolo",null,"Resource-constrained project scheduling [[electronic resource] ] : models, algorithms, extensions and applications / / edited by Christian Artigues, Sophie Demassey, Emmanuel Neron"]
[null,null,"Pubbl/distr/stampa",null,"London, : ISTE"]
[{"$nulls":4},"Hoboken, NJ, : John Wiley & Sons, 2008"]
[null,null,"ISBN",null,"1-282-16508-9"]
[{"$nulls":4},"9786612165085"]
[{"$nulls":4},"0-470-61122-7"]
[{"$nulls":4},"0-470-39384-X"]
[null,null,"Descrizione fisica",null,"1 online resource (310 p.)"]
[null,null,"Collana",null,"ISTE ; ; v.37"]
[null,null,"Disciplina",null,"658.5/3"]
[{"$nulls":4},"658.53"]
[null,null,"Soggetti",null,"Production scheduling"]
[{"$nulls":4},"Scheduling"]
[null,null,"Lingua di pubblicazione",null,"Inglese"]
[null,null,"Formato",null,"Materiale a stampa"]
[null,null,null,"Livello bibliografico","Monografia"]
[null,null,null,"Note generali","Description based upon print version of record."]
[null,null,null,"Nota di bibliografia","Includes bibliographical references and index."]
[null,null,"Nota di contenuto",null,"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"]
[{"$nulls":4},"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; 3.1. Sequence-based models; 3.1.1. Minimal forbidden sets; 3.1.2. Resource flow; 3.2. Time-indexed formulations; 3.2.1. Resource conflicts as linear constraints"]
[{"$nulls":4},"3.2.2. Feasible configurations3.2.2.1. Combinatorial relaxations; "]
[{"$nulls":4},"3.2.2.2. Column generation and further improvements; 3.2.2.3. Cutting planes for the preemptive relaxation; 3.3. Linear lower bounds and redundant resources; Chapter 4. Constraint Programming Formulations and Propagation Algorithms; 4.1. Constraint formulations; 4.1.1. Constraint programming; 4.1.2. Constraint-based scheduling; 4.2. Constraint propagation algorithms; 4.2.1. Temporal constraints; 4.2.2. Timetabling; 4.2.3. Disjunctive reasoning; 4.2.4. Edge-finding; 4.2.5. Energy reasoning; 4.2.6. Precedence graph"]
[{"$nulls":4},"4.2.7. Energy precedence4.2.8. Balance constraint; 4.3. Conclusion; Chapter 5. Branching Schemes for Branch-and-Bound; 5.1. Chronological branching scheme; 5.1.1. Adding one activity to a partial solution; 5.1.1.1. Considering all relevant activities; 5.1.1.2. Delaying one activity; 5.1.2. Dominance rule: left shift and global left shift; 5.1.3. Adding a subset of activities to a partial solution; 5.1.3.1. Delaying alternatives; 5.1.3.2. Building a solution using blocks; 5.1.4. Dominance rule: cut-set; 5.2. Specific branching schemes; 5.2.1. Fixing disjunction and parallel relationship"]
[{"$nulls":4},"5.2.2. Reducing time-windows of activities5.2.3. Resolving forbidden sets; 5.3. Conclusion and perspectives; Chapter 6. Heuristics; 6.1. Schedule representation schemes; 6.1.1. Natural date variables; 6.1.2. List schedule generation scheme representations; 6.1.3. Set-based representations; 6.1.4. Resource flow network representation; 6.2. Constructive heuristics; 6.2.1. Standard list schedule generation scheme heuristics; 6.2.2. A generic insertion-based list schedule generation scheme; 6.2.3. Set schedule generation scheme heuristics; 6.2.4. (Double-)justification-based methods"]
[{"$nulls":4},"6.3. Local search neighborhoods"]
[null,null,null,"Sommario/riassunto","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 surv"]