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

Full description

Saved in:
Bibliographic Details
Published in:Theoretical computer science Vol. 1042; p. 115233
Main Author: Sáez, Pablo
Format: Journal Article
Language:English
Published: Elsevier B.V 19.07.2025
Subjects:
Cyclic scheduling
Manufacturing line
Polynomial algorithm
Manufacturing line
Polynomial algorithm
Cyclic scheduling
ISSN:0304-3975
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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