Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
6894856 | European Journal of Operational Research | 2018 | 5 Pages |
Abstract
We consider a four-machine robotic cell producing identical parts and served by a single robot. We study the no-wait multi-cyclic scheduling problem. Using the forbidden-intervals method, we show that in such a cell the optimal schedule can be k-cyclic with minimum kâ¯â¥ 6. This fact refutes Agnetis' conjecture (Agnetis, 2000) stating that the minimum k for the optimal k-cyclic m-machine schedules does not exceed mâ1. In particular, we construct a counter-example to Agnetis' conjecture.
Related Topics
Physical Sciences and Engineering
Computer Science
Computer Science (General)
Authors
Vladimir Kats, Eugene Levner,