Skip to Main content Skip to Navigation
Reports

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 :
Reports
Complete list of metadatas

https://hal.inria.fr/inria-00074366
Contributor : Rapport de Recherche Inria <>
Submitted on : Wednesday, May 24, 2006 - 3:09:37 PM
Last modification on : Friday, February 28, 2020 - 1:01:13 AM
Long-term archiving on: : Tuesday, April 12, 2011 - 4:43:50 PM

Identifiers

  • HAL Id : inria-00074366, version 1

Collections

Citation

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⟩

Share

Metrics

Record views

454

Files downloads

366