Minimizing the number of robots to meet a given cyclic schedule

Vladimir Kats; Eugene Levner

doi:10.1023/a:1018980928352

Minimizing the number of robots to meet a given cyclic schedule

Vladimir Kats, Eugene Levner

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

42 Scopus citations

Abstract

We study a problem of cyclic no-wait scheduling of identical parts on m sequential machines. A number of robots are used to transport the parts from one machine to another. We consider the problem that has two performance measures: one is the number of robots to be used, the other is the period of a cyclic schedule. We find the minimal number of robots needed to meet a given cyclic schedule, for all possible cycle lengths, the complexity of the suggested algorithm bang O(m⁵), independently of the range within which the cycle length value may vary.

Original language	English
Pages (from-to)	209-226
Number of pages	18
Journal	Annals of Operations Research
Volume	69
DOIs	https://doi.org/10.1023/a:1018980928352
State	Published - 1997
Externally published	Yes

Keywords

Assignment problem
Cyclic scheduling
Polynomial algorithm
Robotic scheduling

Access to Document

10.1023/a:1018980928352

Cite this

@article{8e40f68d94d54829bf80d8c6ee34dff6,

title = "Minimizing the number of robots to meet a given cyclic schedule",

abstract = "We study a problem of cyclic no-wait scheduling of identical parts on m sequential machines. A number of robots are used to transport the parts from one machine to another. We consider the problem that has two performance measures: one is the number of robots to be used, the other is the period of a cyclic schedule. We find the minimal number of robots needed to meet a given cyclic schedule, for all possible cycle lengths, the complexity of the suggested algorithm bang O(m5), independently of the range within which the cycle length value may vary.",

keywords = "Assignment problem, Cyclic scheduling, Polynomial algorithm, Robotic scheduling",

author = "Vladimir Kats and Eugene Levner",

year = "1997",

doi = "10.1023/a:1018980928352",

language = "אנגלית",

volume = "69",

pages = "209--226",

journal = "Annals of Operations Research",

issn = "0254-5330",

publisher = "Springer Netherlands",

}

TY - JOUR

T1 - Minimizing the number of robots to meet a given cyclic schedule

AU - Kats, Vladimir

AU - Levner, Eugene

PY - 1997

Y1 - 1997

N2 - We study a problem of cyclic no-wait scheduling of identical parts on m sequential machines. A number of robots are used to transport the parts from one machine to another. We consider the problem that has two performance measures: one is the number of robots to be used, the other is the period of a cyclic schedule. We find the minimal number of robots needed to meet a given cyclic schedule, for all possible cycle lengths, the complexity of the suggested algorithm bang O(m5), independently of the range within which the cycle length value may vary.

AB - We study a problem of cyclic no-wait scheduling of identical parts on m sequential machines. A number of robots are used to transport the parts from one machine to another. We consider the problem that has two performance measures: one is the number of robots to be used, the other is the period of a cyclic schedule. We find the minimal number of robots needed to meet a given cyclic schedule, for all possible cycle lengths, the complexity of the suggested algorithm bang O(m5), independently of the range within which the cycle length value may vary.

KW - Assignment problem

KW - Cyclic scheduling

KW - Polynomial algorithm

KW - Robotic scheduling

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

U2 - 10.1023/a:1018980928352

DO - 10.1023/a:1018980928352

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

AN - SCOPUS:0031540827

SN - 0254-5330

VL - 69

SP - 209

EP - 226

JO - Annals of Operations Research

JF - Annals of Operations Research

ER -

Minimizing the number of robots to meet a given cyclic schedule

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this