scientific article; zbMATH DE number 16429

zbMATH Open0738.90042MaRDI QIDQ3973086FDOQ3973086

Authors: I. N. Lushchakova, V. A. Strusevich 

Publication date: 26 June 1992

Title of this publication is not available (Why is that?)

zbMATH Keywords

NP-hardness

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Abstract computational complexity for mathematical programming problems (90C60)

Cited In (1)

• Complexity and approximation of open shop scheduling to minimize the makespan: a review of models and approaches

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3973086)