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
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
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
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