On schedules of works on a computer with running times depending nonlinearly on time

MaRDI QIDQ3364384zbMATH OpenFDO

Authors

Publication date 1995

zbMATH Keywords

completion timedeadlinepseudopolynomial algorithmone machine

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 1187294
• The Pareto-optimal set of the NP-hard problem of minimization of the maximum lateness for a single machine
• scientific article; zbMATH DE number 1285632
• Minimization of the maximal lateness for a single machine
• Scheduling problem: complexity analysis and polynomially solvable subclasses

This page was built for publication: On schedules of works on a computer with running times depending nonlinearly on time

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