Multi-degree cyclic hoist scheduling with time window constraints

Ada Che, Zhen Zhou, Chengbin Chu, Haoxun Chen

科研成果: 期刊稿件文章同行评审

36 引用 (Scopus)

摘要

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.

源语言英语
页(从-至)5679-5693
页数15
期刊International Journal of Production Research
49
19
DOI
出版状态已出版 - 1 10月 2011

指纹

探究 'Multi-degree cyclic hoist scheduling with time window constraints' 的科研主题。它们共同构成独一无二的指纹。

引用此