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

Atabak Elmi, Seyda Topaloglu

Research output: Contribution to journalArticleResearchpeer-review

Abstract

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 metaheuristic algorithm is examined by a computational study on a set of randomly generated problem instances.

Original languageEnglish
Pages (from-to)67-83
Number of pages17
JournalComputers and Operations Research
Volume73
DOIs
Publication statusPublished - 1 Sep 2016
Externally publishedYes

Keywords

  • Cyclic scheduling
  • Multiple robots
  • Robotic cell
  • Scheduling

Cite this

@article{36076db6f97445439405219b79fcde60,
title = "Multi-degree cyclic flow shop robotic cell scheduling problem: Ant colony optimization",
abstract = "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 metaheuristic algorithm is examined by a computational study on a set of randomly generated problem instances.",
keywords = "Cyclic scheduling, Multiple robots, Robotic cell, Scheduling",
author = "Atabak Elmi and Seyda Topaloglu",
year = "2016",
month = "9",
day = "1",
doi = "10.1016/j.cor.2016.03.007",
language = "English",
volume = "73",
pages = "67--83",
journal = "Computers and Operations Research",
issn = "0305-0548",
publisher = "Elsevier",

}

Multi-degree cyclic flow shop robotic cell scheduling problem : Ant colony optimization. / Elmi, Atabak; Topaloglu, Seyda.

In: Computers and Operations Research, Vol. 73, 01.09.2016, p. 67-83.

Research output: Contribution to journalArticleResearchpeer-review

TY - JOUR

T1 - Multi-degree cyclic flow shop robotic cell scheduling problem

T2 - Ant colony optimization

AU - Elmi, Atabak

AU - Topaloglu, Seyda

PY - 2016/9/1

Y1 - 2016/9/1

N2 - 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 metaheuristic algorithm is examined by a computational study on a set of randomly generated problem instances.

AB - 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 metaheuristic algorithm is examined by a computational study on a set of randomly generated problem instances.

KW - Cyclic scheduling

KW - Multiple robots

KW - Robotic cell

KW - Scheduling

UR - http://www.scopus.com/inward/record.url?scp=84962859061&partnerID=8YFLogxK

U2 - 10.1016/j.cor.2016.03.007

DO - 10.1016/j.cor.2016.03.007

M3 - Article

VL - 73

SP - 67

EP - 83

JO - Computers and Operations Research

JF - Computers and Operations Research

SN - 0305-0548

ER -