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

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:International journal of production research Jg. 57; H. 2; S. 544 - 559
Hauptverfasser: Shang, Zhen, Zhao, Songzheng, Qian, Yanjun, Lin, Jun
Format: Journal Article
Sprache:Englisch
Veröffentlicht: London Taylor & Francis 17.01.2019
Taylor & Francis LLC
Schlagworte:
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
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Abstract 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.
AbstractList 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.
Author Zhao, Songzheng
Qian, Yanjun
Lin, Jun
Shang, Zhen
Author_xml – sequence: 1
  givenname: Zhen
  surname: Shang
  fullname: Shang, Zhen
  organization: School of Management, Northwestern Polytechnical University
– sequence: 2
  givenname: Songzheng
  surname: Zhao
  fullname: Zhao, Songzheng
  organization: School of Management, Northwestern Polytechnical University
– sequence: 3
  givenname: Yanjun
  orcidid: 0000-0002-0765-4870
  surname: Qian
  fullname: Qian, Yanjun
  email: qiany@nwpu.edu.cn
  organization: School of Management, Northwestern Polytechnical University
– sequence: 4
  givenname: Jun
  surname: Lin
  fullname: Lin, Jun
  organization: School of Management, Xi'an Jiaotong University
BookMark eNqFkM1KAzEURoNUsK0-gjDgemoyM0kmiKCU-gMFNwruQpJJ2tSZpCYp2rd3auvGhd7N3Xznu5czAgPnnQbgHMEJgjW8hLCAFFflpIConqAKE8LoERiikpAc1_XrAAx3mXwXOgGjGFewH1xXQ3A9-xQqZaJd-GDTsouZ8SFLS50ZrRsp1FvWardIy6yzznY2imS9y9bBy1Z3p-DYiDbqs8Meg5e72fP0IZ8_3T9Ob-e5KhlOOSpqoaSSmpSMVaShGBFEm4oxQxXBQmhTGGookg2RiJa6qYmkkEqFK6MhLsfgYt_b333f6Jj4ym-C60_yAlFCGcKM9KmrfUoFH2PQhiubvv9NQdiWI8h3vviPL77zxQ--ehr_otfBdiJs_-Vu9px1vbpOfPjQNjyJbeuDCcIpG3n5d8UXMumDiA
CitedBy_id crossref_primary_10_7717_peerj_cs_1597
crossref_primary_10_1016_j_cor_2021_105246
crossref_primary_10_1080_01605682_2021_1923376
crossref_primary_10_1109_TEM_2021_3083595
crossref_primary_10_1109_TEM_2019_2936287
crossref_primary_10_1016_j_jmsy_2025_02_005
crossref_primary_10_1109_TEM_2021_3071324
Cites_doi 10.1109/TEM.2002.806709
10.1007/BF01588087
10.1007/s10951-009-0131-y
10.1080/00207543.2013.807955
10.1017/CBO9781139924801
10.1016/j.ejor.2014.11.019
10.1007/s00163-009-0082-5
10.1080/00207540701324176
10.1109/TEM.2013.2285738
10.1080/00207543.2013.852702
10.1109/TEM.1981.6448589
10.1080/00207549308956755
10.1016/S0377-2217(99)00412-9
10.1007/s10589-015-9725-9
10.1016/j.ejor.2010.02.010
10.1109/17.946528
10.1109/TEM.2011.2107558
10.1007/s00163-015-0205-0
10.1287/mnsc.47.1.1.10668
10.7551/mitpress/8896.001.0001
10.1509/jm.13.0490
10.1080/09544828.2012.727206
10.1287/mnsc.43.8.1104
10.1080/00207543.2015.1043157
10.1080/00207543.2014.885662
10.1080/00207540410001721727
10.1115/1.2717224
10.1115/1.2216730
10.1080/00207543.2011.648779
10.1109/TEM.2013.2267779
ContentType Journal Article
Copyright 2018 Informa UK Limited, trading as Taylor & Francis Group 2018
2018 Informa UK Limited, trading as Taylor & Francis Group
Copyright_xml – notice: 2018 Informa UK Limited, trading as Taylor & Francis Group 2018
– notice: 2018 Informa UK Limited, trading as Taylor & Francis Group
DBID AAYXX
CITATION
7SC
8FD
F28
FR3
JQ2
L7M
L~C
L~D
DOI 10.1080/00207543.2018.1456697
DatabaseName CrossRef
Computer and Information Systems Abstracts
Technology Research Database
ANTE: Abstracts in New Technology & Engineering
Engineering Research Database
ProQuest Computer Science Collection
Advanced Technologies Database with Aerospace
Computer and Information Systems Abstracts – Academic
Computer and Information Systems Abstracts Professional
DatabaseTitle CrossRef
Technology Research Database
Computer and Information Systems Abstracts – Academic
ProQuest Computer Science Collection
Computer and Information Systems Abstracts
Engineering Research Database
Advanced Technologies Database with Aerospace
ANTE: Abstracts in New Technology & Engineering
Computer and Information Systems Abstracts Professional
DatabaseTitleList Technology Research Database
DeliveryMethod fulltext_linktorsrc
Discipline Engineering
EISSN 1366-588X
EndPage 559
ExternalDocumentID 10_1080_00207543_2018_1456697
1456697
Genre Article
GrantInformation_xml – fundername: National Natural Science Foundation of China
  grantid: 71101115; 16BGL017
  funderid: 10.13039/501100001809
