Preemptive scheduling in a two-stage multiprocessor flow shop is NP-hard

J.A. Hoogeveen, J.K. Lenstra, B. Veltman

Research output: Book/ReportReportAcademic

306 Downloads (Pure)

Fingerprint

Dive into the research topics of 'Preemptive scheduling in a two-stage multiprocessor flow shop is NP-hard'. Together they form a unique fingerprint.

Computer Science

Mathematics