merging nodes in search trees an exact exponential algorithm for the single machine total tardiness scheduling problem
Uložené v:
| Názov: | merging nodes in search trees an exact exponential algorithm for the single machine total tardiness scheduling problem |
|---|---|
| Autori: | Shang, Lei, Garraffa, Michele, Della Croce, Federico, T'Kindt, Vincent |
| Prispievatelia: | Lei Shang and Michele Garraffa and Federico Della Croce and Vincent T'Kindt |
| Informácie o vydavateľovi: | Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2018. |
| Rok vydania: | 2018 |
| Predmety: | Exact exponential algorithm, Single machine total tardiness, Branch-and-merge, ddc:004 |
| Popis: | This paper proposes an exact exponential algorithm for the problem of minimizing the total tardiness of jobs on a single machine. It exploits the structure of a basic branch-and-reduce framework based on the well known Lawler's decomposition property. The proposed algorithm, called branch-and-merge, is an improvement of the branch-and-reduce technique with the embedding of a node merging operation. Its time complexity is O*(2.247^n) keeping the space complexity polynomial. The branch-and-merge technique is likely to be generalized to other sequencing problems with similar decomposition properties. |
| Druh dokumentu: | Article Conference object |
| Popis súboru: | application/pdf |
| DOI: | 10.4230/lipics.ipec.2017.28 |
| Prístupová URL adresa: | https://drops.dagstuhl.de/opus/volltexte/2018/8546/ https://doi.org/10.4230/LIPIcs.IPEC.2017.28 https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2017.28 |
| Rights: | CC BY |
| Prístupové číslo: | edsair.dedup.wf.002..be9c3dbeca2bc72fd48a6980ac7e08a1 |
| Databáza: | OpenAIRE |
Nájsť tento článok vo Web of Science | Abstrakt: | This paper proposes an exact exponential algorithm for the problem of minimizing the total tardiness of jobs on a single machine. It exploits the structure of a basic branch-and-reduce framework based on the well known Lawler's decomposition property. The proposed algorithm, called branch-and-merge, is an improvement of the branch-and-reduce technique with the embedding of a node merging operation. Its time complexity is O*(2.247^n) keeping the space complexity polynomial. The branch-and-merge technique is likely to be generalized to other sequencing problems with similar decomposition properties. |
|---|---|
| DOI: | 10.4230/lipics.ipec.2017.28 |