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...
Uloženo v:
| Vydáno v: | International journal of production research Ročník 13; číslo 1; s. 25 - 40 |
|---|---|
| Hlavní autoři: | , , |
| Médium: | Journal Article |
| Jazyk: | angličtina |
| Vydáno: |
Taylor & Francis Group
01.01.1975
|
| ISSN: | 0020-7543, 1366-588X |
| 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!
|
| Shrnutí: | 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 |