An Implicit Enumeration Algorithm for the Machine Sequencing Problem

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...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Management science Jg. 17; H. 12; S. B-782 - B-792
Hauptverfasser: Florian, M, Trepant, P, McMahon, G
Format: Journal Article
Sprache:Englisch
Veröffentlicht: Linthicum INFORMS 01.08.1971
Institute of Management Sciences
Institute for Operations Research and the Management Sciences
Schriftenreihe:Management Science
Schlagworte:
Algorithms
Critical path
Iterative solutions
Machinery
Optimal solutions
Scheduling
Sequencing
Terminal operations
ISSN:0025-1909, 1526-5501
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung: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.
Bibliographie:SourceType-Scholarly Journals-1
ObjectType-Statistics/Data Report-1
content type line 14
ISSN:0025-1909
1526-5501
DOI:10.1287/mnsc.17.12.B782