Merging Nodes in Search Trees: an Exact Exponential Algorithm for the Single Machine Total Tardiness Scheduling Problem

DOI10.4230/LIPIcs.IPEC.2017.28zbMath1443.68222OpenAlexW2792275786MaRDI QIDQ5111888

Vincent T'kindt, Michele Garraffa, Lei Shang, Frederico 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)

Related Items (1)

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

Cites Work

• Exact exponential algorithms.
• The single-machine total tardiness scheduling problem: review and extensions
• Decomposition of the single machine total tardiness problem
• An exact exponential branch-and-merge algorithm for the single machine total tardiness problem
• A decomposition algorithm for the single machine total tardiness problem
• Minimizing Total Tardiness on One Machine is NP-Hard
• One-Machine Sequencing to Minimize Certain Functions of Job Tardiness
• Algorithmic paradoxes of the single-machine total tardiness problem
• Unnamed Item
• Unnamed Item

This page was built for publication: Merging Nodes in Search Trees: an Exact Exponential Algorithm for the Single Machine Total Tardiness Scheduling Problem