On the Scheduling of Jobs by Computer

Open Access
Publisher Website
Google Scholar
Abstract
The problem of deciding the best order in which to process a set of jobs in a factory has so far eluded theoretical solution except in very simple cases. A similarity between the scheduling problem and the sorting one suggests adapting well-known sorting methods. A scheduling method based on merging is shown to give results that are better than those from known methods.

This publication has 0 references indexed in Scilit: