menu 简单麦麦
account_circle

时变路径调度:移动装配线行走时间最小化算法-Time-Dependent Path Scheduling: Algorithmic Minimization of Walking Time at th

帮助2578人找到了他们想要的文件
上传于 2020-03-06 18次下载 5274次围观
文件编号:11182
文件详情
标题(title):Time-Dependent Path Scheduling: Algorithmic Minimization of Walking Time at the Moving Assembly Line
时变路径调度:移动装配线行走时间最小化算法
作者(author):Helmut A. Sedding
出版社(publisher):Springer Fachmedien Wiesbaden;Springer Vieweg
大小(size):2 MB (2208551 bytes)
格式(extension):pdf
注意:如果文件下载完成后为无法打开的格式,请修改后缀名为格式对应后缀



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
下载方式
购买后可查看 购买按钮在底部

常见问题

  • question_answer
    解压密码,提取码在哪?
    keyboard_arrow_down
    • 均在下载旁边哦,请注意查看,如果没有则是不需要密码
  • question_answer
    文件不符合描述怎么办?
    keyboard_arrow_down
    • 如果有文件问题,可以通过 卖家联系方式 联系卖家,如果 联系不上卖家 或 卖家无法解决则可以在我的订单页面申请售后
  • question_answer
    其他
    keyboard_arrow_down
    • 3.本文件为公益分享,文件由网上采集而来,如有侵权等问题,请及时联系客服删除
      常见问题及官方客服联系方式:点击前往
      售后问题处理方式:点击前往
-到底部了哦-
微信扫码支付
时变路径调度:移动装配线行走时间最小化算法-Time-Dependent Path Scheduling: Algorithmic Minimization of Walking Time at th
支付金额: 共计:¥0.0

添加收藏

创建新合集