{"product_id":"scheduling-in-supply-chains-using-mixed-integer-programming-9780470935736","title":"Scheduling in Supply Chains Using Mixed Integer","description":"\u003cb\u003eBook Synopsis\u003c\/b\u003e\u003cbr\u003eFeaturing a unified and systematic presentation, this book provides state-of-the-art mixed integer programming (MIP) modeling and solution approaches, equipping readers with the knowledge and tools to model and solve real-world supply chain scheduling problems in make-to-order manufacturing.\u003cbr\u003e\u003cbr\u003e\u003cb\u003eTrade Review\u003c\/b\u003e\u003cbr\u003e\u003cp\u003e“Scheduling in supply chains using mixed integer programming is a comprehensive resource for practitioners and researchers working in supply chain planning, scheduling, and management.”  (\u003ci\u003eMathematical Reviews\u003c\/i\u003e, 2012)\u003c\/p\u003e \"The book is well written and is addressed to practitioners and researchers working in supply chain management and scheduling and as well for PhD students in management science, applied mathematics, operations research, industrial engineering and computer science.\" (Zentralblatt MATH, 2012)  \u003cp\u003e\"A unified, systematic approach to applying mixed integer programming solutions to integrated scheduling in customer-driven supply chains Supply chain management is a rapidly developing field, and the recent improvements in modeling, preprocessing, solution algorithms, and mixed integer programming (MIP) software have made it possible to solve large-scale MIP models of scheduling problems, especially integrated scheduling in supply chains.\" (Finwin, 8 November 2011)\u003c\/p\u003e \u003cp\u003e \u003c\/p\u003e\u003cbr\u003e\u003cbr\u003e\u003cb\u003eTable of Contents\u003c\/b\u003e\u003cbr\u003eList of Figures xiii  \u003cp\u003eList of Tables xix\u003c\/p\u003e \u003cp\u003ePreface xxiii\u003c\/p\u003e \u003cp\u003eAcknowledgments xxv\u003c\/p\u003e \u003cp\u003eIntroduction xxvii\u003c\/p\u003e \u003cp\u003ePart One Short-Term Scheduling in Supply Chains 1\u003c\/p\u003e \u003cp\u003e1. Scheduling of Flexible Flow Shops 3\u003c\/p\u003e \u003cp\u003e1.1 Introduction 3\u003c\/p\u003e \u003cp\u003e1.2 Mixed Integer Programs for Scheduling Flow Shops 4\u003c\/p\u003e \u003cp\u003e1.3 Constructive Heuristics for Scheduling Flexible Flow Shops 19\u003c\/p\u003e \u003cp\u003e1.4 Scheduling Flow Shops with Limited Machine Availability 30\u003c\/p\u003e \u003cp\u003e1.5 Computational Examples 32\u003c\/p\u003e \u003cp\u003e1.6 Comments 37\u003c\/p\u003e \u003cp\u003eExercises 40\u003c\/p\u003e \u003cp\u003e2. Scheduling of Surface Mount Technology Lines 41\u003c\/p\u003e \u003cp\u003e2.1 Introduction 41\u003c\/p\u003e \u003cp\u003e2.2 SMT Line Configurations 42\u003c\/p\u003e \u003cp\u003e2.3 General Scheduling of SMT Lines 45\u003c\/p\u003e \u003cp\u003e2.4 Batch Scheduling of SMT Lines 51\u003c\/p\u003e \u003cp\u003e2.5 An Improvement Heuristic for Scheduling SMT Lines 54\u003c\/p\u003e \u003cp\u003e2.6 Computational Examples 60\u003c\/p\u003e \u003cp\u003e2.7 Comments 69\u003c\/p\u003e \u003cp\u003eExercises 70\u003c\/p\u003e \u003cp\u003e3. Balancing and Scheduling of Flexible Assembly Lines 71\u003c\/p\u003e \u003cp\u003e3.1 Introduction 71\u003c\/p\u003e \u003cp\u003e3.2 Balancing and Scheduling of Flexible Assembly Lines with Infinite In-Process Buffers 72\u003c\/p\u003e \u003cp\u003e3.3 Balancing and Scheduling of SMT Lines 83\u003c\/p\u003e \u003cp\u003e3.4 Comments 97\u003c\/p\u003e \u003cp\u003eExercises 97\u003c\/p\u003e \u003cp\u003e4. Loading and Scheduling of Flexible Assembly Systems 99\u003c\/p\u003e \u003cp\u003e4.1 Introduction 99\u003c\/p\u003e \u003cp\u003e4.2 Loading and Scheduling of Flexible Assembly Systems with Single Stations and Infinite In-Process Buffers 100\u003c\/p\u003e \u003cp\u003e4.3 Loading and Scheduling of Flexible Assembly Systems with Parallel Stations and Finite In-Process Buffers 110\u003c\/p\u003e \u003cp\u003e4.4 Comments 125\u003c\/p\u003e \u003cp\u003eExercises 130\u003c\/p\u003e \u003cp\u003ePart Two Medium-Term Scheduling in Supply Chains 131\u003c\/p\u003e \u003cp\u003e5. Customer Order Acceptance and Due Date Setting in Make-to-Order Manufacturing 133\u003c\/p\u003e \u003cp\u003e5.1 Introduction 133\u003c\/p\u003e \u003cp\u003e5.2 Problem Description 134\u003c\/p\u003e \u003cp\u003e5.3 Bi-Objective Order Acceptance and Due Date Setting 137\u003c\/p\u003e \u003cp\u003e5.4 Lexicographic Approach 141\u003c\/p\u003e \u003cp\u003e5.5 Scheduling of Customer Orders 144\u003c\/p\u003e \u003cp\u003e5.6 Computational Examples 148\u003c\/p\u003e \u003cp\u003e5.7 Comments 158\u003c\/p\u003e \u003cp\u003eExercises 159\u003c\/p\u003e \u003cp\u003e6. Aggregate Production Scheduling in Make-to-Order Manufacturing 161\u003c\/p\u003e \u003cp\u003e6.1 Introduction 161\u003c\/p\u003e \u003cp\u003e6.2 Problem Description 163\u003c\/p\u003e \u003cp\u003e6.3 Bi-Objective Scheduling of Customer Orders 165\u003c\/p\u003e \u003cp\u003e6.4 Multi-Objective Scheduling of Customer Orders 171\u003c\/p\u003e \u003cp\u003e6.5 Scheduling of Single-Period Customer Orders 187\u003c\/p\u003e \u003cp\u003e6.6 Comments 212\u003c\/p\u003e \u003cp\u003eExercises 216\u003c\/p\u003e \u003cp\u003e7. Reactive Aggregate Production Scheduling in Make-to-Order Manufacturing 219\u003c\/p\u003e \u003cp\u003e7.1 Introduction 219\u003c\/p\u003e \u003cp\u003e7.2 Problem Description 220\u003c\/p\u003e \u003cp\u003e7.3 Mixed Integer Programs for Reactive Scheduling 221\u003c\/p\u003e \u003cp\u003e7.4 Rescheduling Algorithms 224\u003c\/p\u003e \u003cp\u003e7.5 Input and Output Inventory 227\u003c\/p\u003e \u003cp\u003e7.6 Computational Examples 229\u003c\/p\u003e \u003cp\u003e7.7 Comments 236\u003c\/p\u003e \u003cp\u003eExercises 236\u003c\/p\u003e \u003cp\u003e8. Scheduling of Material Supplies in Make-to-Order Manufacturing 239\u003c\/p\u003e \u003cp\u003e8.1 Introduction 239\u003c\/p\u003e \u003cp\u003e8.2 Flexible vs. Cyclic Material Supplies 241\u003c\/p\u003e \u003cp\u003e8.3 Model Enhancements 244\u003c\/p\u003e \u003cp\u003e8.4 Computational Examples 248\u003c\/p\u003e \u003cp\u003e8.5 Comments 256\u003c\/p\u003e \u003cp\u003eExercises 257\u003c\/p\u003e \u003cp\u003e9. Selection of Static Supply Portfolio in Supply Chains with Risks 259\u003c\/p\u003e \u003cp\u003e9.1 Introduction 259\u003c\/p\u003e \u003cp\u003e9.2 Selection of a Supply Portfolio without Discount under Operational Risks 261\u003c\/p\u003e \u003cp\u003e9.3 Selection of Supply Portfolio with Discount under Operational Risks 266\u003c\/p\u003e \u003cp\u003e9.4 Computational Examples 269\u003c\/p\u003e \u003cp\u003e9.5 Selection of Supply Portfolio under Disruption Risks 272\u003c\/p\u003e \u003cp\u003e9.6 Single-Objective Supply Portfolio under Disruption Risks 274\u003c\/p\u003e \u003cp\u003e9.7 Bi-Objective Supply Portfolio under Disruption Risks 279\u003c\/p\u003e \u003cp\u003e9.8 Computational Examples 280\u003c\/p\u003e \u003cp\u003e9.9 Comments 289\u003c\/p\u003e \u003cp\u003eExercises 291\u003c\/p\u003e \u003cp\u003e10. Selection of a Dynamic Supply Portfolio in Supply Chains with Risks 293\u003c\/p\u003e \u003cp\u003e10.1 Introduction 293\u003c\/p\u003e \u003cp\u003e10.2 Multiperiod Supplier Selection and Order Allocation 294\u003c\/p\u003e \u003cp\u003e10.3 Selection of a Dynamic Supply Portfolio to Minimize Expected Costs 297\u003c\/p\u003e \u003cp\u003e10.4 Selection of a Dynamic Supply Portfolio to Minimize Expected Worst-Case Costs 301\u003c\/p\u003e \u003cp\u003e10.5 Supply Portfolio for Best-Case and Worst-Case TDN Supplies 302\u003c\/p\u003e \u003cp\u003e10.6 Computational Examples 306\u003c\/p\u003e \u003cp\u003e10.7 Comments 315\u003c\/p\u003e \u003cp\u003eExercises 316\u003c\/p\u003e \u003cp\u003ePart Three Coordinated Scheduling in Supply Chains 319\u003c\/p\u003e \u003cp\u003e11. Hierarchical Integration of Medium- and Short-Term Scheduling 321\u003c\/p\u003e \u003cp\u003e11.1 Introduction 321\u003c\/p\u003e \u003cp\u003e11.2 Problem Description 322\u003c\/p\u003e \u003cp\u003e11.3 Medium-Term Production Scheduling 325\u003c\/p\u003e \u003cp\u003e11.4 Short-Term Machine Assignment and Scheduling 330\u003c\/p\u003e \u003cp\u003e11.5 Computational Examples 335\u003c\/p\u003e \u003cp\u003e11.6 Comments 348\u003c\/p\u003e \u003cp\u003eExercises 349\u003c\/p\u003e \u003cp\u003e12. Coordinated Scheduling in Supply Chains with a Single Supplier 351\u003c\/p\u003e \u003cp\u003e12.1 Introduction 351\u003c\/p\u003e \u003cp\u003e12.2 Problem Description 352\u003c\/p\u003e \u003cp\u003e12.3 Supply Chain Inventory 354\u003c\/p\u003e \u003cp\u003e12.4 Coordinated Supply Chain Scheduling: An Integrated Approach 359\u003c\/p\u003e \u003cp\u003e12.5 Coordinated Supply Chain Scheduling: A Hierarchical Approach 362\u003c\/p\u003e \u003cp\u003e12.6 Computational Examples 366\u003c\/p\u003e \u003cp\u003e12.7 Comments 375\u003c\/p\u003e \u003cp\u003eExercises 376\u003c\/p\u003e \u003cp\u003e13. Coordinated Scheduling in Supply Chains with Assignment of Orders to Suppliers 379\u003c\/p\u003e \u003cp\u003e13.1 Introduction 379\u003c\/p\u003e \u003cp\u003e13.2 Problem Description 380\u003c\/p\u003e \u003cp\u003e13.3 Conditions for Feasibility of Customer Due Dates 383\u003c\/p\u003e \u003cp\u003e13.4 Coordinated Supply Chain Scheduling: An Integrated Approach 385\u003c\/p\u003e \u003cp\u003e13.5 Selected Multi-Objective Solution Approaches 392\u003c\/p\u003e \u003cp\u003e13.6 Coordinated Supply Chain Scheduling: A Hierarchical Approach 393\u003c\/p\u003e \u003cp\u003e13.7 Computational Examples 401\u003c\/p\u003e \u003cp\u003e13.8 Comments 408\u003c\/p\u003e \u003cp\u003eExercises 409\u003c\/p\u003e \u003cp\u003e14. Coordinated Scheduling in Supply Chains without Assignment of Orders to Suppliers 411\u003c\/p\u003e \u003cp\u003e14.1 Introduction 411\u003c\/p\u003e \u003cp\u003e14.2 Problem Description 412\u003c\/p\u003e \u003cp\u003e14.3 Coordinated Supply Chain Scheduling: An Integrated Approach 413\u003c\/p\u003e \u003cp\u003e14.4 Selected Bi-Objective Solution Approaches 418\u003c\/p\u003e \u003cp\u003e14.5 Coordinated Supply Chain Scheduling: A Hierarchical Approach 419\u003c\/p\u003e \u003cp\u003e14.6 Computational Examples 425\u003c\/p\u003e \u003cp\u003e14.7 Comments 433\u003c\/p\u003e \u003cp\u003eExercises 434\u003c\/p\u003e \u003cp\u003eReferences 437\u003c\/p\u003e \u003cp\u003eIndex 449\u003c\/p\u003e","brand":"Wiley","offers":[{"title":"Default Title","offer_id":49903680553303,"sku":"9780470935736","price":114.26,"currency_code":"GBP","in_stock":true}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0817\/1739\/5799\/files\/9780470935736.jpg?v=1738182624","url":"https:\/\/bookcurl.com\/products\/scheduling-in-supply-chains-using-mixed-integer-programming-9780470935736","provider":"Book Curl","version":"1.0","type":"link"}