TITLE

AN ALGORITHM FOR SOLVING JOB SEQUENCING PROBLEMS

AUTHOR(S)
Presby, J.T.; Wolfson, M.L.
PUB. DATE
April 1967
SOURCE
Management Science;Apr1967, Vol. 13 Issue 8, pB-454
SOURCE TYPE
Academic Journal
DOC. TYPE
Article
ABSTRACT
The technique described in this paper was devised for sequencing jobs on individual machines having characteristics of: (1) high job changeover costs; (2) small backlogs (10-20 jobs); (3) occasional "rush" orders. The algorithm starts with four-job sequences and from these constructs five-job sequences; from the five-job sequences, six-job sequences are constructed, and so on. At each stage, a large fraction of sequences are eliminated from further consideration. This elimination process makes the computation feasible because the number of all possible sequences becomes unmanageably large, even for small problems. The technique always provides a minimum cost sequence. It also permits determination of optimum sequences of backlog sub-sets; thus, rush orders can be accommodated and anticipated changes in the job backlog can be recognized.
ACCESSION #
7028391

 

Share

Read the Article

Courtesy of THE LIBRARY OF VIRGINIA

Sorry, but this item is not currently available from your library.

Try another library?
Sign out of this library

Other Topics