LEADER 05375nam 2200673Ia 450 001 9910139911503321 005 20170815145735.0 010 $a1-282-16495-3 010 $a9786612164958 010 $a0-470-61105-7 010 $a0-470-39363-7 010 $a1-60119-929-5 035 $a(CKB)1000000000800377 035 $a(EBL)479819 035 $a(OCoLC)593239948 035 $a(SSID)ssj0000072790 035 $a(PQKBManifestationID)11107627 035 $a(PQKBTitleCode)TC0000072790 035 $a(PQKBWorkID)10095084 035 $a(PQKB)10368729 035 $a(MiAaPQ)EBC479819 035 $a(EXLCZ)991000000000800377 100 $a20071022d2008 uy 0 101 0 $aeng 135 $aur|n|---||||| 181 $ctxt 182 $cc 183 $acr 200 10$aProduction scheduling$b[electronic resource] /$fedited by Pierre Lopez, Francois Roubellat 210 $aLondon $cISTE ;$aHoboken, NJ $cJohn Wiley & Sons$d2008 215 $a1 online resource (391 p.) 225 1 $aISTE ;$vv.20 300 $a"First published in France in 2001 by Herme?s Science entitled 'Ordonnancement de la production'" --T.p. verso. 311 $a1-84821-017-5 320 $aIncludes bibliographical references and index. 327 $aProduction 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 327 $aChapter 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. Conclusion; 3.7. Bibliography 327 $aChapter 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 327 $a4.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 327 $a5.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 327 $a6.2.1. Limits of the basic method 330 $aThe 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 410 0$aISTE 606 $aProduction scheduling 606 $aInventory control 608 $aElectronic books. 615 0$aProduction scheduling. 615 0$aInventory control. 676 $a658.5/3 676 $a658.53 701 $aLopez$b Pierre$0955815 701 $aRoubellat$b Franc?ois$0955816 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a9910139911503321 996 $aProduction scheduling$92163479 997 $aUNINA LEADER 05683nam 22008055 450 001 996466226603316 005 20200706115226.0 010 $a1-280-30768-4 010 $a9786610307685 010 $a3-540-24773-4 024 7 $a10.1007/b98118 035 $a(CKB)1000000000212413 035 $a(DE-He213)978-3-540-24773-9 035 $a(SSID)ssj0000096289 035 $a(PQKBManifestationID)11127840 035 $a(PQKBTitleCode)TC0000096289 035 $a(PQKBWorkID)10081562 035 $a(PQKB)10660374 035 $a(MiAaPQ)EBC3088502 035 $a(PPN)155163779 035 $a(EXLCZ)991000000000212413 100 $a20121227d2004 u| 0 101 0 $aeng 135 $aurnn#008mamaa 181 $ctxt$2rdacontent 182 $cc$2rdamedia 183 $acr$2rdacarrier 200 10$aAbstract State Machines 2004. Advances in Theory and Practice$b[electronic resource] $e11th International Workshop, ASM 2004, Lutherstadt Wittenberg, Germany, May 24-28, 2004. Proceedings /$fedited by Wolf Zimmermann, Bernhard Thalheim 205 $a1st ed. 2004. 210 1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d2004. 215 $a1 online resource (XII, 240 p.) 225 1 $aLecture Notes in Computer Science,$x0302-9743 ;$v3052 300 $aBibliographic Level Mode of Issuance: Monograph 311 $a3-540-22094-1 320 $aIncludes bibliographical references at the end of each chapters and index. 327 $aInvited 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 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. 330 $aAbstract 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. 410 0$aLecture Notes in Computer Science,$x0302-9743 ;$v3052 606 $aComputer logic 606 $aMathematical logic 606 $aComputers 606 $aSoftware engineering 606 $aProgramming languages (Electronic computers) 606 $aLogics and Meanings of Programs$3https://scigraph.springernature.com/ontologies/product-market-codes/I1603X 606 $aMathematical Logic and Foundations$3https://scigraph.springernature.com/ontologies/product-market-codes/M24005 606 $aTheory of Computation$3https://scigraph.springernature.com/ontologies/product-market-codes/I16005 606 $aSoftware Engineering$3https://scigraph.springernature.com/ontologies/product-market-codes/I14029 606 $aMathematical Logic and Formal Languages$3https://scigraph.springernature.com/ontologies/product-market-codes/I16048 606 $aProgramming Languages, Compilers, Interpreters$3https://scigraph.springernature.com/ontologies/product-market-codes/I14037 615 0$aComputer logic. 615 0$aMathematical logic. 615 0$aComputers. 615 0$aSoftware engineering. 615 0$aProgramming languages (Electronic computers). 615 14$aLogics and Meanings of Programs. 615 24$aMathematical Logic and Foundations. 615 24$aTheory of Computation. 615 24$aSoftware Engineering. 615 24$aMathematical Logic and Formal Languages. 615 24$aProgramming Languages, Compilers, Interpreters. 676 $a511.3 702 $aZimmermann$b Wolf$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aThalheim$b Bernhard$4edt$4http://id.loc.gov/vocabulary/relators/edt 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a996466226603316 996 $aAbstract State Machines 2004. Advances in Theory and Practice$92179801 997 $aUNISA LEADER 02889nam 2200637 a 450 001 9910785090103321 005 20161219111353.0 010 $a1-4462-1247-5 010 $a1-281-24463-5 010 $a9786611244637 010 $a1-84787-821-0 035 $a(CKB)1000000000410938 035 $a(EBL)334367 035 $a(OCoLC)476141606 035 $a(SSID)ssj0000137811 035 $a(PQKBManifestationID)11954190 035 $a(PQKBTitleCode)TC0000137811 035 $a(PQKBWorkID)10096402 035 $a(PQKB)10142733 035 $a(MiAaPQ)EBC334367 035 $a(OCoLC)1007860018 035 $a(StDuBDS)EDZ0000071588 035 $a(Au-PeEL)EBL334367 035 $a(CaPaEBR)ebr10218282 035 $a(CaONFJC)MIL124463 035 $a(OCoLC)122962503 035 $a(FINmELB)ELB138670 035 $a(EXLCZ)991000000000410938 100 $a20120405d2005 fy 0 101 0 $aeng 135 $aur||||||||||| 181 $ctxt 182 $cc 183 $acr 200 00$aDeveloping school provision for children with dyspraxia$b[electronic resource] $ea practical guide /$fedited by Nichola Jones 210 $aLondon $cPaul Chapman$d2005 215 $a1 online resource (viii, 133 p.) $cill 300 $aDescription based upon print version of record. 311 $a1-4129-1037-4 311 $a1-4129-1038-2 320 $aIncludes bibliographical references (p. 123-129) and index. 327 $aCover; Contents; Contributors; Chapter 1 - Children with Development Coordination Disorder: Setting the Scene; Chapter 2 - Specific Learning Difficulties: The Spectrum; Chapter 3 - Developing Service Provision in Schools; Chapter 4 - Assessing Pupils with Coordination Difficulties; Chapter 5 - Developing Handwriting for Children with Coordination Difficulties; Chapter 6 - Developing a Gross Motor Programme for Children with Coordination Difficulties; Chapter 7 - Adapting the PE Curriculum; Chapter 8 - Working in Collaboration with the Therapist; Chapter 9 - A Parent's Perspective 327 $aChapter 10 - The Voice of the ChildReferences and further reading; Index 330 8 $aThis guide shows how to plan a whole school approach to including children with dyspraxia and DCD (developmental co-ordination disorder). It offers those in managerial and supervisory roles and special education support services guidance on models of provision that have worked successfully in schools and LEAs. 606 $aChildren with disabilities$xEducation$zGreat Britain 606 $aApraxia 615 0$aChildren with disabilities$xEducation 615 0$aApraxia. 676 $a371.9160941 701 $aJones$b Nichola$01521823 801 0$bStDuBDS 801 1$bStDuBDS 906 $aBOOK 912 $a9910785090103321 996 $aDeveloping school provision for children with dyspraxia$93761234 997 $aUNINA