Skip to Main content Skip to Navigation
Journal articles

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 Otto-von-Guericke-Universität Magdeburg
4 LOSI - Laboratoire d'Optimisation des Systèmes Industriels
ICD - Institut Charles Delaunay
5 University of Maryland [College Park]
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 (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
Document type :
Journal articles
Complete list of metadata
https://hal-utt.archives-ouvertes.fr/hal-02492942
Contributor : Daniel Gavrysiak Connect in order to contact the contributor
Submitted on : Thursday, February 27, 2020 - 2:42:48 PM
Last modification on : Friday, August 27, 2021 - 3:14:07 PM

Links full text

openaccess

Identifiers

Collections

TDS-MACS | INRIA | UTT | CNRS

Citation

Haoxun Chen, Chengbin Chu, Jean-Marie Proth. Cyclic scheduling of a hoist with time window constraints. IEEE Transactions on Robotics and Automation, Institute of Electrical and Electronics Engineers (IEEE), 1998, 14 (1), pp.144-152. ⟨10.1109/70.660860⟩. ⟨hal-02492942⟩

Export

BibTeX TEI DC DCterms EndNote

Share

Metrics

Record views

67