摘要
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 |