Deciding the feasibility of a given throughput rate in 2-cyclic robotic scheduling

We highlight in this article the relevance of a decision problem in k-cyclic robotic scheduling: deciding whether a certain throughput is feasible or not. Research until now has been focused mainly on the optimization problem (finding the maximum possible throughput). We provide an algorithm for thi...

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	Theoretical computer science Ročník 1042; s. 115233
Hlavný autor:	Sáez, Pablo
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Elsevier B.V 19.07.2025
Predmet:	Cyclic scheduling Manufacturing line Polynomial algorithm Manufacturing line Polynomial algorithm Cyclic scheduling
ISSN:	0304-3975
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Popis
Shrnutí:	We highlight in this article the relevance of a decision problem in k-cyclic robotic scheduling: deciding whether a certain throughput is feasible or not. Research until now has been focused mainly on the optimization problem (finding the maximum possible throughput). We provide an algorithm for this decision problem in 2-cyclic robotic scheduling that runs in O(n3) time, where n is the number of machines in the production line, and we outline possibilities for further work in this direction.
ISSN:	0304-3975
DOI:	10.1016/j.tcs.2025.115233