Preemptive scheduling in a two-stage multiprocessor flow shop is NP-hard
Year of publication: |
1996
|
---|---|
Authors: | Hoogeveen, J. A. ; Lenstra, J. K. ; Veltman, B. |
Published in: |
European Journal of Operational Research. - Elsevier, ISSN 0377-2217. - Vol. 89.1996, 1, p. 172-175
|
Publisher: |
Elsevier |
Saved in:
Online Resource
Saved in favorites
Similar items by person
-
Three, four, five, six, or the complexity of scheduling with communication delays
Hoogeveen, J.A., (1994)
-
Preemptive scheduling in a two-stage multiprocessor flow shop is NP-hard
Hoogeveen, J.A., (1996)
-
Curiel, I., (1994)
- More ...