%0 Journal Article
%T Minimizing Makespan in a Two-Machine Flow Shop with Delays and Unit-Time Operations is NP-Hard
%A Yu, Wenci
%A Hoogeveen, Han
%A Lenstra, Jan
%J Journal of Scheduling
%V 7
%N 5
%P 333-348
%@ 1094-6136
%D 2004-10-05
%I Kluwer Academic Publishers
%~ DeepDyve