An Algorithm for the Construction and Evaluation of Feasible Schedules

Jack Heller and George Logemann
Additional contact information
Jack Heller: Institute of Mathematical Sciences, New York University
George Logemann: Institute of Mathematical Sciences, New York University

Management Science, 1962, vol. 8, issue 2, 168-183

Abstract: An algorithm for the generation of feasible schedules and the computation of the completion times of the job operations of feasible schedule is presented. Using this algorithm, the distribution of schedule times over the set of feasible schedule--or a subset of feasible schedules--was determined for technological orderings that could occur in a general machine shop. These distributions are found to be approximately normal. Biasing techniques corresponding to "first come first serve," random choice of jobs ready at each machine and combinations of these two extremes were used to compute distributions of schedule times. In all the experiments "first come first serve" appears the best in the sense that convergence to the minimum is fastest and the smallest. The work presented in this paper is supported by the AEC Computing and Applied Mathematics Center, Institute of Mathematical Sciences, New York University, under Contract AT(30-l)-1480 with the U.S. Atomic Energy Commission.

Date: 1962
References: Add references at CitEc
Citations:

Downloads: (external link)
http://dx.doi.org/10.1287/mnsc.8.2.168 (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:8:y:1962:i:2:p:168-183

Access Statistics for this article

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