Cyclic scheduling of a hoist with time window constraints
Cyclic scheduling of a hoist with time window constraints
复制标题
DOI：
10.1109/70.660860
复制
发表时间：
1998-02
期刊：
影响因子：
--
通讯作者：
Haoxun Chen;C. Chu;J. Proth
中科院分区：
文献类型：
--
作者：
Haoxun Chen;C. Chu;J. Proth
本文提出了一种模型和一种相关算法，用于在印刷电路板（PCB）电镀设施中使用时间窗口约束来生成最佳的吊装移动循环时间表。该算法基于分支和约束方法，需要解决特定类别的线性编程问题（LPP）的解决方案。这些LPP等同于双值图中的周期时间评估问题。提出了计算经验，以比较使用这种新算法获得的结果与文献中提出的结果。
This paper proposes a model and a related algorithm for generating optimal cyclic schedules of hoist moves with time window constraints in a printed circuit board (PCB) electroplating facility. The algorithm is based on the branch and bound approach and requires the solution of a specific class of linear programming problems (LPP). These LPP are equivalent to the problems of the cycle time evaluation in bi-valued graphs. Computational experience is presented to compare the results obtained using this new algorithm with the ones proposed in the literature.