✦ LIBER ✦

A fully polynomial approximation scheme for the total tardiness problem

✍ Scribed by E.L. Lawler

Publisher: Elsevier Science
Year: 1982
Tongue: English
Weight: 169 KB
Volume: 1
Category: Article
ISSN: 0167-6377
DOI: 10.1016/0167-6377(82)90022-0

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A fully polynomial approximation algorit

A fully polynomial approximation algorithm for the 0–1 knapsack problem

✍ M.J. Magazine; Osman Oguz 📂 Article 📅 1981 🏛 Elsevier Science 🌐 English ⚖ 428 KB

A polynomial time approximation scheme f

A polynomial time approximation scheme for the SONET ring loading problem

✍ Sanjeev Khanna 📂 Article 📅 2002 🏛 Institute of Electrical and Electronics Engineers 🌐 English ⚖ 110 KB 👁 1 views

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 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 search scheme for approximate solution

A search scheme for approximate solutions of the convex programming problem

✍ V.Yu. Lebedev 📂 Article 📅 1977 🏛 Elsevier Science ⚖ 359 KB

Polynomial-time approximation scheme for

Polynomial-time approximation scheme for concurrent open shop scheduling with a fixed number of machines to minimize the total weighted completion time

✍ T.C. Edwin Cheng; Qingqin Nong; Chi To Ng 📂 Article 📅 2011 🏛 John Wiley and Sons 🌐 English ⚖ 133 KB 👁 1 views