Deterministic and random single machine sequencing with variance minimization
Operations Research
Sequencing with earliness and tardiness penalties: a review
Operations Research
The Essentials of Computer Organization And Architecture
The Essentials of Computer Organization And Architecture
Job scheduling to minimize the weighted waiting time variance of jobs
Computers and Industrial Engineering
Job scheduling methods for reducing waiting time variance
Computers and Operations Research
Scheduling: Theory, Algorithms, and Systems
Scheduling: Theory, Algorithms, and Systems
Minimization of Job Waiting Time Variance on Identical Parallel Machines
IEEE Transactions on Systems, Man, and Cybernetics, Part C: Applications and Reviews
Completion time variance minimization on a single machine is difficult
Operations Research Letters
Proof of a conjecture of Schrage about the completion time variance problem
Operations Research Letters
| Hi-index | 0.00 |
This paper considers the problem of scheduling n non-preemptive jobs on a single processor. Each job may have different size and weight. The objective is to minimize the weighted waiting time variance (WWTV). It is shown that the proof of one previous established optimality property in the literature, called ''agreeably weighted property'', is wrong and the corrected proof is presented. Additional optimality properties are proved for the cases where job sizes are directly or inversely proportional to their weights, respectively. In addition, we show that the objective function of the problem can be expressed as a function of positional weights and processing times. With this new functional form, the proofs of several previously established optimality properties in the literature become rather straightforward.