An improved algorithm for cyclic flowshop scheduling in a robotic cell

Eugene Levner; Vladimir Kats; Vadim E. Levit

doi:10.1016/S0377-2217(96)00272-X

An improved algorithm for cyclic flowshop scheduling in a robotic cell

Eugene Levner, Vladimir Kats, Vadim E. Levit

Research output: Contribution to journal › Article › peer-review

99 Scopus citations

Abstract

This paper addresses a cyclic robot scheduling problem in an automated manufacturing line in which a single robot is used to move parts from one workstation to another. The objective is to minimize the cycle length. Previously known algorithms are either heuristic or at best polynomial of the fifth degree in the number of machines, m. We derive an exact scheduling algorithm solving the problem in O(m³ log m) time.

Original language	English
Pages (from-to)	500-508
Number of pages	9
Journal	European Journal of Operational Research
Volume	97
Issue number	3
DOIs	https://doi.org/10.1016/S0377-2217(96)00272-X
State	Published - 16 Mar 1997
Externally published	Yes

Keywords

Complexity
Cyclic scheduling
Minimal cycle
Transporting robot

Access to Document

10.1016/S0377-2217(96)00272-X

Cite this

@article{20d269f11c644deb95c79093f14754d9,

title = "An improved algorithm for cyclic flowshop scheduling in a robotic cell",

abstract = "This paper addresses a cyclic robot scheduling problem in an automated manufacturing line in which a single robot is used to move parts from one workstation to another. The objective is to minimize the cycle length. Previously known algorithms are either heuristic or at best polynomial of the fifth degree in the number of machines, m. We derive an exact scheduling algorithm solving the problem in O(m3 log m) time.",

keywords = "Complexity, Cyclic scheduling, Minimal cycle, Transporting robot",

author = "Eugene Levner and Vladimir Kats and Levit, {Vadim E.}",

year = "1997",

month = mar,

day = "16",

doi = "10.1016/S0377-2217(96)00272-X",

language = "אנגלית",

volume = "97",

pages = "500--508",

journal = "European Journal of Operational Research",

issn = "0377-2217",

publisher = "Elsevier B.V.",

number = "3",

}

TY - JOUR

T1 - An improved algorithm for cyclic flowshop scheduling in a robotic cell

AU - Levner, Eugene

AU - Kats, Vladimir

AU - Levit, Vadim E.

PY - 1997/3/16

Y1 - 1997/3/16

N2 - This paper addresses a cyclic robot scheduling problem in an automated manufacturing line in which a single robot is used to move parts from one workstation to another. The objective is to minimize the cycle length. Previously known algorithms are either heuristic or at best polynomial of the fifth degree in the number of machines, m. We derive an exact scheduling algorithm solving the problem in O(m3 log m) time.

AB - This paper addresses a cyclic robot scheduling problem in an automated manufacturing line in which a single robot is used to move parts from one workstation to another. The objective is to minimize the cycle length. Previously known algorithms are either heuristic or at best polynomial of the fifth degree in the number of machines, m. We derive an exact scheduling algorithm solving the problem in O(m3 log m) time.

KW - Complexity

KW - Cyclic scheduling

KW - Minimal cycle

KW - Transporting robot

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

U2 - 10.1016/S0377-2217(96)00272-X

DO - 10.1016/S0377-2217(96)00272-X

M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???

AN - SCOPUS:0031095268

SN - 0377-2217

VL - 97

SP - 500

EP - 508

JO - European Journal of Operational Research

JF - European Journal of Operational Research

IS - 3

ER -

An improved algorithm for cyclic flowshop scheduling in a robotic cell

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this