Exact algorithms for the feedback length minimisation problem
Planning the sequence of interrelated activities of production and manufacturing systems has become a challenging issue due to the existence of cyclic information flows. This study develops efficient exact algorithms for finding an activity sequence with minimum total feedback length in a design str...
Gespeichert in:
| Veröffentlicht in: | International journal of production research Jg. 57; H. 2; S. 544 - 559 |
|---|---|
| Hauptverfasser: | , , , |
| Format: | Journal Article |
| Sprache: | Englisch |
| Veröffentlicht: |
London
Taylor & Francis
17.01.2019
Taylor & Francis LLC |
| Schlagworte: | |
| ISSN: | 0020-7543, 1366-588X |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| Zusammenfassung: | Planning the sequence of interrelated activities of production and manufacturing systems has become a challenging issue due to the existence of cyclic information flows. This study develops efficient exact algorithms for finding an activity sequence with minimum total feedback length in a design structure matrix. First, we present two new properties of the problem. Second, based on the properties, we develop an efficient Parallel Branch-and-Prune algorithm (PBP). Finally, the proposed PBP is further improved by adopting hash functions representing activity sequences, which is referred as hash function-based PBP. Experimental results indicate that the proposed hash function-based PBP can find optimal solutions for problems up to 25 interrelated activities within 1 h, and outperforms existing methods. |
|---|---|
| Bibliographie: | ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 14 |
| ISSN: | 0020-7543 1366-588X |
| DOI: | 10.1080/00207543.2018.1456697 |