A general scheme for solving an NP-hard problem in the strong sense of the scheduling theory

DOI10.1023/B:AURC.0000019378.28352.14MaRDI QIDQ2487742zbMATH OpenFDO

Authors O. N. Shulgina

Publication date 8 August 2005

Published in Automation and Remote Control (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1023/B:AURC.0000019378.28352.14

zbMATH Keywords

scheduling problem

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Recommendations

• Solution of the NP-hard total tardiness minimization problem in scheduling theory
• About one algorithm for solving scheduling problem
• Minimizing Total Tardiness on One Machine is NP-Hard
• The Pareto-optimal set of the NP-hard problem of minimization of the maximum lateness for a single machine
• A greedy algorithm for the solution of the classical NP-hard scheduling problem of minimizing the total delay

Cited in

(4)

• Some new efficient methods to solve the \(n/1/r_ i/\sum{}T_ i\) scheduling problem
• Strong NP-hardness of minimizing total deviation with generalized and periodic due dates
• Solution of the NP-hard total tardiness minimization problem in scheduling theory
• About one algorithm for solving scheduling problem

This page was built for publication: A general scheme for solving an NP-hard problem in the strong sense of the scheduling theory

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