Mathematical Programming Solution of a Hoist Scheduling Program
Mathematical Programming Solution of a Hoist Scheduling Program
复制标题
DOI：
10.1080/05695557608975070
复制
发表时间：
1976-06
期刊：
影响因子：
--
通讯作者：
L. Phillips;P. S. Unger
中科院分区：
文献类型：
--
作者：
L. Phillips;P. S. Unger
摘要本文描述了一个混合整数规划模型的过程中，电子线路板的化学处理，在一个序列的坦克。木板必须在规定的范围内保持在这些槽中一段时间。将对提升机构进行编程，以将板放入罐中，从罐中取出板，并在罐之间运输板，从而最大化系统的吞吐量。文中给出了计算经验和一个详细的算例。
Abstract This paper describes a mixed integer programming model of a process during which electronic circuit boards are chemically treated in a sequence of tanks. The boards must remain in these tanks for periods of time lying within specified bounds. A hoist mechanism is to be programmed to place boards into tanks, remove boards from tanks, and transport boards between tanks, so as to maximize the throughput of the system. Computational experience and a detailed example are given.