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

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Management science Ročník 17; číslo 12; s. B-782 - B-792
Hlavní autoři: Florian, M, Trepant, P, McMahon, G
Médium: Journal Article
Jazyk:angličtina
Vydáno: Linthicum INFORMS 01.08.1971
Institute of Management Sciences
Institute for Operations Research and the Management Sciences
Edice:Management Science
Témata:
Algorithms
Critical path
Iterative solutions
Machinery
Optimal solutions
Scheduling
Sequencing
Terminal operations
ISSN:0025-1909, 1526-5501
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí: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.
Bibliografie: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