{"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":58,"n_cols":5,"rows_kept":58,"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],[4,2,4,3],[9,2,9,3],[10,2,10,3],[11,2,11,3],[13,2,13,3],[16,2,16,3],[17,2,17,3],[21,2,21,3],[29,2,29,3],[29,4,29,5],[30,2,30,3],[30,4,30,5],[31,2,31,3],[32,2,32,3],[35,2,35,3],[36,2,36,3],[37,2,37,3],[38,2,38,3],[39,2,39,3],[50,2,50,3],[51,2,51,3],[55,2,55,3]],"flags":["formulas_cached_only"]}
[null,"1.","Record Nr.",null,"UNINA9910139911503321"]
[null,null,"Titolo",null,"Production scheduling [[electronic resource] /] / edited by Pierre Lopez, Francois Roubellat"]
[null,null,"Pubbl/distr/stampa",null,"London, : ISTE"]
[{"$nulls":4},"Hoboken, NJ, : John Wiley & Sons, 2008"]
[null,null,"ISBN",null,"1-282-16495-3"]
[{"$nulls":4},"9786612164958"]
[{"$nulls":4},"0-470-61105-7"]
[{"$nulls":4},"0-470-39363-7"]
[{"$nulls":4},"1-60119-929-5"]
[null,null,"Descrizione fisica",null,"1 online resource (391 p.)"]
[null,null,"Collana",null,"ISTE ; ; v.20"]
[null,null,"Disciplina",null,"658.5/3"]
[{"$nulls":4},"658.53"]
[null,null,"Soggetti",null,"Production scheduling"]
[{"$nulls":4},"Inventory control"]
[{"$nulls":4},"Electronic books."]
[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","\"First published in France in 2001 by Hermès Science entitled 'Ordonnancement de la production'\" --T.p. verso."]
[null,null,null,"Nota di bibliografia","Includes bibliographical references and index."]
[null,null,"Nota di contenuto",null,"Production Scheduling; Table of Contents; Preface; Chapter 1. Statement of Production Scheduling; Chapter 2. Basic Concepts and Methods in Production Scheduling; 2.1. Introduction; 2.2. Basic scheduling concepts; 2.2.1. Tasks; 2.2.2. Resources; 2.2.3. Modeling; 2.2.4. Resolution methods; 2.2.5. Representation of solutions; 2.3. Project scheduling; 2.3.1. Modeling; 2.3.2 Resolution; 2.4 Shop scheduling; 2.4.1 Introduction; 2.4.2 Basic model; 2.4.3 One-machine problem; 2.4.4 Parallel machine problems; 2.4.5 Flow shop; 2.4.6 Job shop; 2.5 Conclusion; 2.6 Bibliography"]
[{"$nulls":4},"Chapter 3. Metaheuristics and Scheduling3.1. Introduction; 3.2. What is a combinatorial optimization problem?; 3.3. Solution methods for combinatorial optimization problems; 3.4. The different metaheuristic types; 3.4.1. The constructive approach; 3.4.2. Local search approach; 3.4.3. The evolutionary approach; 3.4.4. The hybrid approach; 3.5. An application example: job shop scheduling with tooling constraints; 3.5.1. Traditional job shop modeling; 3.5.2. Comparing both types of problems; 3.5.3. Tool switching; 3.5.4. TOMATO algorithm; 3.6. "]
[{"$nulls":4},"Conclusion; 3.7. Bibliography"]
[{"$nulls":4},"Chapter 4. Genetic Algorithms and Scheduling4.1. Introduction; 4.1.1. Origin of genetic algorithms; 4.1.2. General principles of genetic algorithms; 4.1.3. Schema theorem; 4.1.4. Chapter presentation; 4.2. One-machine problems; 4.2.1. Example 1: total time and setup times; 4.2.2. Example 2: sum of weighted tardiness; 4.2.3. Example 3: sum of weighted tardiness and setup times; 4.3. Job shop problems; 4.4. Hybrid flow shop; 4.4.1. Specific case: one-stage total duration problem; 4.4.2. General case: k stages total duration problem; 4.5. Hybrid genetic algorithms"]
[{"$nulls":4},"4.5.1. Hybridization with other metaheuristics4.5.2. Hybridization with combinatorial optimization methods; 4.6. Conclusion; 4.7. Bibliography; Chapter 5. Constraint Propagation and Scheduling; 5.1. Introduction; 5.1.1. Problem and chapter organization; 5.1.2. Constraint propagation; 5.1.3. Scheduling problem statement; 5.1.4. Notations; 5.2. Time constraint propagation; 5.2.1. Introduction; 5.2.2. Definition; 5.2.3. Simple temporal problems; 5.2.4. General temporal problems; 5.3. Resource constraint propagation; 5.3.1. Characterization of conflicts"]
[{"$nulls":4},"5.3.2. Deductions based on critical sets and MDSs5.3.3. Deductions based on the energetic balance; 5.4. Integration of propagation techniques in search methods; 5.4.1. General improvement techniques of chronological backtracking; 5.4.2. Heuristics for variable and value ordering; 5.4.3. Strategies for applying propagation rules; 5.4.4. Use of a backtracking algorithm; 5.5. Extensions; 5.5.1. Preemptive problems; 5.5.2. Consideration of allocation constraints; 5.6. Conclusion; 5.7. Bibliography; Chapter 6. Simulation Approach; 6.1. Introduction; 6.2. Heuristic resolution (greedy) procedures"]
[{"$nulls":4},"6.2.1. Limits of the basic method"]
[null,null,null,"Sommario/riassunto","The performance of an company depends both on its technological expertise and its managerial and organizational effectiveness. Production management is an important part of the process for manufacturing firms. The organization of production relies in general on the implementation of a certain number of basic functions, among which the scheduling function plays an essential role. This title presents recently developed methods for resolving scheduling issues. The basic concepts and the methods of production scheduling are introduced and advanced techniques are discussed, providing readers with"]
[null,"2.","Record Nr.",null,"UNISA996466226603316"]
[null,null,"Titolo",null,"Abstract State Machines 2004. Advances in Theory and Practice [[electronic resource] ] : 11th International Workshop, ASM 2004, Lutherstadt Wittenberg, Germany, May 24-28, 2004. Proceedings / / edited by Wolf Zimmermann, Bernhard Thalheim"]
[null,null,"Pubbl/distr/stampa",null,"Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2004"]
[null,null,"ISBN",null,"1-280-30768-4"]
[{"$nulls":4},"9786610307685"]
[{"$nulls":4},"3-540-24773-4"]
[null,null,"Edizione",null,"[1st ed. 2004.]"]
[null,null,"Descrizione fisica",null,"1 online resource (XII, 240 p.)"]
[null,null,"Collana",null,"Lecture Notes in Computer Science, , 0302-9743 ; ; 3052"]
[null,null,"Disciplina",null,"511.3"]
[null,null,"Soggetti",null,"Computer logic"]
[{"$nulls":4},"Mathematical logic"]
[{"$nulls":4},"Computers"]
[{"$nulls":4},"Software engineering"]
[{"$nulls":4},"Programming languages (Electronic computers)"]
[{"$nulls":4},"Logics and Meanings of Programs"]
[{"$nulls":4},"Mathematical Logic and Foundations"]
[{"$nulls":4},"Theory of Computation"]
[{"$nulls":4},"Software Engineering"]
[{"$nulls":4},"Mathematical Logic and Formal Languages"]
[{"$nulls":4},"Programming Languages, Compilers, Interpreters"]
[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","Bibliographic Level Mode of Issuance: Monograph"]
[null,null,null,"Nota di bibliografia","Includes bibliographical references at the end of each chapters and index."]
[null,null,"Nota di contenuto",null,"Invited Papers -- Intra-step Interaction -- Closed-Loop Modeling and Related Problems of Embedded Control Systems in Engineering -- An ALGOL-View on Turbo ASM -- An ASM Specification of C# Threads and the .NET Memory Model -- Finite Cursor Machines in Database Query Processing -- Research Papers -- Formalizing Liveness-Enriched Sequence Diagrams Using ASMs -- Specification and Validation of the Business Process Execution Language for Web Services -- Monodic ASMs and Temporal Verification -- Towards an Interchange Language for ASMs -- Specification and Implementation Problems for C# -- An "]
[{"$nulls":4},"ASM Semantics for SSA Intermediate Representations -- Observations on the Decidability of Transitions -- A Security Logic for Abstract State Machines -- Slicing Abstract State Machines -- The Cryptographic Abstract Machine -- Modeling Discretely Timed Systems Using Different Magnitudes of Non-standard Reals."]
[null,null,null,"Sommario/riassunto","Abstract state machines (ASM) sharpen the Church-Turing thesis by the c- sideration of bounded resources for computing devices. They view computations as an evolution of a state. It has been shown that all known models of com- tation can be expressed through speci?c abstract state machines. These models can be given in a representation-independent way. That is one advantage of transferring these models to ASM. The main advantage is, however, to provide a unifying theory to all of these models. At the same time ASM can be re?ned to other ASMs. Stepwise re?nement supports separation of concern during so- ware development and will support component-based construction of systems thus providing a foundation of new computational paradigms such as industrial programming, programming-in-the-large, and programming-in-the-world. ASM 2004 continued the success story of the ASM workshops. Previous workshops were held in the following European cities: Taormina, Italy (2003); Dagstuhl, Germany (2002); Las Palmas de Gran Canaria, Spain (2001); Monte Verita, Switherland (2000); Toulouse, France (1999); Magdeburg, Germany (1998); Cannes, France (1998, 1997); Paderborn, Germany (1996); and H- burg, Germany (1994). The ASM workshops have had predecessors, e.g., the famous Lipari Summer School in 1993, whose in?uential outcome was the f- damental Lipari Guide."]