– fundername: Fundamental Research Funds for the Central Universities
  grantid: 3102017jc19004
GroupedDBID -~X
.7F
.QJ
0BK
0R~
29J
2DF
30N
4.4
5GY
5VS
8VB
A8Z
AAENE
AAGDL
AAHIA
AAJMT
AALDU
AAMIU
AAPUL
AAQRR
ABCCY
ABFIM
ABHAV
ABJNI
ABLIJ
ABPAQ
ABPEM
ABTAI
ABXUL
ABXYU
ACGEJ
ACGFO
ACGFS
ACGOD
ACIWK
ACNCT
ACTIO
ADCVX
ADGTB
ADXPE
AEGXH
AEISY
AEMOZ
AENEX
AEOZL
AEPSL
AEYOC
AFKVX
AFRVT
AGDLA
AGMYJ
AHDZW
AHQJS
AIAGR
AIJEM
AIYEW
AJWEG
AKBVH
AKOOK
AKVCP
ALMA_UNASSIGNED_HOLDINGS
ALQZU
AQRUH
AQTUD
AVBZW
AWYRJ
BLEHA
CCCUG
CE4
CS3
DGEBU
DKSSO
DU5
EBD
EBE
EBO
EBR
EBS
EBU
EJD
EMK
EPL
ESTFP
E~A
E~B
GTTXZ
H13
HF~
HZ~
H~9
H~P
I-F
IPNFZ
J.P
K1G
KYCEM
LJTGL
M4Z
ML~
NA5
NX~
O9-
P2P
PQQKQ
QWB
RIG
RNANH
ROSJB
RTWRZ
S-T
SNACF
TASJS
TBQAZ
TDBHL
TEN
TFL
TFT
TFW
TH9
TN5
TNC
TTHFI
TUROJ
TWF
UT5
UU3
ZGOLN
ZL0
~S~
AAYXX
CITATION
7SC
8FD
F28
FR3
JQ2
L7M
L~C
L~D
ID FETCH-LOGICAL-c395t-128acbcbe639946d751617d499f7c65aaef2f7f71bd6b173ed86b707bc54fe053
IEDL.DBID TFW
ISICitedReferencesCount 7
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000457968400013&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN 0020-7543
IngestDate Wed Aug 13 06:14:37 EDT 2025
Sat Nov 29 05:36:15 EST 2025
Tue Nov 18 22:15:54 EST 2025
Mon Oct 20 23:49:50 EDT 2025
IsPeerReviewed true
IsScholarly true
Issue 2
Language English
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-c395t-128acbcbe639946d751617d499f7c65aaef2f7f71bd6b173ed86b707bc54fe053
Notes ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ORCID 0000-0002-0765-4870
PQID 2176791596
PQPubID 30924
PageCount 16
ParticipantIDs crossref_citationtrail_10_1080_00207543_2018_1456697
informaworld_taylorfrancis_310_1080_00207543_2018_1456697
proquest_journals_2176791596
crossref_primary_10_1080_00207543_2018_1456697
PublicationCentury 2000
PublicationDate 2019-01-17
PublicationDateYYYYMMDD 2019-01-17
PublicationDate_xml – month: 01
  year: 2019
  text: 2019-01-17
  day: 17
