A faster algorithm for 2-cyclic robotic scheduling with a fixed robot route and interval processing times

Vladimir Kats; Eugene Levner

doi:10.1016/j.ejor.2010.10.002

A faster algorithm for 2-cyclic robotic scheduling with a fixed robot route and interval processing times

Vladimir Kats, Eugene Levner

Department of Management

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

33 Scopus citations

Abstract

Consider an m-machine production line for processing identical parts served by a mobile robot. The problem is to find the minimum cycle time for 2-cyclic schedules, in which exactly two parts enter and two parts leave the production line during each cycle. This work treats a special case of the 2-cyclic robot scheduling problem when the robot route is given and the operation durations are to be chosen from prescribed intervals. The problem was previously proved to be polynomially solvable in O(m⁸log m) time. This paper proposes an improved algorithm with reduced complexity O(m⁴).

Original language	English
Pages (from-to)	51-56
Number of pages	6
Journal	European Journal of Operational Research
Volume	209
Issue number	1
DOIs	https://doi.org/10.1016/j.ejor.2010.10.002
State	Published - 16 Feb 2011

Keywords

Cyclic scheduling
Efficient algorithms
Graph-theoretic models
Polynomial models
Robotic scheduling

Access to Document

10.1016/j.ejor.2010.10.002

Cite this

@article{c4467b34888e483f9536c4dba4bdb429,

title = "A faster algorithm for 2-cyclic robotic scheduling with a fixed robot route and interval processing times",

abstract = "Consider an m-machine production line for processing identical parts served by a mobile robot. The problem is to find the minimum cycle time for 2-cyclic schedules, in which exactly two parts enter and two parts leave the production line during each cycle. This work treats a special case of the 2-cyclic robot scheduling problem when the robot route is given and the operation durations are to be chosen from prescribed intervals. The problem was previously proved to be polynomially solvable in O(m8log m) time. This paper proposes an improved algorithm with reduced complexity O(m4).",

keywords = "Cyclic scheduling, Efficient algorithms, Graph-theoretic models, Polynomial models, Robotic scheduling",

author = "Vladimir Kats and Eugene Levner",

year = "2011",

month = feb,

day = "16",

doi = "10.1016/j.ejor.2010.10.002",

language = "אנגלית",

volume = "209",

pages = "51--56",

journal = "European Journal of Operational Research",

issn = "0377-2217",

publisher = "Elsevier B.V.",

number = "1",

}

TY - JOUR

T1 - A faster algorithm for 2-cyclic robotic scheduling with a fixed robot route and interval processing times

AU - Kats, Vladimir

AU - Levner, Eugene

PY - 2011/2/16

Y1 - 2011/2/16

N2 - Consider an m-machine production line for processing identical parts served by a mobile robot. The problem is to find the minimum cycle time for 2-cyclic schedules, in which exactly two parts enter and two parts leave the production line during each cycle. This work treats a special case of the 2-cyclic robot scheduling problem when the robot route is given and the operation durations are to be chosen from prescribed intervals. The problem was previously proved to be polynomially solvable in O(m8log m) time. This paper proposes an improved algorithm with reduced complexity O(m4).

AB - Consider an m-machine production line for processing identical parts served by a mobile robot. The problem is to find the minimum cycle time for 2-cyclic schedules, in which exactly two parts enter and two parts leave the production line during each cycle. This work treats a special case of the 2-cyclic robot scheduling problem when the robot route is given and the operation durations are to be chosen from prescribed intervals. The problem was previously proved to be polynomially solvable in O(m8log m) time. This paper proposes an improved algorithm with reduced complexity O(m4).

KW - Cyclic scheduling

KW - Efficient algorithms

KW - Graph-theoretic models

KW - Polynomial models

KW - Robotic scheduling

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

U2 - 10.1016/j.ejor.2010.10.002

DO - 10.1016/j.ejor.2010.10.002

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

AN - SCOPUS:78649472963

SN - 0377-2217

VL - 209

SP - 51

EP - 56

JO - European Journal of Operational Research

JF - European Journal of Operational Research

IS - 1

ER -

A faster algorithm for 2-cyclic robotic scheduling with a fixed robot route and interval processing times

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this