✦ LIBER ✦

A tight lower bound for the completion time variance problem

✍ Scribed by C.T. Ng; X. Cai; T.C.E. Cheng

Publisher: Elsevier Science
Year: 1996
Tongue: English
Weight: 216 KB
Volume: 92
Category: Article
ISSN: 0377-2217
DOI: 10.1016/0377-2217(95)00165-4

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A tight lower bound for the train revers

A tight lower bound for the train reversal problem

✍ Alok Aggarwal; Tom Leighton 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 319 KB

Proof of a conjecture of Schrage about t

Proof of a conjecture of Schrage about the completion time variance problem

✍ Nicholas G. Hall; Wieslaw Kubiak 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 299 KB

Probabilistic analysis of an asymptotica

Probabilistic analysis of an asymptotically optimal solution for the completion time variance problem

✍ C.T. Ng; X. Cai; T.C.E. Cheng 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 135 KB 👁 2 views

Scheduling a set of n jobs on a single machine so as to minimize the completion time variance is a well-known NP-hard problem. In this paper, we propose a sequence, which can be constructed in O(n log n) time, as a solution for the problem. Our primary concern is to establish the asymptotical optima

Bounds for the position of the smallest

Bounds for the position of the smallest job in completion time variance minimization

✍ D.K. Manna; V.Rajendra Prasad 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 118 KB

A Lower Bound for the Shortest Path Prob

A Lower Bound for the Shortest Path Problem

✍ Ketan Mulmuley; Pradyut Shah 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 183 KB

A general lower bound for the makespan p

A general lower bound for the makespan problem

✍ S.T. Webster 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 598 KB