Deterministic and random single machine sequencing with variance minimization
Operations Research
Scheduling about a common due date with earliness and tardiness penalties
Computers and Operations Research
Sequencing with earliness and tardiness penalties: a review
Operations Research
On the minimization of completion time variance with a bicriteria extension
Operations Research
On the general solution for a class of early/tardy problems
Computers and Operations Research
Minimizing single-machine completion time variance
Management Science
Multi-machine scheduling with variance minimization
Discrete Applied Mathematics
Minimizing total earliness and tardiness on a single machine using a hybrid heuristic
Computers and Operations Research
| Hi-index | 0.01 |
We discuss a non-preemptive single-machine job sequencing problem where the objective is to minimize the sum of squared deviation of completion times of jobs from a common due date. There are three versions of the problem--tightly restricted, restricted and unrestricted. Separate dynamic programming formulations have already been suggested for each of these versions, but no unified approach is available. We have proposed a pseudo-polynomial DP solution and a polynomial heuristic for general instance. Computational results show that tightly restricted instances of up to 600 jobs can be solved in less than 6 s. General instances of up to 80 jobs take less than 2s.