Cyclic scheduling of a hoist with time window constraints - Archive ouverte HAL Access content directly
Journal Articles IEEE Transactions on Robotics and Automation Year : 1998

Cyclic scheduling of a hoist with time window constraints

(1, 2, 3) , (4) , (1, 5)
1
2
3
4
5

Abstract

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.

Dates and versions

hal-02492942 , version 1 (27-02-2020)

Identifiers

Cite

Haoxun Chen, Chengbin Chu, Jean-Marie Proth. Cyclic scheduling of a hoist with time window constraints. IEEE Transactions on Robotics and Automation, 1998, 14 (1), pp.144-152. ⟨10.1109/70.660860⟩. ⟨hal-02492942⟩
16 View
0 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More