An implicit enumeration algorithm for complex scheduling problems

Several algorithms have been presented for handling complex scheduling problems. These methods are computationally impractical when confronted with large problems. New algorithms have been developed for solving job-shop problems. They are more efficient than the previous ones because they use domina...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	International journal of production research Jg. 13; H. 1; S. 25 - 40
Hauptverfasser:	FLORIAN, M., TILQUIN, C., TILQUIN, G.
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Taylor & Francis Group 01.01.1975
ISSN:	0020-7543, 1366-588X
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Beschreibung
Zusammenfassung:	Several algorithms have been presented for handling complex scheduling problems. These methods are computationally impractical when confronted with large problems. New algorithms have been developed for solving job-shop problems. They are more efficient than the previous ones because they use dominance and better bound ideas. The purpose of this paper is to present an efficient algorithm for complex scheduling problems generalizing those ideas.
ISSN:	0020-7543 1366-588X
DOI:	10.1080/00207547508942972