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

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:International journal of production research Ročník 57; číslo 2; s. 544 - 559
Hlavní autoři: Shang, Zhen, Zhao, Songzheng, Qian, Yanjun, Lin, Jun
Médium: Journal Article
Jazyk:angličtina
Vydáno: London Taylor & Francis 17.01.2019
Taylor & Francis LLC
Témata:
Algorithms
Branch-and-Prune Algorithm
design structure matrix
Feedback
Hash based algorithms
hash function
Information flow
iterative process
Optimization
production and manufacturing system
Sequences
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!
Popis
Shrnutí: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.
Bibliografie: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