PublicationDecade 2010
PublicationPlace London
PublicationPlace_xml – name: London
PublicationTitle International journal of production research
PublicationYear 2019
Publisher Taylor & Francis
Taylor & Francis LLC
Publisher_xml – name: Taylor & Francis
– name: Taylor & Francis LLC
References CIT0030
CIT0010
CIT0032
CIT0031
CIT0014
CIT0013
CIT0016
CIT0015
CIT0018
CIT0017
CIT0019
CIT0021
CIT0020
CIT0001
CIT0023
CIT0022
Gebala D. A. (CIT0012) 1991
CIT0003
CIT0025
CIT0002
CIT0024
CIT0005
CIT0027
CIT0004
CIT0026
CIT0007
CIT0029
CIT0006
CIT0028
CIT0009
CIT0008
References_xml – ident: CIT0004
  doi: 10.1109/TEM.2002.806709
– ident: CIT0009
  doi: 10.1007/BF01588087
– ident: CIT0005
  doi: 10.1007/s10951-009-0131-y
– ident: CIT0013
  doi: 10.1080/00207543.2013.807955
– ident: CIT0017
  doi: 10.1017/CBO9781139924801
– ident: CIT0019
  doi: 10.1016/j.ejor.2014.11.019
– ident: CIT0025
  doi: 10.1007/s00163-009-0082-5
– ident: CIT0016
  doi: 10.1080/00207540701324176
– ident: CIT0022
  doi: 10.1109/TEM.2013.2285738
– ident: CIT0024
  doi: 10.1080/00207543.2013.852702
– ident: CIT0028
  doi: 10.1109/TEM.1981.6448589
– ident: CIT0015
  doi: 10.1080/00207549308956755
– ident: CIT0002
  doi: 10.1016/S0377-2217(99)00412-9
– ident: CIT0026
  doi: 10.1007/s10589-015-9725-9
– ident: CIT0023
  doi: 10.1016/j.ejor.2010.02.010
– ident: CIT0003
  doi: 10.1109/17.946528
– ident: CIT0030
  doi: 10.1109/TEM.2011.2107558
– ident: CIT0021
  doi: 10.1007/s00163-015-0205-0
– ident: CIT0014
  doi: 10.1287/mnsc.47.1.1.10668
– ident: CIT0008
  doi: 10.7551/mitpress/8896.001.0001
– ident: CIT0010
  doi: 10.1509/jm.13.0490
– ident: CIT0031
  doi: 10.1080/09544828.2012.727206
– ident: CIT0027
  doi: 10.1287/mnsc.43.8.1104
– ident: CIT0032
  doi: 10.1080/00207543.2015.1043157
– ident: CIT0007
  doi: 10.1080/00207543.2014.885662
– ident: CIT0006
  doi: 10.1080/00207540410001721727
– ident: CIT0020
  doi: 10.1115/1.2717224
– ident: CIT0001
  doi: 10.1115/1.2216730
– start-page: 227
  year: 1991
  ident: CIT0012
  publication-title: Proceedings of ASME 3rd International Conference on Design Theory Methodology
– ident: CIT0018
  doi: 10.1080/00207543.2011.648779
– ident: CIT0029
  doi: 10.1109/TEM.2013.2267779
