✦ LIBER ✦

New results on the completion time variance minimization

✍ Scribed by Wieslaw Kubiak

Book ID: 104184520
Publisher: Elsevier Science
Year: 1995
Tongue: English
Weight: 697 KB
Volume: 58
Category: Article
ISSN: 0166-218X
DOI: 10.1016/0166-218x(93)e0125-i

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Completion time variance minimization on

Completion time variance minimization on a single machine is difficult

✍ Wieslaw Kubiak 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 448 KB

Minimizing Completion Time Variance with

Minimizing Completion Time Variance with Compressible Processing Times

✍ C. T. Ng; X. Cai; T. C. E. Cheng; S. S. Lam 📂 Article 📅 2005 🏛 Springer US 🌐 English ⚖ 431 KB

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

Single- and multiple-processor models fo

Single- and multiple-processor models for minimizing completion time variance

✍ Nicholas G. Hall 📂 Article 📅 1986 🏛 John Wiley and Sons 🌐 English ⚖ 283 KB

This article concerns the scheduling of n jobs around a common due date, so as to minimize the average total earliness plus total lateness of the jobs. Optimality conditions for the problem are developed, based on its equivalence to an easy scheduling problem. It seems that this problem inherently h

Sequencing jobs with random processing t

Sequencing jobs with random processing times to minimize weighted completion time variance

✍ X. Cai; S. Zhou 📂 Article 📅 1997 🏛 Springer US 🌐 English ⚖ 124 KB

Minimization of expected variance of com

Minimization of expected variance of completion times on single machine for stochastic jobs

✍ V. Rajendra Prasad; D. K. Manna 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 461 KB 👁 2 views

This article deals with the problem of scheduling jobs with random processing times on single machine in order to minimize the expected variance of job completion times. SutTicient conditions for the existence of V-shaped optimal sequences are derived separately for general and ordered job processin