A polynomial algorithm for 2-cyclic robotic scheduling: A non-Euclidean case

Vladimir Kats; Eugene Levner

doi:10.1016/j.dam.2008.03.025

A polynomial algorithm for 2-cyclic robotic scheduling: A non-Euclidean case

Vladimir Kats, Eugene Levner

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

25 Scopus citations

Abstract

In this paper we consider the problem of no-wait cyclic scheduling of identical parts in an m-machine production line in which a robot is responsible for moving each part from a machine to another. The aim is to find the minimum cycle time for the so-called 2-cyclic schedules, in which exactly two parts enter and two parts leave the production line during each cycle. The earlier known polynomial-time algorithms for this problem are applicable only under the additional assumption that the robot travel times satisfy the triangle inequalities. We lift this assumption on robot travel times and present a polynomial-time algorithm with the same time complexity as in the metric case, O (m⁵ log m).

Original language	English
Pages (from-to)	339-355
Number of pages	17
Journal	Discrete Applied Mathematics
Volume	157
Issue number	2
DOIs	https://doi.org/10.1016/j.dam.2008.03.025
State	Published - 28 Jan 2009
Externally published	Yes

Bibliographical note

Funding Information:
The research of the second author was supported in part by the Ministry of Education and Science of Spain, grant SAB2005-0161.

Funding

The research of the second author was supported in part by the Ministry of Education and Science of Spain, grant SAB2005-0161.

Funders	Funder number
Ministerio de Educación, Cultura y Deporte	SAB2005-0161

Keywords

Complexity
Cyclic scheduling
Euler formula
No-wait condition
Polynomial-time algorithms
Robotic scheduling

Access to Document

10.1016/j.dam.2008.03.025

Cite this

@article{b114df3932cb4b48ab32caf75d960c25,

title = "A polynomial algorithm for 2-cyclic robotic scheduling: A non-Euclidean case",

abstract = "In this paper we consider the problem of no-wait cyclic scheduling of identical parts in an m-machine production line in which a robot is responsible for moving each part from a machine to another. The aim is to find the minimum cycle time for the so-called 2-cyclic schedules, in which exactly two parts enter and two parts leave the production line during each cycle. The earlier known polynomial-time algorithms for this problem are applicable only under the additional assumption that the robot travel times satisfy the triangle inequalities. We lift this assumption on robot travel times and present a polynomial-time algorithm with the same time complexity as in the metric case, O (m5 log m).",

keywords = "Complexity, Cyclic scheduling, Euler formula, No-wait condition, Polynomial-time algorithms, Robotic scheduling",

author = "Vladimir Kats and Eugene Levner",

note = "Funding Information: The research of the second author was supported in part by the Ministry of Education and Science of Spain, grant SAB2005-0161. ",

year = "2009",

month = jan,

day = "28",

doi = "10.1016/j.dam.2008.03.025",

language = "אנגלית",

volume = "157",

pages = "339--355",

journal = "Discrete Applied Mathematics",

issn = "0166-218X",

publisher = "Elsevier",

number = "2",

}

TY - JOUR

T1 - A polynomial algorithm for 2-cyclic robotic scheduling

T2 - A non-Euclidean case

AU - Kats, Vladimir

AU - Levner, Eugene

N1 - Funding Information: The research of the second author was supported in part by the Ministry of Education and Science of Spain, grant SAB2005-0161.

PY - 2009/1/28

Y1 - 2009/1/28

N2 - In this paper we consider the problem of no-wait cyclic scheduling of identical parts in an m-machine production line in which a robot is responsible for moving each part from a machine to another. The aim is to find the minimum cycle time for the so-called 2-cyclic schedules, in which exactly two parts enter and two parts leave the production line during each cycle. The earlier known polynomial-time algorithms for this problem are applicable only under the additional assumption that the robot travel times satisfy the triangle inequalities. We lift this assumption on robot travel times and present a polynomial-time algorithm with the same time complexity as in the metric case, O (m5 log m).

AB - In this paper we consider the problem of no-wait cyclic scheduling of identical parts in an m-machine production line in which a robot is responsible for moving each part from a machine to another. The aim is to find the minimum cycle time for the so-called 2-cyclic schedules, in which exactly two parts enter and two parts leave the production line during each cycle. The earlier known polynomial-time algorithms for this problem are applicable only under the additional assumption that the robot travel times satisfy the triangle inequalities. We lift this assumption on robot travel times and present a polynomial-time algorithm with the same time complexity as in the metric case, O (m5 log m).

KW - Complexity

KW - Cyclic scheduling

KW - Euler formula

KW - No-wait condition

KW - Polynomial-time algorithms

KW - Robotic scheduling

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

U2 - 10.1016/j.dam.2008.03.025

DO - 10.1016/j.dam.2008.03.025

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

AN - SCOPUS:56349083345

SN - 0166-218X

VL - 157

SP - 339

EP - 355

JO - Discrete Applied Mathematics

JF - Discrete Applied Mathematics

IS - 2

ER -

A polynomial algorithm for 2-cyclic robotic scheduling: A non-Euclidean case

Abstract

Bibliographical note

Funding

Keywords

Access to Document

Other files and links

Fingerprint

Cite this