Overview
- Fast algorithms for computational decision support
Access this book
Tax calculation will be finalised at checkout
Other ways to access
About this book
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.
Similar content being viewed by others
Keywords
Table of contents (8 chapters)
-
Introduction
-
Operation sequencing
-
Box placement
-
Conclusion
Authors and Affiliations
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.
Bibliographic Information
Book Title: Time-Dependent Path Scheduling
Book Subtitle: Algorithmic Minimization of Walking Time at the Moving Assembly Line
Authors: Helmut A. Sedding
DOI: https://doi.org/10.1007/978-3-658-28415-2
Publisher: Springer Vieweg Wiesbaden
eBook Packages: Computer Science, Computer Science (R0)
Copyright Information: Springer Fachmedien Wiesbaden GmbH, part of Springer Nature 2020
Softcover ISBN: 978-3-658-28414-5Published: 03 December 2019
eBook ISBN: 978-3-658-28415-2Published: 22 November 2019
Edition Number: 1
Number of Pages: XXIII, 169
Number of Illustrations: 17 b/w illustrations, 3 illustrations in colour
Topics: Algorithm Analysis and Problem Complexity, Operations Research, Management Science, Industrial and Production Engineering