✦ LIBER ✦

Minimizing Completion Time Variance with Compressible Processing Times

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

Book ID: 106414152
Publisher: Springer US
Year: 2005
Tongue: English
Weight: 431 KB
Volume: 31
Category: Article
ISSN: 0925-5001
DOI: 10.1007/s10898-004-5703-y

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

Group Scheduling with Controllable Setup

Group Scheduling with Controllable Setup and Processing Times: Minimizing Total Weighted Completion Time

✍ C. T. Ng; T. C. Edwin Cheng; Adam Janiak; Mikhail Y. Kovalyov 📂 Article 📅 2005 🏛 Springer US 🌐 English ⚖ 135 KB

New results on the completion time varia

New results on the completion time variance minimization

✍ Wieslaw Kubiak 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 697 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

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 mean absolute deviation of jo

Minimizing mean absolute deviation of job completion times from the mean completion time

✍ Gur Mosheiov 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 111 KB 👁 3 views