Scheduling multiple robots in a no‐wait re‐entrant robotic flowshop

No‐wait re‐entrant robotic flowshops are widely used in the electronic industry, such as PCB and semiconductor manufacturing. In such an industry, cyclic production policy is often used due to large lot size and simplicity of implementation. This paper addresses cyclic scheduling of a no‐wait re‐entrant robotic flowshop with multiple robots for material handling. We formulate the problem and propose a polynomial algorithm to find the minimum number of robots for all feasible cycle times. Consequently, the minimum cycle time for any given number of robots can be obtained with the proposed algorithm. The algorithm runs in O(N ⁵) time in the worst case, where N is the number of machines in the robotic flowshop.