SSID ssj0000584
Score 2.28494
Snippet Planning the sequence of interrelated activities of production and manufacturing systems has become a challenging issue due to the existence of cyclic...
SourceID proquest
crossref
informaworld
SourceType Aggregation Database
Enrichment Source
Index Database
Publisher
StartPage 544
SubjectTerms Algorithms
Branch-and-Prune Algorithm
design structure matrix
Feedback
Hash based algorithms
hash function
Information flow
iterative process
Optimization
production and manufacturing system
Sequences
Title Exact algorithms for the feedback length minimisation problem
URI https://www.tandfonline.com/doi/abs/10.1080/00207543.2018.1456697
https://www.proquest.com/docview/2176791596
Volume 57
WOSCitedRecordID wos000457968400013&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
journalDatabaseRights – providerCode: PRVAWR
  databaseName: Taylor & Francis Journals Complete
  customDbUrl:
  eissn: 1366-588X
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0000584
  issn: 0020-7543
  databaseCode: TFW
  dateStart: 19610101
  isFulltext: true
  titleUrlDefault: https://www.tandfonline.com
  providerName: Taylor & Francis
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwrV07T8MwELYQYoCBN6JQkAdWo7Rx4nhgQKgVA6oYiuhm-Ukr-kBNQPx8fIlTWiHUAUYPZ1ln33131t13CF3FKvE4Ad9LOosI5dQRnjJLImYiw2TbY27ZKPzAer1sMOCPoZowD2WVkEO7iiii9NVg3FLldUUcdHB7oKMxFGZl3tR9RMKhn9xH9vDG-93nb1-cZIGHOSIgUvfw_LbLCjqtcJf-8NUlAHX3_uHo-2g3RJ_4tnouB2jDTg_RzhIn4RG66XxKXWA5fpnNR8VwkmN_OuzDROw80CmpXzEMXymGGFhJJqEaCIfBNMfoqdvp392TMGOB6JgnBfHwJLXSykKkQlPDEkh4jM-DHNNpIqV1bcccaymTqhaLrclSxSKmdEIdjJU4QZvT2dSeIix1pKSLHHXO0UQr6ZPfjBtFpbfy1JoGorVuhQ4E5DAHYyxaC57SSjsCtCOCdhroeiH2VjFwrBPgyxcnivLrw1VzSkS8RrZZ37IIxpwLn7WljPu4Lz37w9bnaNsvoTiNtFgTbRbzd3uBtvRHMcrnl-Wz_QJoLucq
linkProvider Taylor & Francis
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwrV1LT8MwDI5gIAEH3ojBgBy4FrVrmrQHDghtGmLsNMRuUR4Nm9gDbQXx84nbFDYhtAOcI0eRE_uzI_szQpehjCxOwPeSin2PJMR4CWWp5zPtaybqFnPzRuE263TiXi-Z74WBskrIoU1BFJH7ajBu-IwuS-KghdsiHQmhMiu2tm5DkoStorXIYi2U9XWbT9_eOIodE7PvgUzZxfPbNgv4tMBe-sNb5xDU3PmPw--ibReA4pvixeyhlXS8j7bmaAkP0HXjQ6gMi-HzZDrI-qMZtsfDNlLExmKdFOoFw_yVrI-BmGTkCoKwm01ziB6bje5ty3NjFjwVJlHmWYQSSiqZQrBCqGYR5DzapkKGKRoJkZq6YYYFUlMZsDDVMZXMZ1JFxMBkiSNUGU_G6THCQvlSGN8QYwyJlBQ2_40TLYmwhk5TXUWkVC5XjoMcRmEMefBFVVpoh4N2uNNOFV19ib0WJBzLBJL5m-NZ_vthilElPFwiWyuvmTt7nnGbuFGW2NCPnvxh6wu00eo-tHn7rnN_ijbtEtSqeQGroUo2fUvP0Lp6zwaz6Xn-hj8BBILrSw
linkToPdf http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwrV1LSwMxEA5aRfTgW6xWzcFrZNvNbjYHD6JdFEvpoWJvIY-NLfZFdxV_vsluVltEetBzmBAmmflmwsw3AFz6IjA4Yb-XZOQhTLFGNCQJ8ojyFOENg7l5o3CLtNtRr0c7rpowdWWVNofWBVFE7qutcU-VLivibAe3ATrs28KsyJi6iUgoWQVrOTmWedLd-PnbGQeRI2L2kJUpm3h-22YBnhbIS3846xyB4p1_OPsu2HbhJ7wp3sseWEnG-2BrjpTwAFw3P7jMIB--TGaDrD9KoTkdNHEi1AbpBJev0E5fyfrQ0pKMXDkQdJNpDsFT3Oze3iM3ZAFJnwYZMvjEpZAisaEKDhUJbMajTCKkiQwDzhPd0ESTulChqBM_UVEoiEeEDLC2cyWOQGU8GSfHAHLpCa49jbXWOJCCm-w3okpgbsw8TFQV4FK3TDoGcjsIY8jqX0SlhXaY1Q5z2qmCqy-xaUHBsUyAzl8cy_K_D10MKmH-EtlaecvMWXPKTNoWEmoCv_DkD1tfgI3OXcxaD-3HU7BpVmyhGqqTGqhks7fkDKzL92yQzs7zF_wJH7_p7w
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Exact+algorithms+for+the+feedback+length+minimisation+problem&rft.jtitle=International+journal+of+production+research&rft.au=Shang%2C+Zhen&rft.au=Zhao%2C+Songzheng&rft.au=Qian%2C+Yanjun&rft.au=Lin%2C+Jun&rft.date=2019-01-17&rft.pub=Taylor+%26+Francis&rft.issn=0020-7543&rft.eissn=1366-588X&rft.volume=57&rft.issue=2&rft.spage=544&rft.epage=559&rft_id=info:doi/10.1080%2F00207543.2018.1456697&rft.externalDocID=1456697
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0020-7543&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0020-7543&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0020-7543&client=summon