Minimization of agreeably weighted variance in single machine systems
β Scribed by X. Cai
- Publisher
- Elsevier Science
- Year
- 1995
- Tongue
- English
- Weight
- 1018 KB
- Volume
- 85
- Category
- Article
- ISSN
- 0377-2217
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
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
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
## Abstract In this paper, a singleβmachine scheduling problem with weighted earliness and tardiness penalties is considered. Idle time between two adjacent jobs is permitted and due dates of jobs could be unequal. The dominance rules are utilized to develop a relationship matrix, which allows a br