.png){kind=icon}
Return
A dynamic programming algorithm for the Robotic Cell Problem with a fixed job processing order
.png){kind=icon}
PRE
AI
DOI：10.1016/j.ejor.2026.09.015.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
• We present an algorithm for the Robotic Cell Problem with fixed job sequence.
• The Robotic Cell Problem is relevant for optimizing smart manufacturing systems.
• A dynamic programming algorithm solves larger instances than existing methods.
• The algorithm can be turned into an accurate heuristic.
• Instances with up to 15 machines and 30 jobs are solved to optimality.
Keywords:
Flow-shop
Robotic cell
Dynamic programming
Flexible manufacturing systems
Combinatorial optimization
Journal
IF:
6
Papers:
2.2W
Citations:
6.4W
Organization
Cited Papers
No cited papers available