Skip to Main content Skip to Navigation
Journal articles

Multi-degree cyclic hoist scheduling with time window constraints

Ada Che 1 Zhen Zhou 1 Chengbin Chu 2 Haoxun Chen 3
1 NPU - Northwestern Polytechnical University [Xi'an]
2 LGI - Laboratoire Génie Industriel - EA 2606
3 LOSI - Laboratoire d'Optimisation des Systèmes Industriels
ICD - Institut Charles Delaunay
Abstract : This paper deals with the multi-degree cyclic single-hoist scheduling problem with time window constraints, in which multiple identical parts enter and leave the system during each cycle. We propose an analytical mathematical model and a branch-and-bound algorithm so as to find a cyclic sequence of hoist moves that maximises the throughput. The branch-and-bound algorithm implicitly enumerates the sequence of hoist moves and requires the solution of a specific set of linear programming problems (LPPs). Computational results on benchmark instances and randomly generated test instances are presented.
Keywords : cyclic hoist scheduling multi-degree time window constraints branch-and-bound
Document type :
Journal articles
Complete list of metadatas
https://hal-utt.archives-ouvertes.fr/hal-02499213
Contributor : Daniel Gavrysiak <>
Submitted on : Thursday, March 5, 2020 - 10:21:26 AM
Last modification on : Wednesday, July 15, 2020 - 10:36:13 AM

Identifiers

Collections

ROSAS | UTT | LGI | CNRS

Citation

Ada Che, Zhen Zhou, Chengbin Chu, Haoxun Chen. Multi-degree cyclic hoist scheduling with time window constraints. International Journal of Production Research, Taylor & Francis, 2011, 49 (19), pp.5679-5693. ⟨10.1080/00207543.2010.503200⟩. ⟨hal-02499213⟩

Export

BibTeX TEI DC DCterms EndNote

Share

Metrics

Record views

51