✦ LIBER ✦

Algorithms for solving the NP-hard problem of minimizing total tardiness for a single machine

✍ Scribed by A. A. Lazarev; A. G. Kvaratskheliya; E. R. Gafarov

Book ID: 111454300
Publisher: SP MAIK Nauka/Interperiodica
Year: 2007
Tongue: English
Weight: 185 KB
Volume: 75
Category: Article
ISSN: 1064-5624
DOI: 10.1134/s106456240701036x

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A special case of the single-machine tot

A special case of the single-machine total tardiness problem is NP-hard

✍ E. R. Gafarov; A. A. Lazarev 📂 Article 📅 2006 🏛 SP MAIK Nauka/Interperiodica 🌐 English ⚖ 249 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

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 hybrid algorithm for the one machine s

A hybrid algorithm for the one machine sequencing problem to minimize total tardiness

✍ V. Srinivasan 📂 Article 📅 1971 🏛 John Wiley and Sons 🌐 English ⚖ 568 KB

In a recent paper, Hamilton Emmons has established theorems relating to the order in which pairs of jobs are to be processed in an optimal schedule to minimize the total tardiness of performing n jobs on one machine. Using these theorems, the algorithm of this paper determines the precedence relatio

A branch-and-bound parallel algorithm fo

A branch-and-bound parallel algorithm for single-machine total weighted tardiness problem

✍ Mieczysław Wodecki 📂 Article 📅 2007 🏛 Springer 🌐 English ⚖ 265 KB