摘要
计算机控制的抓钩广泛用于自动化学处理线的工件的运送。抓钩的排序直接影响系统的生产率,抓钩排序的目标是对运送进行排序以极大化生产率。当某工序处理时间非常长时,该工序成为瓶颈。为了去除该瓶颈,系统可以为该工序设计多个处理槽,这称为“多重处理槽”问题。本文提出一个改进的混合整数规划模型以求解有“多重处理槽”的单抓钩周期性排序问题的最优解。实例表明所提出的方法是有效的。
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)
西安交大机械制造系统工程国家重点实验室基金资助项目。