Title of article
Preemptive scheduling in a two-stage multiprocessor flow shop is NP-hard
Author/Authors
J. A. Hoogeveen، نويسنده , , J. K. Lenstra، نويسنده , , B. Veltman، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 1996
Pages
4
From page
172
To page
175
Keywords
flow shop , Parallel machines , complexity , NP-hardness
Journal title
European Journal of Operational Research
Serial Year
1996
Journal title
European Journal of Operational Research
Record number
211566
Link To Document