Time-Dependent Path Scheduling

Algorithmic Minimization of Walking Time at the Moving Assembly Line

  • Helmut A. Sedding

Table of contents

  1. Front Matter
    Pages I-XXIII
  2. Introduction

    1. Front Matter
      Pages 1-1
    2. Helmut A. Sedding
      Pages 3-6
    3. Helmut A. Sedding
      Pages 7-20
  3. Operation sequencing

    1. Front Matter
      Pages 21-21
    2. Helmut A. Sedding
      Pages 23-50
    3. Helmut A. Sedding
      Pages 51-69
  4. Box placement

    1. Front Matter
      Pages 71-71
    2. Helmut A. Sedding
      Pages 73-109
    3. Helmut A. Sedding
      Pages 111-141
  5. Conclusion

    1. Front Matter
      Pages 143-143
    2. Helmut A. Sedding
      Pages 145-147
    3. Helmut A. Sedding
      Pages 149-151
  6. Back Matter
    Pages 153-169

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.

  • Optimization Models for Minimizing Worker Walking Time Along Moving Assembly Lines
  • Complexity Analyses, Combinatorial Properties, and Optimization Algorithms 
  • Numerical Experiments and Statistical Analyses
Target Groups
  • Scientists in computer science, mathematics, operations research, operations management, and industrial engineering
  • Practitioners in the field of automobile production planning
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.


time-dependent scheduling nonmonotonic processing time combinatorial algorithms complexity analysis production planning automobile production moving assembly line time-dependent walking time walking time minimization

Authors and affiliations

  • Helmut A. Sedding
    • 1
  1. 1.Institute of Theoretical Computer ScienceUlm UniversityUlmGermany

Bibliographic information

Industry Sectors
Materials & Steel
Finance, Business & Banking
IT & Software
Consumer Packaged Goods
Energy, Utilities & Environment