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...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Theoretical computer science Jg. 1042; S. 115233
1. Verfasser: Sáez, Pablo
Format: Journal Article
Sprache:Englisch
Veröffentlicht: Elsevier B.V 19.07.2025
Schlagworte:
Cyclic scheduling
Manufacturing line
Polynomial algorithm
Manufacturing line
Polynomial algorithm
Cyclic scheduling
ISSN:0304-3975
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung: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