HAL will be down for maintenance from Friday, June 10 at 4pm through Monday, June 13 at 9am. More information
Skip to Main content Skip to Navigation

Cyclic Scheduling of a Hoist with time window constraints

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 (LPPs). These LPPs 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.
Document type :
Complete list of metadata

Contributor : Rapport de Recherche Inria Connect in order to contact the contributor
Submitted on : Wednesday, May 24, 2006 - 3:09:37 PM
Last modification on : Friday, February 4, 2022 - 3:23:54 AM
Long-term archiving on: : Tuesday, April 12, 2011 - 4:43:50 PM


  • HAL Id : inria-00074366, version 1



Haoxun Chen, Chengbin Chu, Jean-Marie Proth. Cyclic Scheduling of a Hoist with time window constraints. [Research Report] RR-2307, INRIA. 1994, pp.19. ⟨inria-00074366⟩



Record views


Files downloads