Multi-degree cyclic flow shop robotic cell scheduling problem with multiple robots

Elmi A., Topaloglu Ş. A.

INTERNATIONAL JOURNAL OF COMPUTER INTEGRATED MANUFACTURING, cilt.30, sa.8, ss.805-821, 2017 (SCI-Expanded) identifier identifier

  • Yayın Türü: Makale / Tam Makale
  • Cilt numarası: 30 Sayı: 8
  • Basım Tarihi: 2017
  • Doi Numarası: 10.1080/0951192x.2016.1210231
  • Dergi Adı: INTERNATIONAL JOURNAL OF COMPUTER INTEGRATED MANUFACTURING
  • Derginin Tarandığı İndeksler: Science Citation Index Expanded (SCI-EXPANDED), Scopus
  • Sayfa Sayıları: ss.805-821
  • Anahtar Kelimeler: robotic cell, cyclic scheduling, multiple robots, mixed-integer linear programming, INTEGER PROGRAMMING APPROACH, TIME-WINDOW CONSTRAINTS, PROCESSING TIMES, HOIST, ALGORITHM, PARTS
  • Dokuz Eylül Üniversitesi Adresli: Evet

Özet

This paper deals with the cyclic flow shop robotic cell scheduling problem with multiple robots, in which parts are processed successively on multiple machines with lower and upper bounds on processing times and the robots execute the transportation of parts between the machines. A novel mixed-integer linear programming model has been proposed for this problem. The proposed model simultaneously determines the optimal degree of the cyclic schedule and the optimal sequencing of the robots moves, which in return maximises the throughput rate. The validity of the proposed model is examined by a computational study on a set of randomly generated problem instances and solved using commercial optimisation software GAMS. The computational experiments indicate the efficiency of proposed model.