✦ LIBER ✦

Comments on “Competitive analysis of a better on-line algorithm to minimize total completion time on a single-machine”

✍ Scribed by Jiping Tao; Zhijun Chao; Yugeng Xi

Publisher: Springer US
Year: 2010
Tongue: English
Weight: 129 KB
Volume: 49
Category: Article
ISSN: 0925-5001
DOI: 10.1007/s10898-010-9549-1

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On-line scheduling on a single machine:

On-line scheduling on a single machine: minimizing the total completion time

✍ Amos Fiat; Gerhard J. Woeginger 📂 Article 📅 1999 🏛 Springer-Verlag 🌐 English ⚖ 65 KB

A memetic algorithm for minimizing the t

A memetic algorithm for minimizing the total weighted completion time on a single machine under linear deterioration

✍ Jalil Layegh; Fariborz Jolai 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 698 KB

Minimizing the total weighted completion

Minimizing the total weighted completion time on a single machine under linear deterioration

✍ Chin-Chia Wu; Wen-Chiung Lee; Yau-Ren Shiau 📂 Article 📅 2006 🏛 Springer 🌐 English ⚖ 144 KB

Minimizing the weighted sum of quadratic

Minimizing the weighted sum of quadratic completion times on a single machine

✍ Federico Della Croce; Wlodzimierz Szwarc; Roberto Tadei; Paolo Baracco; Raffaele 📂 Article 📅 1995 🏛 John Wiley and Sons 🌐 English ⚖ 429 KB 👁 2 views

AnO(n2) algorithm for scheduling equal-l

AnO(n2) algorithm for scheduling equal-length preemptive jobs on a single machine to minimize total tardiness

✍ Zhongjun Tian; C. T. Ng; T. C. E. Cheng 📂 Article 📅 2006 🏛 Springer US 🌐 English ⚖ 423 KB

Restarts can help in the on-line minimiz

Restarts can help in the on-line minimization of the maximum delivery time on a single machine

✍ Marjan van den Akker; Han Hoogeveen; Nodari Vakhania 📂 Article 📅 2000 🏛 Springer US 🌐 English ⚖ 86 KB 👁 2 views