期刊文献+

一个改进的单抓钩周期性排序模型及其在自动化学处理线中的应用 被引量:2

A Modified Model of Single Hoist Cyclic Scheduling and Its Applicationin Automated Chemical Handling Line
下载PDF
导出
摘要 计算机控制的抓钩广泛用于自动化学处理线的工件的运送。抓钩的排序直接影响系统的生产率,抓钩排序的目标是对运送进行排序以极大化生产率。当某工序处理时间非常长时,该工序成为瓶颈。为了去除该瓶颈,系统可以为该工序设计多个处理槽,这称为“多重处理槽”问题。本文提出一个改进的混合整数规划模型以求解有“多重处理槽”的单抓钩周期性排序问题的最优解。实例表明所提出的方法是有效的。 The hoist controlled by computer is widely used for moving jobs in automated chemical handling line. The hoist scheduling directly affects the throughput of the system, and the objective of hoist scheduling is to schedule the moves to maximize the throughput. When the processing time of some a stage is very long, the stage becomes bottleneck. To remove the bottleneck, the system may be designed to have several tanks for that stage, which is called multi-tank problem. This paper proposes a modified mixed interger linear programming model to optimize the single hoist cyclic scheduling problem with multi-tank and an example shows that purposed method is validate.
出处 《高技术通讯》 EI CAS CSCD 2003年第9期59-62,共4页 Chinese High Technology Letters
基金 国家自然科学基金(59990470-4) 西安交大机械制造系统工程国家重点实验室基金资助项目。
关键词 抓钩排序 Phillips模型 自动化学处理线 应用 周期性 多重处理槽 整数规划模型 Hoist scheduling problem, Mixed integer linear programming, Multi-tank
  • 相关文献

参考文献1

二级参考文献3

共引文献3

同被引文献121

  • 1周支立,李怀祖.具有材料搬运装置的机器排序问题综述[J].中国机械工程,2001,12(z1):165-168. 被引量:1
  • 2KIM J H,LEE T E.Schedulability analysis of time-constrained cluster tools with bounded time variation by an extended Petri net[J].IEEE Trans on Automation Science and Engineering,2008,5(3):490-503.
  • 3WU Nai-qi,CHU Cheng-bin,CHU Feng,et al.A Petri net method for schedulability and scheduling problems in single-arm cluster tools with wafer residency time constraints[J].IEEE Trans on Semiconductor Manufacturing,2008,21(2):224-237.
  • 4LEUNG J,ZHANG Guo-qing.Optimal cyclic scheduling for printed-circuit-board production lines with multiple hoists and general proces-sing sequences[J].IEEE Trans on Robotics and Automation,2003,19(3):480-484.
  • 5CHE A-da,CHU Cheng-bin,CHU Feng.Multicyclic hoist scheduling with constant processing times[J].IEEE Trans on Robotics and Automation,2002,18(1):69-80.
  • 6AGNETIS A.Scheduling no-wait robotic cells with two and three machines[J].European Journal of Operational Research,2000,123(2):303-314.
  • 7TANG Li-xin,XIE Xie,LIU Ji-yin.Scheduling of a single crane in batch annealing process[J].Computers & Operations Research,2009,36(10):2853-2865.
  • 8DAWANDE M,GEISMARH N,SETHI S,et al.Sequencing and scheduling in robotic cells:recent developments[J].Journal of Scheduling,2005,8(5):387-426.
  • 9CHE A-da,CHU Cheng-bin.Multi-degree cyclic scheduling of two robots in a no-wait flowshop[J].IEEE Trans on Automation Science and Engineering,2005,2(2):173-183.
  • 10LEI L,WANG T.A proof:the cyclic hoist scheduling problem is NP-hard[R].New Jersey:Rutgers University,1989.

引证文献2

二级引证文献13

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部