A parametric critical path problem and an application for cyclic scheduling
Discrete Applied Mathematics
Scheduling of parts and robot activities in a two machine robotic cell
Computers and Operations Research - Special issue on the traveling salesman problem
Makespan minimization for flow-shop problems with transportation times and a single robot
Discrete Applied Mathematics - Special issue on the combinatorial optimization symposium
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Series production in a basic re-entrant shop to minimize makespan or total flow time
Computers and Industrial Engineering
Survey: Complexity of cyclic scheduling problems: A state-of-the-art survey
Computers and Industrial Engineering
| Hi-index | 0.00 |
We study the scheduling of m-machine reentrant robotic cells, in which parts need to reenter machines several times before they are finished. The problem is to find the sequence of 1-unit robot move cycles and the part processing sequence which jointly minimize the cycle time or the makespan. When m = 2, we show that both the cycle time and the makespan minimization problems are polynomially solvable. When m = 3, we examine a special class of reentrant robotic cells with the cycle time objective. We show that in a three-machine loop-reentrant robotic cell, the part sequencing problem under three out of the four possible robot move cycles for producing one unit is strongly 驴驴-hard. The part sequencing problem under the remaining robot move cycle can be solved easily. Finally, we prove that the general problem, without restriction to any robot move cycle, is also intractable.