TY - JOUR N2 - Abstract In the work a single-machine scheduling problem is being considered, in which all tasks have a fixed availability (release) and delivery time. In the analyzed variant no-idle time is allowed on a machine. The purpose of optimization is to determine such order of tasks that minimizes the makespan, i.e. the time of execution of all the tasks. There is also a number of properties of the problem presented, in particular there are formulated block eliminating properties for no-idle constraint. There was an exact B&B algorithm based on the block properties proposed. L1 - http://www.czasopisma.pan.pl/Content/104472/PDF/acsc-2017-0021.pdf L2 - http://www.czasopisma.pan.pl/Content/104472 PY - 2017 IS - No 2 DO - 10.1515/acsc-2017-0021 A1 - Pempera, Jaroslaw PB - Committee of Automatic Control and Robotics PAS DA - 2017 T1 - An exact block algorithm for no-idle RPQ problem UR - http://www.czasopisma.pan.pl/dlibra/publication/edition/104472 T2 - Archives of Control Sciences ER -