Cyclic Scheduling of a Hoist with time window constraints - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports (Research Report) Year : 1994

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.
Fichier principal
Vignette du fichier
RR-2307.pdf (804.73 Ko) Télécharger le fichier

Dates and versions

inria-00074366 , version 1 (24-05-2006)

Identifiers

  • HAL Id : inria-00074366 , version 1

Cite

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⟩
177 View
272 Download

Share

Gmail Facebook Twitter LinkedIn More