Multi-degree cyclic hoist scheduling with time window constraints - Archive ouverte HAL Access content directly
Journal Articles International Journal of Production Research Year : 2011

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.
Not file

Dates and versions

hal-02499213 , version 1 (05-03-2020)

Identifiers

Cite

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

Altmetric

Share

Gmail Facebook Twitter LinkedIn More