A note on a quadratic algorithm for the 2-cyclic robotic scheduling problem

Ada Che; Vladimir Kats; Eugene Levner

doi:10.1016/j.tcs.2009.08.002

A note on a quadratic algorithm for the 2-cyclic robotic scheduling problem

Ada Che
, Vladimir Kats
, Eugene Levner

Department of Social & Health Sciences

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

2 Scopus citations

Abstract

Recently, Pablo Sáez (2009) [1] has developed a quadratic algorithm for a 2-cyclic robotic scheduling problem. In this note we uncover that the algorithm handles a special version of the problem only and fails to solve the general 2-cyclic robotic scheduling problem.

Original language	English
Pages (from-to)	5188-5190
Number of pages	3
Journal	Theoretical Computer Science
Volume	410
Issue number	47-49
DOIs	https://doi.org/10.1016/j.tcs.2009.08.002
State	Published - 6 Nov 2009

Bibliographical note

Funding Information:
The work of Dr. Ada Che was partially supported by the National Natural Science Foundation of China under Grant No. 50605052.

Funding

The work of Dr. Ada Che was partially supported by the National Natural Science Foundation of China under Grant No. 50605052.

Funders	Funder number
National Natural Science Foundation of China	50605052

Keywords

Complexity
No-wait
Polynomial algorithm
Robotic scheduling

Access to Document

10.1016/j.tcs.2009.08.002

Cite this

@article{f07faa8c7c9c4f0aa497673b8f1de80f,

title = "A note on a quadratic algorithm for the 2-cyclic robotic scheduling problem",

abstract = "Recently, Pablo S{\'a}ez (2009) [1] has developed a quadratic algorithm for a 2-cyclic robotic scheduling problem. In this note we uncover that the algorithm handles a special version of the problem only and fails to solve the general 2-cyclic robotic scheduling problem.",

keywords = "Complexity, No-wait, Polynomial algorithm, Robotic scheduling",

author = "Ada Che and Vladimir Kats and Eugene Levner",

note = "Funding Information: The work of Dr. Ada Che was partially supported by the National Natural Science Foundation of China under Grant No. 50605052.",

year = "2009",

month = nov,

day = "6",

doi = "10.1016/j.tcs.2009.08.002",

language = "אנגלית",

volume = "410",

pages = "5188--5190",

journal = "Theoretical Computer Science",

issn = "0304-3975",

publisher = "Elsevier B.V.",

number = "47-49",

}

TY - JOUR

T1 - A note on a quadratic algorithm for the 2-cyclic robotic scheduling problem

AU - Che, Ada

AU - Kats, Vladimir

AU - Levner, Eugene

N1 - Funding Information: The work of Dr. Ada Che was partially supported by the National Natural Science Foundation of China under Grant No. 50605052.

PY - 2009/11/6

Y1 - 2009/11/6

N2 - Recently, Pablo Sáez (2009) [1] has developed a quadratic algorithm for a 2-cyclic robotic scheduling problem. In this note we uncover that the algorithm handles a special version of the problem only and fails to solve the general 2-cyclic robotic scheduling problem.

AB - Recently, Pablo Sáez (2009) [1] has developed a quadratic algorithm for a 2-cyclic robotic scheduling problem. In this note we uncover that the algorithm handles a special version of the problem only and fails to solve the general 2-cyclic robotic scheduling problem.

KW - Complexity

KW - No-wait

KW - Polynomial algorithm

KW - Robotic scheduling

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

U2 - 10.1016/j.tcs.2009.08.002

DO - 10.1016/j.tcs.2009.08.002

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

AN - SCOPUS:84858705822

SN - 0304-3975

VL - 410

SP - 5188

EP - 5190

JO - Theoretical Computer Science

JF - Theoretical Computer Science

IS - 47-49

ER -

A note on a quadratic algorithm for the 2-cyclic robotic scheduling problem

Abstract

Bibliographical note

Funding

Keywords

Access to Document

Other files and links

Fingerprint

Cite this