A polynomial algorithm for 2-degree cyclic robot scheduling

Ada Che; Chengbin Chu; Eugene Levner

doi:10.1016/s0377-2217(02)00175-3

A polynomial algorithm for 2-degree cyclic robot scheduling

Ada Che
, Chengbin Chu
, Eugene Levner

Université de technologie de Troyes
Holon Institute of Technology

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

55 Scopus citations

Abstract

This paper studies the 2-degree cyclic scheduling of identical parts in a no-wait robotic flow shop where exactly two parts enter and leave the production line in a cycle. The objective is to minimize the cycle time. We propose a polynomial algorithm to find an optimal 2-degree cyclic schedule of robot moves. The algorithm can be implemented in O(N⁸ log N) where N is the number of machines in the considered robotic cell. The proposed algorithm is also extended to problems where the two parts are not identical. Computational results is presented to test and evaluate the proposed algorithm.

Original language	English
Pages (from-to)	31-44
Number of pages	14
Journal	European Journal of Operational Research
Volume	145
Issue number	1
DOIs	https://doi.org/10.1016/s0377-2217(02)00175-3
State	Published - 16 Feb 2003
Externally published	Yes

Bibliographical note

Funding Information:
This work was supported by the French–Israeli co-operation grant “Factory of the Future”.

Funding

This work was supported by the French–Israeli co-operation grant “Factory of the Future”.

Funders
French–Israeli co-operation

Keywords

Complexity
Cycle time minimization
Cyclic scheduling
Transporting robot

Access to Document

10.1016/s0377-2217(02)00175-3

Cite this

@article{6066e36d82024cae836c3f84db49c71e,

title = "A polynomial algorithm for 2-degree cyclic robot scheduling",

abstract = "This paper studies the 2-degree cyclic scheduling of identical parts in a no-wait robotic flow shop where exactly two parts enter and leave the production line in a cycle. The objective is to minimize the cycle time. We propose a polynomial algorithm to find an optimal 2-degree cyclic schedule of robot moves. The algorithm can be implemented in O(N8 log N) where N is the number of machines in the considered robotic cell. The proposed algorithm is also extended to problems where the two parts are not identical. Computational results is presented to test and evaluate the proposed algorithm.",

keywords = "Complexity, Cycle time minimization, Cyclic scheduling, Transporting robot",

author = "Ada Che and Chengbin Chu and Eugene Levner",

note = "Funding Information: This work was supported by the French{\textendash}Israeli co-operation grant {\textquotedblleft}Factory of the Future{\textquotedblright}. ",

year = "2003",

month = feb,

day = "16",

doi = "10.1016/s0377-2217(02)00175-3",

language = "אנגלית",

volume = "145",

pages = "31--44",

journal = "European Journal of Operational Research",

issn = "0377-2217",

publisher = "Elsevier B.V.",

number = "1",

}

TY - JOUR

T1 - A polynomial algorithm for 2-degree cyclic robot scheduling

AU - Che, Ada

AU - Chu, Chengbin

AU - Levner, Eugene

N1 - Funding Information: This work was supported by the French–Israeli co-operation grant “Factory of the Future”.

PY - 2003/2/16

Y1 - 2003/2/16

N2 - This paper studies the 2-degree cyclic scheduling of identical parts in a no-wait robotic flow shop where exactly two parts enter and leave the production line in a cycle. The objective is to minimize the cycle time. We propose a polynomial algorithm to find an optimal 2-degree cyclic schedule of robot moves. The algorithm can be implemented in O(N8 log N) where N is the number of machines in the considered robotic cell. The proposed algorithm is also extended to problems where the two parts are not identical. Computational results is presented to test and evaluate the proposed algorithm.

AB - This paper studies the 2-degree cyclic scheduling of identical parts in a no-wait robotic flow shop where exactly two parts enter and leave the production line in a cycle. The objective is to minimize the cycle time. We propose a polynomial algorithm to find an optimal 2-degree cyclic schedule of robot moves. The algorithm can be implemented in O(N8 log N) where N is the number of machines in the considered robotic cell. The proposed algorithm is also extended to problems where the two parts are not identical. Computational results is presented to test and evaluate the proposed algorithm.

KW - Complexity

KW - Cycle time minimization

KW - Cyclic scheduling

KW - Transporting robot

UR - https://www.scopus.com/pages/publications/0037448766

U2 - 10.1016/s0377-2217(02)00175-3

DO - 10.1016/s0377-2217(02)00175-3

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

AN - SCOPUS:0037448766

SN - 0377-2217

VL - 145

SP - 31

EP - 44

JO - European Journal of Operational Research

JF - European Journal of Operational Research

IS - 1

ER -

A polynomial algorithm for 2-degree cyclic robot scheduling

Abstract

Bibliographical note

Funding

Keywords

Access to Document

Other files and links

Fingerprint

Cite this