We consider a robotic cell, consisting of a flow-shop in which the machines are served by a single central robot. We concentrate on the case where only one part type is produced nad want to analyze the conjecture of Sethi, Sriskandarajah, Sorger, Blazewicz and Kubiak. This well-known conjecture claims that the repetition of the best one-unit Production cycle will yield the maximum throughput rate in the set of all possible Robot moves. The conjecture holds for two and three machines, but the existing proof By van de Klundert and Crama for the three-machine case is extremely tedious.
展开▼
机译：我们考虑一个机器人车间，它由一个流水车间组成，其中的机器由一个中央机器人提供服务。我们只关注仅生产一种零件类型的情况，并且想要分析Sethi，Sriskandarajah，Sorger，Blazewicz和Kubiak的猜想。这个众所周知的猜想声称，重复最佳的一个单元生产周期将在所有可能的机器人动作集中产生最大的吞吐率。这个猜想适用于两台和三台机器，但是现有的三台机器案例的证明由van de Klundert和Crama十分繁琐。
展开▼
