Minimizing the number of robots to meet a given cyclic schedule

Vladimir Kats and Eugene Levner

Annals of Operations Research, 1997, vol. 69, issue 0, 209-226

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 complex-ity of the suggested algorithm being O(m 5 ), independently of the range within which the cycle length value may vary. Copyright Kluwer Academic Publishers 1997

Date: 1997
References: Add references at CitEc
Citations: View citations in EconPapers (8)

Downloads: (external link)
http://hdl.handle.net/10.1023/A:1018980928352 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:annopr:v:69:y:1997:i:0:p:209-226:10.1023/a:1018980928352

Ordering information: This journal article can be ordered from
http://www.springer.com/journal/10479

DOI: 10.1023/A:1018980928352

Access Statistics for this article

Annals of Operations Research is currently edited by Endre Boros

More articles in Annals of Operations Research from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().