TY - JOUR
T1 - Optimal cyclic scheduling of a robotic flowshop with multiple part types and flexible processing times
AU - Lei, Weidong
AU - Che, Ada
AU - Chu, Chengbin
PY - 2014
Y1 - 2014
N2 - This paper proposes a branch-and-bound algorithm for cyclic scheduling of a robotic flowshop with multiple part types in which the processing times of parts can vary within their given time windows. The problem consists of two types of sequencing issues: part input sequencing and robot move sequencing. We give a formulation for the problem and propose a branch-and-bound algorithm based on the properties of the developed model. The proposed branch-and-bound algorithm consists of three nested procedures, called procedures A, B and C, respectively. Procedures A and B are mainly designed for enumerating part input sequences, while procedure C is responsible for enumerating robot move sequences. To reduce the solution space and speed up the algorithm, we derive the upper bound of the number of parts that can be serviced by the robot within a cycle. Computational results on both benchmark and randomly generated instances are reported.
AB - This paper proposes a branch-and-bound algorithm for cyclic scheduling of a robotic flowshop with multiple part types in which the processing times of parts can vary within their given time windows. The problem consists of two types of sequencing issues: part input sequencing and robot move sequencing. We give a formulation for the problem and propose a branch-and-bound algorithm based on the properties of the developed model. The proposed branch-and-bound algorithm consists of three nested procedures, called procedures A, B and C, respectively. Procedures A and B are mainly designed for enumerating part input sequences, while procedure C is responsible for enumerating robot move sequences. To reduce the solution space and speed up the algorithm, we derive the upper bound of the number of parts that can be serviced by the robot within a cycle. Computational results on both benchmark and randomly generated instances are reported.
KW - Branch-and-bound algorithm
KW - Cyclic hoist scheduling
KW - Flexible processing times
KW - Minimal part set
KW - MPS
KW - Robotic flowshop
UR - http://www.scopus.com/inward/record.url?scp=84898947178&partnerID=8YFLogxK
U2 - 10.1504/EJIE.2014.060434
DO - 10.1504/EJIE.2014.060434
M3 - 文章
AN - SCOPUS:84898947178
SN - 1751-5254
VL - 8
SP - 143
EP - 167
JO - European Journal of Industrial Engineering
JF - European Journal of Industrial Engineering
IS - 2
ER -