Time-dependent path scheduling
β Sedding H.A
π Library
π
2020
π Springer
π English
β¦ LIBER β¦
π
Time-Dependent Path Scheduling: Algorithmic Minimization of Walking Time at the Moving Assembly Line
β Scribed by Helmut A. Sedding
- Publisher
- Springer Fachmedien Wiesbaden;Springer Vieweg
- Year
- 2020
- Tongue
- English
- Leaves
- 177
- Edition
- 1st ed. 2020
- Category
- Library
β¬ Acquire This Volume
No coin nor oath required. For personal study only.
β¦ 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.
β¦ Table of Contents
Front Matter ....Pages I-XXIII
Front Matter ....Pages 1-1
Introduction (Helmut A. Sedding)....Pages 3-6
Modeling (Helmut A. Sedding)....Pages 7-20
Front Matter ....Pages 21-21
Operation sequencing (Helmut A. Sedding)....Pages 23-50
Operation sequencing with a single box position (Helmut A. Sedding)....Pages 51-69
Front Matter ....Pages 71-71
Box placement for one product variant (Helmut A. Sedding)....Pages 73-109
Box placement for multiple product variants (Helmut A. Sedding)....Pages 111-141
Front Matter ....Pages 143-143
Conclusion (Helmut A. Sedding)....Pages 145-147
Summary of major contributions (Helmut A. Sedding)....Pages 149-151
Back Matter ....Pages 153-169
β¦ Subjects
Computer Science; Algorithm Analysis and Problem Complexity; Operations Research, Management Science; Industrial and Production Engineering
π SIMILAR VOLUMES
Models and Algorithms of Time-dependent
β Stanislaw Gawiejnowicz
π Library
π
2019
π Springer-Nature New York Inc
π English
This is a comprehensive study of various time-dependent scheduling problems in single-, parallel- and dedicated-machine environments. In addition to complexity issues and exact or heuristic algorithms which are typically presented in scheduling books, the author also includes more advanced topics su
Models and Algorithms of Time-Dependent
β StanisΕaw Gawiejnowicz
π Library
π
2020
π Springer Berlin Heidelberg;Springer
π English
<p>This is a comprehensive study of various time-dependent scheduling problems in single-, parallel- and dedicated-machine environments. In addition to complexity issues and exact or heuristic algorithms which are typically presented in scheduling books, the author also includes more advanced topics
Time-Dependent Scheduling
β Stanislaw Gawiejnowicz
π Library
π
2008
π Springer
π English
Time-dependent scheduling involves problems in which the processing times of jobs depend on when those jobs are started. This book is a comprehensive study of complexity results and optimal and suboptimal algorithms concerning time-dependent scheduling in single-, parallel- and dedicated-machine env
Time-Dependent Scheduling
β StanisΕaw Gawiejnowicz (auth.)
π Library
π
2008
π Springer
π English
Machine Scheduling to Minimize Weighted
β NicolΓ³ Gusmeroli
π Library
π
2018
π Springer International Publishing
π English
<p><p>This work reviews the most important results regarding the use of the Ξ±-point in Scheduling Theory. It provides a number of different LP-relaxations for scheduling problems and seeks to explain their polyhedral consequences. It also explains the concept of the Ξ±-point and how the conversion al