A faster algorithm for 2-cyclic robotic scheduling with a fixed robot route and interval processing times |
| |
Authors: | Vladimir Kats Eugene Levner |
| |
Affiliation: | 1. Institute for Industrial Mathematics, 57/10 Klazkin St., Beer-Sheva 84641, Israel;2. Holon Institute of Technology, Holon 58102, Israel;3. Bar Ilan University, Ramat Gan 52900, Israel |
| |
Abstract: | Consider an m-machine production line for processing identical parts served by a mobile robot. The problem is to find the minimum cycle time for 2-cyclic schedules, in which exactly two parts enter and two parts leave the production line during each cycle. This work treats a special case of the 2-cyclic robot scheduling problem when the robot route is given and the operation durations are to be chosen from prescribed intervals. The problem was previously proved to be polynomially solvable in O(m8log m) time. This paper proposes an improved algorithm with reduced complexity O(m4). |
| |
Keywords: | Efficient algorithms Graph-theoretic models Cyclic scheduling Polynomial models Robotic scheduling |
本文献已被 ScienceDirect 等数据库收录! |