๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

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

โœ Scribed by Federico Della Croce; Wlodzimierz Szwarc; Roberto Tadei; Paolo Baracco; Raffaele di Tullio


Publisher
John Wiley and Sons
Year
1995
Tongue
English
Weight
429 KB
Volume
42
Category
Article
ISSN
0894-069X

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


Minimizing weighted mean absolute deviat
โœ Y. P. Aneja; S. N. Kabadi; A. Nagar ๐Ÿ“‚ Article ๐Ÿ“… 1998 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 94 KB ๐Ÿ‘ 1 views

We discuss the problem of scheduling several jobs on a single machine with the objective of minimizing the weighted mean absolute deviation of flow times around the weighted mean flow time. We first show that the optimal schedule is W-shaped. For the unweighted case, we show that all optimal schedul

Minimization of expected variance of com
โœ 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

Polynomial time algorithms for minimizin
โœ Philippe Baptiste ๐Ÿ“‚ Article ๐Ÿ“… 1999 ๐Ÿ› Springer US ๐ŸŒ English โš– 102 KB ๐Ÿ‘ 2 views

We study the problem of minimizing the weighted number of late jobs to be scheduled on a single machine when processing times are equal. In this paper, we show that this problem, as well as its preemptive variant, are strongly polynomial. When preemption is not allowed ( 1"p H "p, r H " w H ; H ), t