Cyclic scheduling of a hoist with time window constraints

Haoxun Chen (1, 2, 3) , Chengbin Chu (4) , Jean-Marie Proth (1, 5)

1 INRIA Lorraine
2 Systems Engineering Institute, Xi’an University
3 OVGU - Otto-von-Guericke-Universität Magdeburg = Otto-von-Guericke University [Magdeburg]
4 LOSI - Laboratoire d'Optimisation des Systèmes Industriels
5 University of Maryland [College Park]

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.

Keywords: Time factors; Job shop scheduling; Processor scheduling; Iterative algorithms; Scheduling algorithm; Printed circuits; Linear programming; Chemicals; Computer industry; Materials handling

Domains: Operations Research [cs.RO]; Automatic

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⟩