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.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
