✦ LIBER ✦

Single machine total tardiness maximization problems: complexity and algorithms

✍ Scribed by Evgeny R. Gafarov, Alexander A. Lazarev, Frank Werner

Book ID: 120966608
Publisher: Springer US
Year: 2012
Tongue: English
Weight: 522 KB
Volume: 207
Category: Article
ISSN: 0254-5330
DOI: 10.1007/s10479-012-1288-x

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Algorithmic paradoxes of the single-mach

Algorithmic paradoxes of the single-machine total tardiness problem

✍ Wlodzimierz Szwarc; Andrea Grosso; Federico Della Croce 📂 Article 📅 2001 🏛 Springer US 🌐 English ⚖ 108 KB

The paper deals with the single-machine total tardiness problem. It investigates the authors' most recent branch and bound algorithm and discovers the following paradoxes. Deleting a lower bound drastically improves the performance of the algorithm, while adding a stronger component, like a better d

An Efficient Algorithm for the Single Ma

An Efficient Algorithm for the Single Machine Total Tardiness Problem

✍ Barbaros Ç. Tansel; Bahar Y. Kara; Ihsan Sabuncuoglu 📂 Article 📅 2001 🏛 Taylor and Francis Group 🌐 English ⚖ 202 KB

A decomposition algorithm for the single

A decomposition algorithm for the single machine total tardiness problem

✍ C.N Potts; L.N Van Wassenhove 📂 Article 📅 1982 🏛 Elsevier Science 🌐 English ⚖ 533 KB

A hybrid algorithm for the single-machin

A hybrid algorithm for the single-machine total tardiness problem

✍ T.C.E. Cheng; A.A. Lazarev; E.R. Gafarov 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 170 KB

On the single machine total tardiness pr

On the single machine total tardiness problem

✍ Z.J. Tian; C.T. Ng; T.C.E. Cheng 📂 Article 📅 2005 🏛 Elsevier Science 🌐 English ⚖ 253 KB

Transforming a pseudo-polynomial algorit

Transforming a pseudo-polynomial algorithm for the single machine total tardiness maximization problem into a polynomial one

✍ Evgeny R. Gafarov, Alexander A. Lazarev, Frank Werner 📂 Article 📅 2012 🏛 Springer US 🌐 English ⚖ 579 KB