✦ LIBER ✦

Semi on-line scheduling for maximizing the minimum machine completion time on three uniform machines

✍ Scribed by Luo Run-zi; Sun Shi-jie

Publisher: SP Zhejiang University Press
Year: 2005
Tongue: English
Weight: 396 KB
Volume: 6
Category: Article
ISSN: 1009-3095
DOI: 10.1007/bf02841770

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Maximizing the minimum completion time o

Maximizing the minimum completion time on parallel machines

✍ Mohamed Haouari; Mahdi Jemmali 📂 Article 📅 2007 🏛 Springer 🌐 English ⚖ 182 KB

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 heuristic for maximizing the number of

A heuristic for maximizing the number of on-time jobs on two uniform parallel machines

✍ Christos Koulamas; George J. Kyparisis 📂 Article 📅 2006 🏛 John Wiley and Sons 🌐 English ⚖ 118 KB 👁 1 views

A note on the single-machine scheduling

A note on the single-machine scheduling problem with minimum weighted completion time and maximum allowable tardiness

✍ Suresh Chand; Hans Schneeberger 📂 Article 📅 1986 🏛 John Wiley and Sons 🌐 English ⚖ 328 KB

This paper analyzes the Smith-heuristic for the single-machine scheduling problem where the objective is to minimize the total weighted completion time subject to the constraint that the tardiness for any job does not exceed a prespecified maximum allowable tardiness. We identify several cases of th

The asymptotic performance ratio of an o

The asymptotic performance ratio of an on-line algorithm for uniform parallel machine scheduling with release dates

✍ Mabel C. Chou; Maurice Queyranne; David Simchi-Levi 📂 Article 📅 2005 🏛 Springer-Verlag 🌐 English ⚖ 351 KB