| Publication type: | Doctoral thesis |
| Title: | Time-dependent path scheduling : algorithmic minimization of walking time at the moving assembly line |
| Authors: | Sedding, Helmut A. |
| et. al: | No |
| DOI: | 10.1007/978-3-658-28415-2 |
| Extent: | 169 |
| Issue Date: | 2020 |
| Edition: | 1st Edition |
| Publisher / Ed. Institution: | Springer |
| Publisher / Ed. Institution: | Wiesbaden |
| ISBN: | 978-3-658-28414-5 978-3-658-28415-2 |
| Language: | English |
| Subjects: | Time-dependent scheduling; Nonmonotonic processing time; Combinatorial algorithm; Complexity analysis; Production planning; Automobile production; Moving assembly line; Time-dependent walking time; Walking time minimization |
| Subject (DDC): | 658.5: Production management |
| Abstract: | 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. |
| Further description: | Dissertation, Universität Ulm, Germany, 2019 |
| URI: | https://digitalcollection.zhaw.ch/handle/11475/18914 |
| License (according to publishing contract): | Licence according to publishing contract |
| Departement: | School of Engineering |
| Organisational Unit: | Institute of Data Analysis and Process Design (IDP) |
| Appears in collections: | Publikationen School of Engineering |
Files in This Item:
There are no files associated with this item.
Show full item record
Sedding, H. A. (2020). Time-dependent path scheduling : algorithmic minimization of walking time at the moving assembly line (1st Edition) [Doctoral dissertation, Springer]. https://doi.org/10.1007/978-3-658-28415-2
Sedding, H.A. (2020) Time-dependent path scheduling : algorithmic minimization of walking time at the moving assembly line. 1st Edition. Doctoral dissertation. Springer. Available at: https://doi.org/10.1007/978-3-658-28415-2.
H. A. Sedding, “Time-dependent path scheduling : algorithmic minimization of walking time at the moving assembly line,” Doctoral dissertation, Springer, Wiesbaden, 2020. doi: 10.1007/978-3-658-28415-2.
SEDDING, Helmut A., 2020. Time-dependent path scheduling : algorithmic minimization of walking time at the moving assembly line. Doctoral dissertation. Wiesbaden: Springer
Sedding, Helmut A. 2020. “Time-Dependent Path Scheduling : Algorithmic Minimization of Walking Time at the Moving Assembly Line.” Doctoral dissertation, Wiesbaden: Springer. https://doi.org/10.1007/978-3-658-28415-2.
Sedding, Helmut A. Time-Dependent Path Scheduling : Algorithmic Minimization of Walking Time at the Moving Assembly Line. 1st Edition, Springer, 2020, https://doi.org/10.1007/978-3-658-28415-2.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.