Scheduling multiple parts in hybrid flow shop robotic cells served by a single robot

Elmi A., Topaloglu Ş. A.

INTERNATIONAL JOURNAL OF COMPUTER INTEGRATED MANUFACTURING, cilt.27, sa.12, ss.1144-1159, 2014 (SCI-Expanded) identifier identifier

  • Yayın Türü: Makale / Tam Makale
  • Cilt numarası: 27 Sayı: 12
  • Basım Tarihi: 2014
  • Doi Numarası: 10.1080/0951192x.2013.874576
  • Dergi Adı: INTERNATIONAL JOURNAL OF COMPUTER INTEGRATED MANUFACTURING
  • Derginin Tarandığı İndeksler: Science Citation Index Expanded (SCI-EXPANDED), Scopus
  • Sayfa Sayıları: ss.1144-1159
  • Anahtar Kelimeler: robotic cell, hybrid flow shop, blocking, single robot, simulated annealing, TABU SEARCH ALGORITHM, PARALLEL MACHINES, OPTIMIZATION, SYSTEM, COMPLEXITY
  • Dokuz Eylül Üniversitesi Adresli: Evet

Özet

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.