scientific article; zbMATH DE number 969090
From MaRDI portal
Publication:5284556
zbMATH Open0870.90074MaRDI QIDQ5284556FDOQ5284556
Author name not available (Why is that?)
Publication date: 22 January 1997
Title of this publication is not available (Why is that?)
Recommendations
- On the complexity of generalized due date scheduling problems
- scientific article
- On the tractability of hard scheduling problems with generalized due-dates with respect to the number of different due-dates
- Unary NP-hardness of minimizing total weighted tardiness with generalized due dates
- Scheduling with generalized and periodic due dates under single- and two-machine environments
Deterministic scheduling theory in operations research (90B35) Abstract computational complexity for mathematical programming problems (90C60)
Cited In (5)
- Title not available (Why is that?)
- The NP-completeness of the \(n/m/parallel/C_{\max}\) preemptive due-date scheduling problem
- 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)
