1. ZHAW digitalcollection
  2. School of Engineering
  3. Publikationen
  4. Publikationen School of Engineering
Full metadata record
DC FieldValueLanguage
dc.contributor.authorSedding, Helmut A.-
dc.date.accessioned2019-12-13T14:13:48Z-
dc.date.available2019-12-13T14:13:48Z-
dc.date.issued2020-
dc.identifier.isbn978-3-658-28414-5de_CH
dc.identifier.isbn978-3-658-28415-2de_CH
dc.identifier.urihttps://digitalcollection.zhaw.ch/handle/11475/18914-
dc.descriptionDissertation, Universität Ulm, Germany, 2019de_CH
dc.description.abstractMoving 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.de_CH
dc.format.extent169de_CH
dc.language.isoende_CH
dc.publisherSpringerde_CH
dc.rightsLicence according to publishing contractde_CH
dc.subjectTime-dependent schedulingde_CH
dc.subjectNonmonotonic processing timede_CH
dc.subjectCombinatorial algorithmde_CH
dc.subjectComplexity analysisde_CH
dc.subjectProduction planningde_CH
dc.subjectAutomobile productionde_CH
dc.subjectMoving assembly linede_CH
dc.subjectTime-dependent walking timede_CH
dc.subjectWalking time minimizationde_CH
dc.subject.ddc658.5: Produktionssteuerungde_CH
dc.titleTime-dependent path scheduling : algorithmic minimization of walking time at the moving assembly linede_CH
dc.typeDissertationde_CH
dcterms.typeTextde_CH
zhaw.departementSchool of Engineeringde_CH
zhaw.organisationalunitInstitut für Datenanalyse und Prozessdesign (IDP)de_CH
zhaw.publisher.placeWiesbadende_CH
dc.identifier.doi10.1007/978-3-658-28415-2de_CH
zhaw.edition1st Editionde_CH
zhaw.originated.zhawNode_CH
zhaw.author.additionalNode_CH
Appears in collections:Publikationen School of Engineering

Files in This Item:
There are no files associated with this item.
Show simple 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.