Journal ArticleDOI
Minimizing the Time-in-System Variance for a Finite Jobset
TLDR
In this article, a finite number of jobs are scheduled on a single machine and the objective is to sequence the jobs so that the time-in-system (or equivalently, the completion time) variance is minimized.Abstract:
There are a finite number of jobs to be scheduled on a single machine. All jobs are available from the start and the objective is to sequence the jobs so that the time-in-system (or equivalently, the completion time) variance is minimized. A number of necessary conditions for an optimal sequencing (which for small jobsets turn out to be sufficient) are presented.read more
Citations
More filters
Journal ArticleDOI
Minimizing the average deviation of job completion times about a common due date
TL;DR: In this article, a single-machine scheduling problem in which penalities occur when a job is completed early or late is considered, where the objective is to minimize the total penalty subject to restrictive assumptions on the due dates and penalty functions.
Journal ArticleDOI
Minimizing Variation of Flow Time in Single Machine Systems
TL;DR: This paper addresses the problem of n jobs to be scheduled on a single machine in such a way that flow time variation is minimized and a heuristic method for scheduling is proposed.
Journal ArticleDOI
Minimising Waiting Time Variance in the Single Machine Problem
Samuel Eilon,I. G. Chowdhury +1 more
TL;DR: A heuristic method is proposed for solving the problem where n is large; this method requires very little computing and was found to produce very good results for a sample of problems of varying size.
Journal ArticleDOI
Minimizing mean absolute deviation of completion times about a common due date.
TL;DR: In this paper, the authors consider a single machine scheduling problem in which the objective is to minimize the mean absolute deviation of job completion times about a common due date and present an algorithm for determining multiple optimal schedules under restrictive assumptions about the due date, and an implicit enumeration procedure when the assumptions do not hold.
Journal ArticleDOI
Simultaneous minimization of mean and variation flow time and waiting in single machine systems
TL;DR: This paper considers bicriterion scheduling problems involving job completion times and job waiting times in a nonpreemptive single machine environment and presents an efficient algorithm for minimizing the variation of waiting time.
References
More filters
Journal ArticleDOI
Variance Minimization in Single Machine Sequencing Problems
Alan G. Merten,Mervin E. Muller +1 more
TL;DR: While the two mean performance measures attain their minimums at the same job sequence, it is shown that the sequence that minimizes the variance of flow-time is antithetical to the sequenceThat minimizesThe variance of waiting-time, and the minimum values of the two variance measures are equal.