000 | 03599nam a22005295i 4500 | ||
---|---|---|---|
001 | 978-3-658-28415-2 | ||
003 | DE-He213 | ||
005 | 20240423125152.0 | ||
007 | cr nn 008mamaa | ||
008 | 191122s2020 gw | s |||| 0|eng d | ||
020 |
_a9783658284152 _9978-3-658-28415-2 |
||
024 | 7 |
_a10.1007/978-3-658-28415-2 _2doi |
|
050 | 4 | _aQA76.9.A43 | |
072 | 7 |
_aUMB _2bicssc |
|
072 | 7 |
_aCOM051300 _2bisacsh |
|
072 | 7 |
_aUMB _2thema |
|
082 | 0 | 4 |
_a518.1 _223 |
100 | 1 |
_aSedding, Helmut A. _eauthor. _4aut _4http://id.loc.gov/vocabulary/relators/aut |
|
245 | 1 | 0 |
_aTime-Dependent Path Scheduling _h[electronic resource] : _bAlgorithmic Minimization of Walking Time at the Moving Assembly Line / _cby Helmut A. Sedding. |
250 | _a1st ed. 2020. | ||
264 | 1 |
_aWiesbaden : _bSpringer Fachmedien Wiesbaden : _bImprint: Springer Vieweg, _c2020. |
|
300 |
_aXXIII, 169 p. 20 illus., 3 illus. in color. _bonline resource. |
||
336 |
_atext _btxt _2rdacontent |
||
337 |
_acomputer _bc _2rdamedia |
||
338 |
_aonline resource _bcr _2rdacarrier |
||
347 |
_atext file _bPDF _2rda |
||
505 | 0 | _aOptimization Models for Minimizing Worker Walking Time Along Moving Assembly Lines -- Complexity Analyses, Combinatorial Properties, and Optimization Algorithms -- Numerical Experiments and Statistical Analyses. | |
520 | _aMoving 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. Contents 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. | ||
650 | 0 | _aAlgorithms. | |
650 | 0 | _aOperations research. | |
650 | 0 | _aManagement science. | |
650 | 0 | _aIndustrial engineering. | |
650 | 0 | _aProduction engineering. | |
650 | 1 | 4 | _aAlgorithms. |
650 | 2 | 4 | _aOperations Research, Management Science. |
650 | 2 | 4 | _aIndustrial and Production Engineering. |
710 | 2 | _aSpringerLink (Online service) | |
773 | 0 | _tSpringer Nature eBook | |
776 | 0 | 8 |
_iPrinted edition: _z9783658284145 |
776 | 0 | 8 |
_iPrinted edition: _z9783658284169 |
856 | 4 | 0 | _uhttps://doi.org/10.1007/978-3-658-28415-2 |
912 | _aZDB-2-SCS | ||
912 | _aZDB-2-SXCS | ||
942 | _cSPRINGER | ||
999 |
_c174996 _d174996 |