An Implicit Enumeration Algorithm for the Machine Sequencing Problem

M. Florian, P. Trepant and G. McMahon
Additional contact information
M. Florian: University of Montreal
P. Trepant: University of Montreal
G. McMahon: University of New South Wales, Kensington, Australia

Management Science, 1971, vol. 17, issue 12, B782-B792

Abstract: An implicit enumeration algorithm is developed for the machine sequencing problem. The method is based on the graph-theoretical representation of the problem. The convergence of the algorithm is demonstrated, and its efficiency is evaluated by experiments carried out with a code written for the CDC 6400 computer.

Date: 1971
References: Add references at CitEc
Citations: View citations in EconPapers (5)

Downloads: (external link)
http://dx.doi.org/10.1287/mnsc.17.12.B782 (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:17:y:1971:i:12:p:b782-b792

Access Statistics for this article

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