Network flows: theory, algorithms, and applications
Network flows: theory, algorithms, and applications
Robots and Manufacturing Automation
Robots and Manufacturing Automation
On Throughput Maximization in Constant Travel-Time Robotic Cells
Manufacturing & Service Operations Management
Complexity of one-cycle robotic flow-shops
Journal of Scheduling
Robotic cell scheduling with operational flexibility
Discrete Applied Mathematics
Sequencing and Scheduling in Robotic Cells: Recent Developments
Journal of Scheduling
Cycles and permutations in robotic cells
Mathematical and Computer Modelling: An International Journal
Survey: Complexity of cyclic scheduling problems: A state-of-the-art survey
Computers and Industrial Engineering
A polynomial algorithm for multi-robot 2-cyclic scheduling in a no-wait robotic cell
Computers and Operations Research
Parametric algorithms for 2-cyclic robot scheduling with interval processing times
Journal of Scheduling
An analysis of cyclic scheduling problems in robot centered cells
Computers and Operations Research
Two-machine robotic cell scheduling problem with sequence-dependent setup times
Computers and Operations Research
| Hi-index | 0.04 |
Robotic cells consist of a flow-shop with a robot for material handling. A single part is to be produced cyclically and the objective is to minimize production rate. This document introduces basic concepts and tools for dealing with cyclic production. In particular, it concentrates on k-cycles which are production cycles where exactly k parts enter and leave the cell. One defines the cycle function K which is the smallest value of k so that the set of all k-cycles up to size K contains an optimal cycle for all instances. Known results and conjectures on these functions are given for the classical case where parts can remain on the machine waiting for the robot and for the no-wait case where parts have to be removed from the machine as soon as their processing is finished.