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

Atabak Elmi, Seyda Topaloglu

Research output: Contribution to journalArticleResearchpeer-review

Abstract

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.

Original languageEnglish
Pages (from-to)805-821
Number of pages17
JournalInternational Journal of Computer Integrated Manufacturing
Volume30
Issue number8
DOIs
Publication statusPublished - 3 Aug 2017
Externally publishedYes

Keywords

  • cyclic scheduling
  • mixed-integer linear programming
  • multiple robots
  • robotic cell

Cite this

@article{daefdabc726649ec8cb08db9c275aec3,
title = "Multi-degree cyclic flow shop robotic cell scheduling problem with multiple robots",
abstract = "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.",
keywords = "cyclic scheduling, mixed-integer linear programming, multiple robots, robotic cell",
author = "Atabak Elmi and Seyda Topaloglu",
year = "2017",
month = "8",
day = "3",
doi = "10.1080/0951192X.2016.1210231",
language = "English",
volume = "30",
pages = "805--821",
journal = "International Journal of Computer Integrated Manufacturing",
issn = "0951-192X",
publisher = "Taylor & Francis",
number = "8",

}

Multi-degree cyclic flow shop robotic cell scheduling problem with multiple robots. / Elmi, Atabak; Topaloglu, Seyda.

In: International Journal of Computer Integrated Manufacturing, Vol. 30, No. 8, 03.08.2017, p. 805-821.

Research output: Contribution to journalArticleResearchpeer-review

TY - JOUR

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

AU - Elmi, Atabak

AU - Topaloglu, Seyda

PY - 2017/8/3

Y1 - 2017/8/3

N2 - 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.

AB - 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.

KW - cyclic scheduling

KW - mixed-integer linear programming

KW - multiple robots

KW - robotic cell

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

U2 - 10.1080/0951192X.2016.1210231

DO - 10.1080/0951192X.2016.1210231

M3 - Article

VL - 30

SP - 805

EP - 821

JO - International Journal of Computer Integrated Manufacturing

JF - International Journal of Computer Integrated Manufacturing

SN - 0951-192X

IS - 8

ER -