@ARTICLE{Pempera_Jaroslaw_An_2017,
 author={Pempera, Jaroslaw},
 number={No 2},
 journal={Archives of Control Sciences},
 howpublished={online},
 year={2017},
 publisher={Committee of Automatic Control and Robotics PAS},
 abstract={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.},
 title={An exact block algorithm for no-idle RPQ problem},
 URL={http://journals.pan.pl/Content/104472/PDF/acsc-2017-0021.pdf},
 doi={10.1515/acsc-2017-0021},
}