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...
Gespeichert in:
| Veröffentlicht in: | International journal of production research Jg. 13; H. 1; S. 25 - 40 |
|---|---|
| Hauptverfasser: | , , |
| 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!
|
Schreiben Sie den ersten Kommentar!