Abstract
This paper addresses the robotic scheduling problem in blocking hybrid flow shop cells that consider multiple part-types, different speed parallel machines at each stage, machine eligibility constraints and a single transportation robot to move the parts between stages. Initially, a mixed integer linear programming (MILP) model is proposed to minimise the makespan. Due to the complexity of the model, a simulated annealing (SA)-based solution approach is developed to solve the problem. This approach uses both simple insertion method and a new neighbourhood structure based on block properties while generating neighbour solutions, which yields two different SA algorithms respectively. The performance of proposed SA approach is assessed over a set of randomly generated instances. The computational results demonstrate that the SA algorithm is effective with the employed neighbourhood structure for this problem.
| Original language | English |
|---|---|
| Pages (from-to) | 1144-1159 |
| Number of pages | 16 |
| Journal | International Journal of Computer Integrated Manufacturing |
| Volume | 27 |
| Issue number | 12 |
| DOIs | |
| Publication status | Published - 2 Dec 2014 |
| Externally published | Yes |
Keywords
- Blocking
- Hybrid flow shop
- robotic cell
- Simulated annealing
- Single robot
Cite this
}
Scheduling multiple parts in hybrid flow shop robotic cells served by a single robot. / Elmi, Atabak; Topaloglu, Seyda.
In: International Journal of Computer Integrated Manufacturing, Vol. 27, No. 12, 02.12.2014, p. 1144-1159.Research output: Contribution to journal › Article › Research › peer-review
TY - JOUR
T1 - Scheduling multiple parts in hybrid flow shop robotic cells served by a single robot
AU - Elmi, Atabak
AU - Topaloglu, Seyda
PY - 2014/12/2
Y1 - 2014/12/2
N2 - This paper addresses the robotic scheduling problem in blocking hybrid flow shop cells that consider multiple part-types, different speed parallel machines at each stage, machine eligibility constraints and a single transportation robot to move the parts between stages. Initially, a mixed integer linear programming (MILP) model is proposed to minimise the makespan. Due to the complexity of the model, a simulated annealing (SA)-based solution approach is developed to solve the problem. This approach uses both simple insertion method and a new neighbourhood structure based on block properties while generating neighbour solutions, which yields two different SA algorithms respectively. The performance of proposed SA approach is assessed over a set of randomly generated instances. The computational results demonstrate that the SA algorithm is effective with the employed neighbourhood structure for this problem.
AB - This paper addresses the robotic scheduling problem in blocking hybrid flow shop cells that consider multiple part-types, different speed parallel machines at each stage, machine eligibility constraints and a single transportation robot to move the parts between stages. Initially, a mixed integer linear programming (MILP) model is proposed to minimise the makespan. Due to the complexity of the model, a simulated annealing (SA)-based solution approach is developed to solve the problem. This approach uses both simple insertion method and a new neighbourhood structure based on block properties while generating neighbour solutions, which yields two different SA algorithms respectively. The performance of proposed SA approach is assessed over a set of randomly generated instances. The computational results demonstrate that the SA algorithm is effective with the employed neighbourhood structure for this problem.
KW - Blocking
KW - Hybrid flow shop
KW - robotic cell
KW - Simulated annealing
KW - Single robot
UR - http://www.scopus.com/inward/record.url?scp=84926106654&partnerID=8YFLogxK
U2 - 10.1080/0951192X.2013.874576
DO - 10.1080/0951192X.2013.874576
M3 - Article
VL - 27
SP - 1144
EP - 1159
JO - International Journal of Computer Integrated Manufacturing
JF - International Journal of Computer Integrated Manufacturing
SN - 0951-192X
IS - 12
ER -