An Algorithm for Solving Job Sequencing Problems

J. T. Presby and M. L. Wolfson
Additional contact information
J. T. Presby: Touche, Ross, Bailey & Smart
M. L. Wolfson: United States Steel Corporation

Management Science, 1967, vol. 13, issue 8, B454-B464

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.

Date: 1967
References: Add references at CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://dx.doi.org/10.1287/mnsc.13.8.B454 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:ormnsc:v:13:y:1967:i:8:p:b454-b464

Access Statistics for this article

More articles in Management Science from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().