Vai al contenuto principale della pagina

Scheduling in supply chains using mixed integer programming [[electronic resource] /] / Tadeusz Sawik



(Visualizza in formato marc)    (Visualizza in BIBFRAME)

Autore: Sawik Tadeusz Visualizza persona
Titolo: Scheduling in supply chains using mixed integer programming [[electronic resource] /] / Tadeusz Sawik Visualizza cluster
Pubblicazione: Hoboken, N.J., : Wiley, c2011
Descrizione fisica: 1 online resource (494 p.)
Disciplina: 658.701/51977
658.70151977
Soggetto topico: Assembly-line methods - Data processing
Business logistics - Data processing
Integer programming
Production scheduling - Data processing
Note generali: Description based upon print version of record.
Nota di bibliografia: Includes bibliographical references and index.
Nota di contenuto: Scheduling in Supply Chains Using Mixed Integer Programming; Contents; List of Figures; List of Tables; Preface; Acknowledgments; Introduction; Part One Short-Term Scheduling in Supply Chains; 1. Scheduling of Flexible Flow Shops; 1.1 Introduction; 1.2 Mixed Integer Programs for Scheduling Flow Shops; 1.3 Constructive Heuristics for Scheduling Flexible Flow Shops; 1.4 Scheduling Flow Shops with Limited Machine Availability; 1.5 Computational Examples; 1.6 Comments; Exercises; 2. Scheduling of Surface Mount Technology Lines; 2.1 Introduction; 2.2 SMT Line Configurations
2.3 General Scheduling of SMT Lines2.4 Batch Scheduling of SMT Lines; 2.5 An Improvement Heuristic for Scheduling SMT Lines; 2.6 Computational Examples; 2.7 Comments; Exercises; 3. Balancing and Scheduling of Flexible Assembly Lines; 3.1 Introduction; 3.2 Balancing and Scheduling of Flexible Assembly Lines with Infinite In-Process Buffers; 3.3 Balancing and Scheduling of SMT Lines; 3.4 Comments; Exercises; 4. Loading and Scheduling of Flexible Assembly Systems; 4.1 Introduction; 4.2 Loading and Scheduling of Flexible Assembly Systems with Single Stations and Infinite In-Process Buffers
4.3 Loading and Scheduling of Flexible Assembly Systems with Parallel Stations and Finite In-Process Buffers4.4 Comments; Exercises; Part Two Medium-Term Scheduling in Supply Chains; 5. Customer Order Acceptance and Due Date Setting in Make-to-Order Manufacturing; 5.1 Introduction; 5.2 Problem Description; 5.3 Bi-Objective Order Acceptance and Due Date Setting; 5.4 Lexicographic Approach; 5.5 Scheduling of Customer Orders; 5.6 Computational Examples; 5.7 Comments; Exercises; 6. Aggregate Production Scheduling in Make-to-Order Manufacturing; 6.1 Introduction; 6.2 Problem Description
6.3 Bi-Objective Scheduling of Customer Orders6.4 Multi-Objective Scheduling of Customer Orders; 6.5 Scheduling of Single-Period Customer Orders; 6.6 Comments; Exercises; 7. Reactive Aggregate Production Scheduling in Make-to-Order Manufacturing; 7.1 Introduction; 7.2 Problem Description; 7.3 Mixed Integer Programs for Reactive Scheduling; 7.4 Rescheduling Algorithms; 7.5 Input and Output Inventory; 7.6 Computational Examples; 7.7 Comments; Exercises; 8. Scheduling of Material Supplies in Make-to-Order Manufacturing; 8.1 Introduction; 8.2 Flexible vs. Cyclic Material Supplies
8.3 Model Enhancements8.4 Computational Examples; 8.5 Comments; Exercises; 9. Selection of Static Supply Portfolio in Supply Chains with Risks; 9.1 Introduction; 9.2 Selection of a Supply Portfolio without Discount under Operational Risks; 9.3 Selection of Supply Portfolio with Discount under Operational Risks; 9.4 Computational Examples; 9.5 Selection of Supply Portfolio under Disruption Risks; 9.6 Single-Objective Supply Portfolio under Disruption Risks; 9.7 Bi-Objective Supply Portfolio under Disruption Risks; 9.8 Computational Examples; 9.9 Comments; Exercises
10. Selection of a Dynamic Supply Portfolio in Supply Chains with Risks
Sommario/riassunto: 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. Featuring a unified and systematic presentation, Scheduling in Supply Chains Using Mixed Integer Programming provides state-of-the-art MIP mo
Titolo autorizzato: Scheduling in supply chains using mixed integer programming  Visualizza cluster
ISBN: 1-283-29458-3
9786613294586
1-118-02910-0
1-118-02911-9
1-118-02909-7
Formato: Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione: Inglese
Record Nr.: 9910139571903321
Lo trovi qui: Univ. Federico II
Opac: Controlla la disponibilità qui