Merging nodes in search trees: an exact exponential algorithm for the single machine total tardiness scheduling problem

DOI10.4230/LIPICS.IPEC.2017.28zbMATH Open1443.68222OpenAlexW2792275786MaRDI QIDQ5111888FDOQ5111888

Authors Lei Shang, Michele Garraffa, Vincent T'kindt, F. Della Croce

Publication date 27 May 2020

Full work available at URL https://doi.org/10.4230/LIPIcs.IPEC.2017.28

zbMATH Keywords

exact exponential algorithmbranch-and-mergesingle-machine total tardiness

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Deterministic scheduling theory in operations research (90B35) Data structures (68P05)

Recommendations

• An exact exponential branch-and-merge algorithm for the single machine total tardiness problem
• Decomposition of the single machine total tardiness problem
• A survey of algorithms for the single machine total weighted tardiness scheduling problem
• Algorithmic paradoxes of the single-machine total tardiness problem
• A new decomposition approach for the single machine total tardiness scheduling problem

Cites work

• scientific article; zbMATH DE number 3550186 (Why is no real title available?)
• scientific article; zbMATH DE number 1953201 (Why is no real title available?)
• A decomposition algorithm for the single machine total tardiness problem
• Algorithmic paradoxes of the single-machine total tardiness problem
• An exact exponential branch-and-merge algorithm for the single machine total tardiness problem
• Decomposition of the single machine total tardiness problem
• Exact exponential algorithms.
• Minimizing Total Tardiness on One Machine is NP-Hard
• One-Machine Sequencing to Minimize Certain Functions of Job Tardiness
• The single-machine total tardiness scheduling problem: review and extensions

Cited in

(1)

• An exact exponential branch-and-merge algorithm for the single machine total tardiness problem

This page was built for publication: Merging nodes in search trees: an exact exponential algorithm for the single machine total tardiness scheduling problem

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