Зарегистрироваться
Восстановить пароль
FAQ по входу

Sedding H.A. Time-Dependent Path Scheduling. Algorithmic Minimization of Walking Time at the Moving Assembly Line

  • Файл формата pdf
  • размером 2,11 МБ
  • Добавлен пользователем
  • Описание отредактировано
Sedding H.A. Time-Dependent Path Scheduling. Algorithmic Minimization of Walking Time at the Moving Assembly Line
Springer, 2020. — 177 p. — ISBN: 9783658284152, 9783658284145.
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.
  • Чтобы скачать этот файл зарегистрируйтесь и/или войдите на сайт используя форму сверху.
  • Регистрация