𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Cycle time variance minimization in dynamic scheduling of single machine systems

✍ Scribed by Amit Kumar Gupta; Viswanath Kumar Ganesan; Appa Iyer Sivakumar

Publisher
Springer
Year
2008
Tongue
English
Weight
174 KB
Volume
42
Category
Article
ISSN
0268-3768

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

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

Minimizing weighted earliness and tardin
Minimizing weighted earliness and tardiness penalties in single-machine scheduling with idle time permitted
✍ Jaw-Yeh Chen; Sheng-Fuu Lin πŸ“‚ Article πŸ“… 2002 πŸ› John Wiley and Sons 🌐 English βš– 169 KB

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

Minimizing weighted mean absolute deviat
Minimizing weighted mean absolute deviation of flow times in single machine systems
✍ Y. P. Aneja; S. N. Kabadi; A. Nagar πŸ“‚ Article πŸ“… 1998 πŸ› John Wiley and Sons 🌐 English βš– 94 KB πŸ‘ 2 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