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.
Type de document :
Rapport
[Research Report] RR-2307, INRIA. 1994, pp.19
Liste complète des métadonnées

https://hal.inria.fr/inria-00074366
Contributeur : Rapport de Recherche Inria <>
Soumis le : mercredi 24 mai 2006 - 15:09:37
Dernière modification le : samedi 17 septembre 2016 - 01:06:54
Document(s) archivé(s) le : mardi 12 avril 2011 - 16:43:50

Fichiers

Identifiants

  • 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〉

Partager

Métriques

Consultations de la notice

376

Téléchargements de fichiers

73