TY - JOUR N2 - Abstract In the paper a variant of cyclic production with setups and two-machine cell is considered. One of the stages of the problem solving consists of assigning each operation to the machine on which it will be carried out. The total number of such assignments is exponential. We propose a polynomial time algorithm finding the optimal operations to machines assignment. L1 - http://journals.pan.pl/Content/104474/PDF/acsc-2017-0009.pdf L2 - http://journals.pan.pl/Content/104474 PY - 2017 IS - No 2 DO - 10.1515/acsc-2017-0009 A1 - Bożejko, Wojciech A1 - Gnatowski, Andrzej A1 - Idzikowski, Radosław A1 - Wodecki, Mieczysław PB - Committee of Automatic Control and Robotics PAS DA - 2017 T1 - Cyclic flow shop scheduling problem with two-machine cells UR - http://journals.pan.pl/dlibra/publication/edition/104474 T2 - Archives of Control Sciences ER -