Multi-degree cyclic flow shop robotic cell scheduling problem: Ant colony optimization

Elmi A., Topaloglu Ş. A.

COMPUTERS & OPERATIONS RESEARCH, cilt.73, ss.67-83, 2016 (SCI-Expanded) identifier identifier

  • Yayın Türü: Makale / Tam Makale
  • Cilt numarası: 73
  • Basım Tarihi: 2016
  • Doi Numarası: 10.1016/j.cor.2016.03.007
  • Dergi Adı: COMPUTERS & OPERATIONS RESEARCH
  • Derginin Tarandığı İndeksler: Science Citation Index Expanded (SCI-EXPANDED), Scopus
  • Sayfa Sayıları: ss.67-83
  • Anahtar Kelimeler: Scheduling, Robotic cell, Cyclic scheduling, Multiple robots, TIME-WINDOW CONSTRAINTS, POLYNOMIAL ALGORITHM, PROCESSING TIMES, HOIST, FLOWSHOPS, MACHINES, PARTS
  • Dokuz Eylül Üniversitesi Adresli: Evet

Özet

This paper deals with the multi-degree cyclic robotic flow shop cell scheduling problem with multiple robots. All the parts are processed successively through the machines with standard processing times while single gripper robots perform the transportation operations of parts between the machines. Due to the special characteristics of the considered problem, a metaheuristic algorithm based on ant colony optimization has been proposed. The proposed algorithm simultaneously determines the optimal degree of the cyclic schedule, the robot assignments for the transportation operations, and the optimal sequence of robots' moves, which in return maximize the throughput rate. The efficiency of the proposed meta heuristic algorithm is examined by a computational study on a set of randomly generated problem instances. (C) 2016 Elsevier Ltd. All rights reserved.