shortest job first


Also found in: Acronyms.

shortest job first

(algorithm)
A scheduling algorithm used in multitasking operating systems that favours processes with the shortest estimated running time.
This article is provided by FOLDOC - Free Online Dictionary of Computing (foldoc.org)
Mentioned in ?
References in periodicals archive ?
We build the periodic real time task scheduling model, and then we have demonstrated the first come first served scheduling, shortest job first scheduling, Round Robin and Earliest Deadline First scheduling.