scientific article; zbMATH DE number 969090
From MaRDI portal
Publication:5284556
zbMATH Open0870.90074MaRDI QIDQ5284556
Author name not available (Why is that?)
Publication date: 22 January 1997
Title of this publication is not available (Why is that?)
Abstract computational complexity for mathematical programming problems (90C60) Deterministic scheduling theory in operations research (90B35)
Related Items (3)
On the complexity of generalized due date scheduling problems ⋮ Strong NP-hardness of minimizing total deviation with generalized and periodic due dates ⋮ Title not available (Why is that?)
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 Q5284556)
