Since Karl Benz built the first motor driven vehicle in 1886 a new industry was born which is still one of the most important and influential sectors of economy. His 0.9 horse-power engine only reached 15 kilometers per hour but gave the starting shot for more and more inventions and a rapidly growing automobile industry. First cars where used for racing only but during the first period of the twentieth century it established its position as a new and individual means of transport. In 1936 the first Volkswagen called Beetle, a vehicle for the masses, was developed by Ferdinand Porsche and has been produced for 67 years. The last Beetle was built in the summer of 2003 in Mexico. Worldwide 100.000 new cars are being produced every day and in 2010 there will be over 1 billion private cars all over the world. This development requires perfectly organized and well optimized production processes and still calls for new inventions and improvements.
The production process in automobile manufacturing splits into three major stages. The moulding and welding of the car body in the body shop, the painting of the welded car bodies in the paint shop and the customization of the painted car bodies in the assembly shop.
The work presented here deals with the last two stages. The production plant contains a system of production lines which sometimes split into parallel lines and reunite to a non-parallel line. Each of these lines can require some set of restrictions on the cars sequenced on that line.
In the paint shop the cars are being painted on a line by a robot which through jets sprays the color onto the surface of the car body. Whenever the next car on the line has the same color the jets can be re-used. Otherwise they have to be cleaned which requires time and causes pollution. Therefore, minimizing the color changes that occur in the paint shop can save non negligible costs.
In the assembly shop separate teams install different options into the cars such as sun-roof, air-conditioning, central locking system etc. Therefore the order of the cars on the line has to fulfill some restrictions considering that each option requires a fixed time for installation and resources which have to be available at the time of installation.
Table of Contents
1. Introduction
1.1 Problem Formulation and Simplification
1.1.1 Simplification
1.1.2 Splitting the Problem
1.1.3 History of the Subproblems
1.2 Structure of this Work
1.3 Notations
2. Assembly Line Balancing
2.1 Objectives on Leveled Words
2.2 A Simplified Problem: Maximum Deviation Just-In-Time Scheduling
2.3 A Model and an Integer Program
2.4 Complexity Results
2.4.1 NP-complete Cases
2.4.2 Polynomial Cases
2.5 Solution Approaches
2.5.1 Exact Approaches
2.5.2 Heuristic Approaches
3. Reduction of Color Changes
3.1 Previous Work
3.2 Weak Balance of a Sequence
3.3 A Model and an Integer Program
3.4 Solution Approaches
3.4.1 Exact Approaches
3.4.2 Heuristic Approaches
4. Combining the Subproblems with the Buffer
4.1 Theoretical Background
4.2 Re-sorting the Paint Shop Sequence to an Assembly Sequence
4.3 Re-sorting an Assembly Sequence to a Paint Shop Sequence
5. Computational Results
5.1 DISTANCE CONSTRAINED BALANCING
5.2 WEAKLY BALANCED COLOR REDUCTION
5.3 PS2AL versus AL2PS
6. Returning to Practice
6.1 Basic Concepts
6.1.1 Plant Layout
6.1.2 Routing Patterns
6.1.3 Rules
6.2 Sequence Construction
6.2.1 Clustering into Slots
6.3 Suggestions for Real World Production Plants
7. Conclusions
Objectives and Focus
This work aims to optimize the production flow in automobile manufacturing by integrating a buffer between the paint shop and the assembly shop to minimize color changes while maintaining production balance. It addresses the research question of how such a buffer can effectively re-sort sequences to meet specific requirements for assembly line balancing and paint shop efficiency.
- Optimization of sequence balancing under distance constraints.
- Minimization of color change operations in the paint shop.
- Development of buffer-based re-sorting strategies (PS2AL and AL2PS).
- Evaluation of heuristic approaches against exact integer programming methods.
- Adaptation of sequencing logic for real-world, complex plant layouts.
Excerpt from the Book
1.1 Problem Formulation and Simplification
As mentioned above each car contains a set of options and has an enamel color depending on customer demands. Cars with the same set of options and not necessarily the same color belong to the same car type. The daily production is fixed, i.e. it is known in advance which cars to produce on a specific day.
The system of lines shown in Figure 1.2 contains an entry and an exit line. The cars are put in a sequence, i.e. one after another, on the entry line which splits following some pattern into the parallel lines and re-unites with the same pattern into the succeeding non-parallel line. This procedure is repeated until the exit line is reached.
Each line can have a set of requirements for a sequence entering that line:
Assembly Shop Lines: On each line we have a set of teams to install the options. Each team installs one or more different options and each option is installed by one or more teams.
The installation of an option requires a fixed amount of time. If an option j is installed by p teams and requires q time steps for installation it leads to constraints known as car sequencing constraints:
• MAX-CAR-SEQUENCING: At most p out of q subsequent cars can contain option j.
For p = 1 this can be read as a minimum distance constraint:
• MIN-DISTANCE: At least q - 1 cars without j must be sequenced between two neighboring cars with option j
Summary of Chapters
1. Introduction: This chapter introduces the context of automobile production and defines the fundamental subproblems of assembly line balancing and color reduction.
2. Assembly Line Balancing: This chapter analyzes objectives for leveled production sequences and provides complexity results as well as exact and heuristic solution approaches.
3. Reduction of Color Changes: This chapter focuses on the Paint Shop Problem and defines weak balance conditions to minimize color changes during the painting process.
4. Combining the Subproblems with the Buffer: This chapter explores strategies to utilize a buffer as a re-sorting mechanism to simultaneously address assembly and paint shop requirements.
5. Computational Results: This chapter presents extensive performance evaluations of the proposed algorithms using diverse test suites and real-world production data.
6. Returning to Practice: This chapter applies the developed methodologies to realistic, complex production plants with parallel lines and specific routing patterns.
7. Conclusions: This chapter summarizes the research findings and discusses the applicability of the buffer-based approach in industrial production environments.
Keywords
Assembly Line Balancing, Car Sequencing, Paint Shop Problem, Just-In-Time Production, Buffer Optimization, Color Change Reduction, Heuristic Approaches, Simulated Annealing, Genetic Algorithms, Re-sorting, Constraint Satisfaction, Integer Programming, Production Logistics, Manufacturing Automation.
Frequently Asked Questions
What is the primary focus of this work?
The thesis addresses the integration of a buffer between the paint shop and the assembly shop in car manufacturing to balance production requirements and minimize costs associated with color changes.
What are the central thematic fields discussed?
The key themes include assembly line balancing, car sequencing constraints, paint shop color optimization, and the development of re-sorting strategies using storage buffers.
What is the core research objective?
The objective is to find a sequence that satisfies strict assembly line distance constraints while simultaneously reducing the frequency of color change cleaning operations in the paint shop.
Which scientific methods are employed?
The research uses integer linear programming for exact solutions and various metaheuristics, including Local Search, Simulated Annealing, and Genetic Algorithms, to handle NP-complete problems.
What topics are covered in the main body?
The main body treats the separate optimization of the paint shop and assembly line, followed by the combination of these subproblems using different re-sorting strategies (PS2AL and AL2PS).
Which keywords characterize the work?
Key terms include assembly line balancing, car sequencing, paint shop optimization, just-in-time production, and buffer re-sorting techniques.
How does the "aging" strategy work within the buffer?
The aging strategy prioritizes items that have been in the buffer for a longer duration, ensuring that individual customer orders are not delayed beyond an acceptable threshold.
What is the significance of the "weak balance" condition?
The weak balance condition is introduced to relax strict constraints, allowing for efficient color reduction in the paint shop while still maintaining a sequence that can be re-sorted for the assembly line.
- Quote paper
- Robert Nickel (Author), 2004, Sequencing and Sorting in Just-In-Time Production, Munich, GRIN Verlag, https://www.grin.com/document/36806
