Skip to main content
Fachgebiete
Automobil + Motoren Bauwesen + Immobilien Business IT + Informatik Elektrotechnik + Elektronik Energie + Nachhaltigkeit Finance + Banking Management + Führung Marketing + Vertrieb Maschinenbau + Werkstoffe Versicherung + Risiko
DE
EN
Themenseiten
Organisationspsychologie Projektmanagement Marketing Smart Manufacturing
Bücher
Zeitschriften
Weitere Formate
Podcasts Webinare Technik Webinare Wirtschaft Kongresse Veranstaltungskalender Awards
Jetzt Einzelzugang starten
Zugang für Unternehmen
Referenzkunden
ATZ-Fachkongress

Chassis.tech plus 2024


4 Kongresse in einer Veranstaltung

Treffen Sie in München die Fachleute von Chassis, Lenkung, Bremsen sowie Reifen/Räder.
Erweiterte Suche
Anmelden
nach oben

2020 | Buch

Introduction Kapitel lesen Erstes Kapitel lesen

Time-Dependent Path Scheduling

Algorithmic Minimization of Walking Time at the Moving Assembly Line

verfasst von: Helmut A. Sedding

Verlag: Springer Fachmedien Wiesbaden

Enthalten in: Springer Professional "Wirtschaft+Technik" , Springer Professional "Technik" , Springer Professional "Wirtschaft"

Einloggen, um Zugang zu erhalten
insite
SUCHEN

Über dieses Buch

Moving assembly lines are the stepping stone for mass production of automobiles. Here, every second counts, which necessitates planners to meticulously optimize them. A crucial factor is each worker’s nonproductive walking time between the moving workpiece and line-side material containers for picking up required material. Minimizing the walking time is difficult because the workpiece moves steadily. Helmut A. Sedding devises algorithms to optimize the sequence of work operations, and the placement of material containers. Thereby, he introduces a novel category of time-dependent scheduling problems, and lays the basis for the algorithmic optimization of time-dependent paths at the moving assembly line.

About the Author:

Helmut A. Sedding passed his doctoral thesis with distinction at the Institute of Theoretical Computer Science at Ulm University, Germany. He researches on modeling, complexity analysis, and algorithm design for the solution of various optimization problems. His practical experience includes the development of automotive production planning software in use at major car manufacturers.

Inhaltsverzeichnis

Frontmatter

Introduction

Frontmatter
Chapter 1. Introduction
Abstract
Production systems possess a high number of variables that influence their productivity. This is a major motivation for production planners to utilize proficient planning software that assists them in making informed decisions. A key component for improving productivity is the elimination of nonproductive time.
Helmut A. Sedding
Chapter 2. Modeling
Abstract
To provide a base for optimizing walking time, we devise a model that finds a balance between closely depicting the reality and enabling a fast combinatorial optimization of all variables. Moreover, we aim for a model that catches the problem core, such that it enables the derivation of further models at later points in time. In this chapter, we first describe our devised model, give an overview on literature about the practical problem in Section 2.2, and discuss our model assumptions in Section 2.3. With these, we show how to calculate walking time in several walking strategies along the assembly line in Section 2.4.
Helmut A. Sedding

Operation sequencing

Frontmatter
Chapter 3. Operation sequencing
Abstract
This chapter considers the problem of optimizing a worker’s sequence of assembly operations at a workpiece to minimize total walking time between the movingworkpiece and parts from the line side. Each assembly operation is given a static line side box position along the workpiece line. Then, each assembly operation is preceded by a walk to this box position.
Helmut A. Sedding
Chapter 4. Operation sequencing with a single box position
Abstract
Let us consider a special case of problem S in the previous chapter to consider the assembly operation or job sequencing problem: with one common box position for all jobs. This covers the practice case where all parts fit into one box or shelf. Then, a walk time optimization needs to decide which of the jobs shall start before the box position, and which after.
Helmut A. Sedding

Box placement

Frontmatter
Chapter 5. Box placement for one product variant
Abstract
In this chapter, we introduce an approach for reducing walking time at moving assembly lines by optimizing the line side placement of parts, given that there is only one product variant, or one set of operations and parts. This is an intriguing problem because each container position influences the worker walking times. Intuitively, it should suffice to order the boxes in the same sequence as the jobs in order to place each close to the point where its job is performed.
Helmut A. Sedding
Chapter 6. Box placement for multiple product variants
Abstract
Car manufacturers cope with the demand for a variety of product variants often by manufacturing different product variants on the same assembly line (Sternatz, 2014). This extends the classic assembly of a single product to a set of several product variants that are assembled in an intermixed succession. Here, assembly operations can differ between product variants.
Helmut A. Sedding

Conclusion

Frontmatter
Chapter 7. Conclusion
Abstract
In this work, we find that optimizing walking time with time-dependent paths to moving destinations is a computationally challenging problem. In most cases, it turns out as NP-hard, and we find edge cases that are polynomial or permit fully polynomial time approximation. Nonetheless, it is possible to establish fast exact search algorithms.
Helmut A. Sedding
Chapter 8. Summary of major contributions
Abstract
Let us summarize the major contributions for computationally minimizing walking time at moving assembly lines in two groups: optimization of (a) the sequence of assembly operations, and (b) the line side placement of parts.
Helmut A. Sedding
Backmatter
Metadaten
Titel
Time-Dependent Path Scheduling
verfasst von
Helmut A. Sedding
Copyright-Jahr
2020
Electronic ISBN
978-3-658-28415-2
Print ISBN
978-3-658-28414-5
DOI
https://doi.org/10.1007/978-3-658-28415-2

Premium Partner

    Bildnachweise