Time-Dependent Path Scheduling

Helmut A. Sedding

ISBN 10: 3658284145 / ISBN 13: 9783658284145

Published by Springer Dez 2019, 2019

About this Item

This item is printed on demand - Print on Demand Titel. Neuware -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.Springer-Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg 196 pp. Englisch.

Seller Inventory # 9783658284145

Bibliographic Details

• Title: Time-Dependent Path Scheduling
• Publisher: Springer Dez 2019
• Publication Date: 2019
• Language: English
• ISBN 10: 3658284145
• ISBN 13: 9783658284145
• Binding: Taschenbuch
• Condition: Neu
• Dimensions: 210W x 148H x 11D millimeters 210 millimeters width by 148 millimeters height by 11 millimeters depth
• Weight: 261 grams

About this title

Synopsis

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.

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.