 |
Journal articles
Multi-degree cyclic hoist scheduling with time window constraints
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.
https://hal-utt.archives-ouvertes.fr/hal-02499213
Contributor : Daniel Gavrysiak Connect in order to contact the contributor
Submitted on : Thursday, March 5, 2020 - 10:21:26 AM
Last modification on : Saturday, August 28, 2021 - 3:02:16 AM
Contributor : Daniel Gavrysiak Connect in order to contact the contributor
Submitted on : Thursday, March 5, 2020 - 10:21:26 AM
Last modification on : Saturday, August 28, 2021 - 3:02:16 AM