scientific article; zbMATH DE number 969090

MaRDI QIDQ5284556zbMATH OpenFDO

Authors

Publication date 22 January 1997

zbMATH Keywords

precedence constraintssingle processorindependent tasksgeneralized due dates

Mathematics Subject Classification ID

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

Recommendations

• On the complexity of generalized due date scheduling problems
• scientific article; zbMATH DE number 4172724
• 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

Cited in

(6)

• scientific article; zbMATH DE number 4172724 (Why is no real title available?)
• 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
• scientific article; zbMATH DE number 4185378 (Why is no real title available?)
• On the tractability of hard scheduling problems with generalized due-dates with respect to the number of different due-dates

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)