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.
Original language | English |
---|---|
Pages (from-to) | 5679-5693 |
Number of pages | 15 |
Journal | International Journal of Production Research |
Volume | 49 |
Issue number | 19 |
DOIs | |
State | Published - 1 Oct 2011 |
Keywords
- branch-and-bound
- cyclic hoist scheduling
- multi-degree
- time window constraints