scientific article; zbMATH DE number 1294408

zbMATH Open0925.68211MaRDI QIDQ4246540FDOQ4246540

V. A. Strusevich

Publication date: 3 August 1999

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

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Deterministic scheduling theory in operations research (90B35)

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 Q4246540)