LEADER 05506nam 2200721 a 450 001 9911018805103321 005 20200520144314.0 010 $a9786612165221 010 $a9781118623398 010 $a1118623398 010 $a9781282165229 010 $a1282165224 010 $a9780470611432 010 $a047061143X 010 $a9780470394045 010 $a0470394048 035 $a(CKB)2550000000005841 035 $a(EBL)477629 035 $a(OCoLC)607263785 035 $a(SSID)ssj0000354204 035 $a(PQKBManifestationID)11275862 035 $a(PQKBTitleCode)TC0000354204 035 $a(PQKBWorkID)10313873 035 $a(PQKB)10426101 035 $a(MiAaPQ)EBC477629 035 $a(PPN)18494192X 035 $a(Perlego)1007767 035 $a(EXLCZ)992550000000005841 100 $a20080710d2008 uy 0 101 0 $aeng 135 $aur|n|---||||| 181 $ctxt 182 $cc 183 $acr 200 00$aFlexibility and robustness in scheduling /$fedited by Jean-Charles Billaut, Aziz Moukrim, Eric Sanlaville 210 $aLondon ;$aHoboken, NJ $cISTE/John Wiley & Sons$d2008 215 $a1 online resource (351 p.) 225 1 $aControl systems, robotics and manufacturing series 300 $aDescription based upon print version of record. 311 08$a9781848210547 311 08$a184821054X 320 $aIncludes bibliographical references and index. 327 $aFlexibility and Robustness in Scheduling; Table of Contents; Preface; Chapter 1. Introduction to Flexibility and Robustness in Scheduling; 1.1. Scheduling problems; 1.1.1. Machine environments; 1.1.2. Characteristics of tasks; 1.1.3. Optimality criteria; 1.2. Background to the study; 1.3. Uncertainty management; 1.3.1. Sources of uncertainty; 1.3.2. Uncertainty of models; 1.3.3. Possible methods for problem solving; 1.3.3.1. Full solution process of a scheduling problem with uncertainties; 1.3.3.2. Proactive approach; 1.3.3.3. Proactive/reactive approach; 1.3.3.4. Reactive approach 327 $a1.4. Flexibility1.5. Robustness; 1.5.1. Flexibility as a robustness indicator; 1.5.2. Schedule stability (solution robustness); 1.5.3. Stability relatively to a performance criterion (quality robustness); 1.5.4. Respect of a fixed performance threshold; 1.5.5. Deviation measures with respect to the optimum; 1.5.6. Sensitivity and robustness; 1.6. Bibliography; Chapter 2. Robustness in Operations Research and Decision Aiding; 2.1. Overview; 2.1.1. Robust in OR-DA with meaning?; 2.1.2. Why the concern for robustness?; 2.1.3. Plan of the chapter 327 $a2.2. Where do "vague approximations" and "zones of ignorance" come from? - the concept of version2.2.1. Sources of inaccurate determination, uncertainty and imprecision; 2.2.2. DAP formulation: the concept of version; 2.3. Defining some currently used terms; 2.3.1. Procedures, results and methods; 2.3.2. Two types of procedures and methods; 2.3.3. Conclusions relative to a set R of results; 2.4. How to take the robustness concern into consideration; 2.4.1. What must be robust?; 2.4.2. What are the conditions for validating robustness? 327 $a2.4.3. How can we define the set of pairs of procedures and versions to take into account?2.5. Conclusion; 2.6. Bibliography; Chapter 3. The Robustness of Multi-Purpose Machines Workshop Configuration; 3.1. Introduction; 3.2. Problem presentation; 3.2.1. Modeling the workshop; 3.2.1.1. Production resources; 3.2.1.2. Modeling the workshop demand; 3.2.2. Modeling disturbances on the data; 3.2.3. Performance versus robustness: load balance and stability radius; 3.2.3.1. Performance criterion for a configuration; 3.2.3.2. Robustness; 3.3. Performance measurement 327 $a3.3.1. Stage one: minimizing the maximum completion time3.3.2. Computing a production plan minimizing machine workload; 3.3.3. The particular case of uniform machines; 3.4. Robustness evaluation; 3.4.1. Finding the demands for which the production plan is balanced; 3.4.2. Stability radius; 3.4.3. Graphic representation; 3.5. Extension: reconfiguration problem; 3.5.1. Consequence of adding a qualification to the matrix Q; 3.5.2. Theoretical example; 3.5.3. Industrial example; 3.6. Conclusion and perspectives; 3.7. Bibliography; Chapter 4. Sensitivity Analysis for One and m Machines 327 $a4.1. Sensitivity analysis 330 $aScheduling is a broad research area and scheduling problems arise from several application domains (production systems, logistic, computer science, etc.). Solving scheduling problems requires tools of combinatorial optimization, exact or approximated algorithms. Flexibility is at the frontier between predictive deterministic approaches and reactive or ?on-line? approaches. The purpose of flexibility is to provide one or more solutions adapted to the context of the application in order to provide the ideal solution. This book focuses on the integration of flexibility and robustness consideratio 410 0$aControl systems, robotics and manufacturing series. 606 $aProduction scheduling 615 0$aProduction scheduling. 676 $a658.5/3 701 $aBillaut$b Jean-Charles$f1967-$01838829 701 $aMoukrim$b Aziz$01838830 701 $aSanlaville$b Eric$01838831 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a9911018805103321 996 $aFlexibility and robustness in scheduling$94417907 997 $aUNINA