Lot-Sizing and Scheduling for Flexible Flow Lines
Main Author: | |
---|---|
Format: | eBook |
Language: | English |
Published: |
Berlin, Heidelberg
Springer Berlin Heidelberg
2004, 2004
|
Edition: | 1st ed. 2004 |
Series: | Lecture Notes in Economics and Mathematical Systems
|
Subjects: | |
Online Access: | |
Collection: | Springer Book Archives -2004 - Collection details see MPG.ReNa |
Table of Contents:
- 1 Introduction
- 1.1 Lot-Sizing and Scheduling
- 1.2 Flexible Flow Lines
- 1.3 Characteristics of the Problem
- 1.4 Scope and Outline of the Study
- 2 Lack of Solution Procedures in the Literature
- 2.1 Lot-Sizing Problems
- 2.2 Scheduling Problems
- 2.2.1 Branch & Bound Procedures
- 2.2.2 Local Search and Metaheuristics
- 2.2.3 Stage Decomposition Approaches
- 2.2.4 Job-Oriented Procedures
- 2.2.5 (Sequential) Loading and Sequencing Algorithms
- 2.3 Summary and Conclusion
- 3 An Integrative Solution Approach
- 4 Phase I: Bottleneck Planning
- 4.1 Lot-sizing and Scheduling on Parallel Machines
- 4.2 Literature Review
- 4.3 Standard Models with Extensions
- 4.4 Solution Approach
- 4.5 Computational Results
- 4.6 Summary
- 5 Phase II: Schedule Roll-Out
- 5.1 Premises and Scope
- 5.2 Scheduling Non-Bottleneck Production Stages
- 5.3 Two Remarks on the Resulting Schedule
- 5.4 Summary
- 6 Phase III: Product-to-Slot Assignment
- 6.1 Goal Trade-Off
- 6.2 Genetic Algorithms
- 6.3 Solution Procedure: Two Nested Genetic Algorithms
- 6.4 Computational Results
- 6.5 Summary
- 7 An Illustrative Example
- 7.1 Data of the Example
- 7.2 Solution after Phase I
- 7.3 Solution after Phase II
- 7.4 Solution after Phase III
- 8 An Application in the Semiconductor Industry
- 8.1 Semiconductor Process Flow
- 8.2 Problem Specifics and Dimensions
- 8.3 Modeling Assumptions
- 8.4 Short-Term Production Planning
- 8.5 Medium-Term Capacity Planning
- 9 Summary and Conclusions
- List of Abbreviations
- List of Symbols
- References