Time-Dependent Path Scheduling: Algorithmic Minimization of Walking Time at the Moving Assembly Line
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.

1134117269
Time-Dependent Path Scheduling: Algorithmic Minimization of Walking Time at the Moving Assembly Line
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.

54.99 In Stock
Time-Dependent Path Scheduling: Algorithmic Minimization of Walking Time at the Moving Assembly Line

Time-Dependent Path Scheduling: Algorithmic Minimization of Walking Time at the Moving Assembly Line

by Helmut A. Sedding
Time-Dependent Path Scheduling: Algorithmic Minimization of Walking Time at the Moving Assembly Line

Time-Dependent Path Scheduling: Algorithmic Minimization of Walking Time at the Moving Assembly Line

by Helmut A. Sedding

Paperback(1st ed. 2020)

$54.99 
  • SHIP THIS ITEM
    In stock. Ships in 1-2 days.
  • PICK UP IN STORE

    Your local store may have stock of this item.

Related collections and offers


Overview

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.


Product Details

ISBN-13: 9783658284145
Publisher: Springer Fachmedien Wiesbaden
Publication date: 11/22/2019
Edition description: 1st ed. 2020
Pages: 169
Product dimensions: 5.83(w) x 8.27(h) x (d)

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.

Table of Contents

Optimization Models for Minimizing Worker Walking Time Along Moving Assembly Lines.- Complexity Analyses, Combinatorial Properties, and Optimization Algorithms.- Numerical Experiments and Statistical Analyses.
From the B&N Reads Blog

Customer Reviews