An effective and efficient divide-and-conquer algorithm for energy consumption optimisation problem in long Bernoulli serial lines

Reducing energy consumption in the energy-intensive production systems is of great significance and attracts more and more attention. Although a lot of efforts have been devoted to formulate and solve the energy consumption optimisation problem in the Bernoulli serial lines, existing methods for sol...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:International journal of production research Ročník 59; číslo 23; s. 7018 - 7036
Hlavní autoři: Yan, Chao-Bo, Zheng, Ziqian
Médium: Journal Article
Jazyk:angličtina
Vydáno: London Taylor & Francis 02.12.2021
Taylor & Francis LLC
Témata:
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!
Abstract Reducing energy consumption in the energy-intensive production systems is of great significance and attracts more and more attention. Although a lot of efforts have been devoted to formulate and solve the energy consumption optimisation problem in the Bernoulli serial lines, existing methods for solving the problem in long Bernoulli lines either cannot obtain the optimal solution or are time-consuming. For this purpose, this paper divides the problem in the long line into a set of problems in two-machine lines and proposes a computationally efficient and globally convergent algorithm to solve it. Extensive numerical experiments show that the proposed algorithm not only can optimally (in the numerical way) solve the energy consumption optimisation problem in long Bernoulli serial lines, but also is orders of magnitude more efficient than existing algorithms.
AbstractList Reducing energy consumption in the energy-intensive production systems is of great significance and attracts more and more attention. Although a lot of efforts have been devoted to formulate and solve the energy consumption optimisation problem in the Bernoulli serial lines, existing methods for solving the problem in long Bernoulli lines either cannot obtain the optimal solution or are time-consuming. For this purpose, this paper divides the problem in the long line into a set of problems in two-machine lines and proposes a computationally efficient and globally convergent algorithm to solve it. Extensive numerical experiments show that the proposed algorithm not only can optimally (in the numerical way) solve the energy consumption optimisation problem in long Bernoulli serial lines, but also is orders of magnitude more efficient than existing algorithms.
Author Yan, Chao-Bo
Zheng, Ziqian
Author_xml – sequence: 1
  givenname: Chao-Bo
  orcidid: 0000-0002-6396-0610
  surname: Yan
  fullname: Yan, Chao-Bo
  email: chaoboyan@mail.xjtu.edu.cn
  organization: School of Automation Science and Engineering, Faculty of Electronic and Information Engineering, Xi'an Jiaotong University
– sequence: 2
  givenname: Ziqian
  surname: Zheng
  fullname: Zheng, Ziqian
  organization: Department of Industrial and Systems Engineering, University of Wisconsin-Madison
BookMark eNqFkE1v3CAQhlGVSt2k_QmVkHr2BhtjsHpJGuVLitRLK_WGMAxbIgwbYBPtNb-8OJtecmi5DDPzvgPzHKOjEAMg9Lkl65YIckpIRzjr6bqrl3UraNfx4R1atXQYGibEryO0WjTNIvqAjnO-J_Uw0a_Q83nAYC3o4h4Bq2CWzGkHoWDjHp2BphYbHcPDDhJWfhOTK79nbGPCECBt9rg2827eFhcDjjXMLquXZJvi5GHGLmAfwwZ_gxTiznuHMySnPPYuQP6I3lvlM3x6jSfo59Xlj4ub5u779e3F-V2j6chKw_tBjYKKvjejsJbpSQs9tpNpFafDNCnOiJ2AGjb1vB-5VUYQw7QiEwDnlp6gL4e59Vt1mVzkfdylUJ-U3UAoH-lA-qr6elDpFHNOYKV25WWdkpTzsiVygS7_QpcLdPkKvbrZG_c2uVml_X99ZwefCxXsrJ5i8kYWtfcx2aSCdlnSf4_4A-1RniU
CitedBy_id crossref_primary_10_1016_j_eswa_2023_123065
crossref_primary_10_1016_j_ifacol_2022_09_496
crossref_primary_10_1016_j_omega_2024_103092
crossref_primary_10_1109_TASE_2023_3313565
crossref_primary_10_1080_00207543_2021_1936265
crossref_primary_10_1080_00207543_2022_2073287
crossref_primary_10_1109_TASE_2023_3298781
crossref_primary_10_1080_00207543_2025_2535518
crossref_primary_10_1007_s10696_022_09481_8
crossref_primary_10_1016_j_engappai_2024_108418
crossref_primary_10_1080_00207543_2021_1992681
crossref_primary_10_1109_LRA_2022_3177297
crossref_primary_10_3390_su141811448
crossref_primary_10_1016_j_cie_2023_109398
crossref_primary_10_1080_00207543_2023_2217300
Cites_doi 10.1080/00207543.2017.1349948
10.3390/su11010179
10.1109/TASE.2013.2285813
10.2507/IJSIMM18(1)CO1
10.1115/1.4041926
10.1109/TASE.2014.2344507
10.1080/00207543.2016.1206670
10.1109/TASE.2013.2265917
10.1080/00207543.2016.1138152
10.1109/TASE.2020.2973426
10.1109/TASE.2012.2202226
10.1007/978-3-642-40352-1_6
10.2172/927881
10.1109/TAC.2013.2240111
10.1080/00207543.2013.776191
10.1007/978-0-387-75579-3
10.1109/TASE.2014.2365108
10.1080/0951192X.2014.902106
10.1007/978-3-319-18842-3
10.1109/TASE.2010.2046892
10.4271/920189
10.1109/COASE.2019.8843261
10.1007/s00170-014-6737-z
10.1109/TASE.2014.2344685
10.1109/TASE.2020.3041440
10.1109/TASE.2017.2702380
10.1080/00207543.2013.813983
ContentType Journal Article
Copyright 2020 Informa UK Limited, trading as Taylor & Francis Group 2020
2020 Informa UK Limited, trading as Taylor & Francis Group
Copyright_xml – notice: 2020 Informa UK Limited, trading as Taylor & Francis Group 2020
– notice: 2020 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.2020.1832276
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 7036
ExternalDocumentID 10_1080_00207543_2020_1832276
1832276
Genre Research Article
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
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-746a983844d98ff5cbc8c91bd1a736bba750fbe3d5b47497fad80d5ca0bee77f3
IEDL.DBID TFW
ISICitedReferencesCount 17
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000577352800001&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 Mon Nov 10 03:12:30 EST 2025
Sat Nov 29 05:36:20 EST 2025
Tue Nov 18 21:02:30 EST 2025
Mon Oct 20 23:48:04 EDT 2025
IsPeerReviewed true
IsScholarly true
Issue 23
Language English
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-c395t-746a983844d98ff5cbc8c91bd1a736bba750fbe3d5b47497fad80d5ca0bee77f3
Notes ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ORCID 0000-0002-6396-0610
PQID 2603793604
PQPubID 30924
PageCount 19
ParticipantIDs proquest_journals_2603793604
crossref_citationtrail_10_1080_00207543_2020_1832276
crossref_primary_10_1080_00207543_2020_1832276
informaworld_taylorfrancis_310_1080_00207543_2020_1832276
PublicationCentury 2000
PublicationDate 2021-12-02
PublicationDateYYYYMMDD 2021-12-02
PublicationDate_xml – month: 12
  year: 2021
  text: 2021-12-02
  day: 02
PublicationDecade 2020
PublicationPlace London
PublicationPlace_xml – name: London
PublicationTitle International journal of production research
PublicationYear 2021
Publisher Taylor & Francis
Taylor & Francis LLC
Publisher_xml – name: Taylor & Francis
– name: Taylor & Francis LLC
References Buzacott J. A. (CIT0003) 1993
CIT0030
CIT0010
CIT0032
CIT0031
CIT0012
CIT0011
CIT0033
Askin R. G. (CIT0001) 1993
CIT0014
CIT0013
CIT0016
CIT0015
CIT0018
CIT0017
CIT0019
CIT0020
CIT0023
CIT0022
Papadopoulos H. T. (CIT0021) 1993
Gershwin S. B. (CIT0009) 1994
CIT0025
CIT0002
CIT0024
CIT0005
CIT0027
CIT0004
CIT0026
CIT0007
CIT0029
CIT0006
CIT0028
CIT0008
References_xml – ident: CIT0024
  doi: 10.1080/00207543.2017.1349948
– ident: CIT0033
  doi: 10.3390/su11010179
– volume-title: Stochastic Models of Manufacturing Systems
  year: 1993
  ident: CIT0003
– ident: CIT0019
  doi: 10.1109/TASE.2013.2285813
– ident: CIT0026
  doi: 10.2507/IJSIMM18(1)CO1
– ident: CIT0015
  doi: 10.1115/1.4041926
– volume-title: Modeling and Analysis of Manufacturing Systems
  year: 1993
  ident: CIT0001
– ident: CIT0007
  doi: 10.1109/TASE.2014.2344507
– ident: CIT0017
  doi: 10.1080/00207543.2016.1206670
– ident: CIT0025
– ident: CIT0020
  doi: 10.1109/TASE.2013.2265917
– ident: CIT0023
  doi: 10.1080/00207543.2016.1138152
– ident: CIT0027
  doi: 10.1109/TASE.2020.2973426
– ident: CIT0004
  doi: 10.1109/TASE.2012.2202226
– ident: CIT0010
  doi: 10.1007/978-3-642-40352-1_6
– ident: CIT0008
  doi: 10.2172/927881
– ident: CIT0029
  doi: 10.1109/TAC.2013.2240111
– ident: CIT0002
  doi: 10.1080/00207543.2013.776191
– volume-title: Queueing Theory in Manufacturing Systems Analysis and Design
  year: 1993
  ident: CIT0021
– ident: CIT0014
  doi: 10.1007/978-0-387-75579-3
– ident: CIT0018
  doi: 10.1109/TASE.2014.2365108
– ident: CIT0006
  doi: 10.1080/0951192X.2014.902106
– volume-title: Manufacturing Systems Engineering
  year: 1994
  ident: CIT0009
– ident: CIT0016
  doi: 10.1007/978-3-319-18842-3
– ident: CIT0031
  doi: 10.1109/TASE.2010.2046892
– ident: CIT0011
  doi: 10.4271/920189
– ident: CIT0005
  doi: 10.1109/COASE.2019.8843261
– ident: CIT0022
  doi: 10.1007/s00170-014-6737-z
– ident: CIT0012
  doi: 10.1109/TASE.2014.2344685
– ident: CIT0028
  doi: 10.1109/TASE.2020.3041440
– ident: CIT0030
  doi: 10.1109/TASE.2017.2702380
– ident: CIT0013
  doi: 10.1080/00207543.2013.813983
– ident: CIT0032
  doi: 10.1109/TASE.2020.3041440
SSID ssj0000584
Score 2.4317331
Snippet Reducing energy consumption in the energy-intensive production systems is of great significance and attracts more and more attention. Although a lot of efforts...
SourceID proquest
crossref
informaworld
SourceType Aggregation Database
Enrichment Source
Index Database
Publisher
StartPage 7018
SubjectTerms Algorithms
computational efficiency
continuous improvement
divide-and-conquer algorithm
Energy consumption
Energy reduction
Optimization
production lines
Title An effective and efficient divide-and-conquer algorithm for energy consumption optimisation problem in long Bernoulli serial lines
URI https://www.tandfonline.com/doi/abs/10.1080/00207543.2020.1832276
https://www.proquest.com/docview/2603793604
Volume 59
WOSCitedRecordID wos000577352800001&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: Single Title from Taylor & Francis Online
  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/eLvHCXMwrV1LS8QwEA4iHvTgW1xf5OA10m2SJjmquHiQxcOK3kqeurC20lZ_gL_cJM36QMSDnkoDk-YxmWTSb74B4JjpodU8J4g4WSDCZYYktRQ5JyiRwkpsI7v-FRuP-d2duE5owjbBKoMP7XqiiGirw-KWqp0j4kIEt9_oCPbeXe6Lgk6yQLrtT_YB1DcZ3X7YYsoTD3OGgsg8huenWr7sTl-4S7_Z6rgBjdb-oenrYDWdPuFpry4bYMFWm2DlEyfhFng9rWAP8vB2EPoPhbdpDJuEMXbLIl-IvBvtW9lAObuvm2n38Ah9J6CNkYRQx7jOaIxg7R-PCTMEU_oaOK3grK7u4Zltqjr8joL9SoChS-02uBldTM4vUUrUgDQWtEOMFFJwzAkxgjtHtdJci6EyQ8lwoZT0xxKnLDZUEUYEc9LwzFAtM2UtYw7vgMWqruwugIoVmnBLmTaaGJNJppWj1AqVE2OVHAAyn6BSJxbzkExjVg7fyU77IS7DEJdpiAfg5F3sqafx-E1AfJ79sov3J65PdlLiX2QP5qpSJovQlt5vxN4WFhnZ-0PV-2A5D6CagKfJD8Bi1zzbQ7CkX7pp2xxF3X8DQEsC7w
linkProvider Taylor & Francis
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwrV1LT-MwELZ4rMTuYWFfgl0ePnD1Ko3t2D52ERWI0lMR3Cw_2UptskoDP4BfvraTliKEOMApiqVx7PF4xuPMfAPAMTM9Z3hOEPGqQISrDCnqKPJeUKKEU9gldP0hG434zY1YzYWJYZXRh_YtUETS1XFzx8voRUhcTOEOlo7g4N7loSkKJSvWwSYNtjbK-nhw_aiNKe-QmDMUaRZZPC9188Q-PUEvfaatkwkabL_H4HfA5-4ACvutxHwBa678Cj6twBJ-Aw_9ErZxHkEVwvCl-DZJmZMwpW85FBpR8KTDMGuoprdVPWn-zmCYBXQpmRCalNqZ9BGswmPWhQ3BroINnJRwWpW38I-ryyr-kYLtZoBxTvPv4GpwOj45Q12tBmSwoA1ipFCCY06IFdx7arThRvS07SmGC61VOJl47bClmjAimFeWZ5YalWnnGPP4B9goq9LtAqhZYQh3lBlriLWZYkZ7Sp3QObFOqz1AFiskTQdkHutpTGVviXfaslhGFsuOxXvg95LsX4vk8RqBWF1-2aQrFN_WO5H4Fdr9hazITinMZXAdcVCHRUZ-vqHrI7B1Nr4cyuH56OIX-JjHGJsYXpPvg42mvnMH4IO5bybz-jBthP99sgcP
linkToPdf http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwrV3LTtwwFLV4CdEFlAKC8qgX3brKxHZsLyl01Ao0YkFVdpafMNJMgjKBD-DLazseCkKIRVlFsXSd-HXsm5x7LgBfmRk4w0uCiFcVIlwVSFFHkfeCEiWcwi6p65-z0YhfXYmLzCacZVpl9KF9LxSRsDou7lvr54y4GMEdNjqCg3dXhqI4J1m1CJajskhMYnA5_PMPjCnPQswFijbzIJ7Xqnm2PT0TL30B1mkHGm68w7t_BOv5-AmP-_myCRZc_Ql8eCJKuAUejmvYszwCEMLwoHg3TnGTMAVvORQKUfCjw1u2UE2um3bc3UxhaAR0KZQQmhTYmdAINuEyzaQhmPPXwHENJ019Db-7tm7i_yjYLwUYmzTbBr-HPy5PfqKcqQEZLGiHGKmU4JgTYgX3nhptuBEDbQeK4UprFc4lXjtsqSaMCOaV5YWlRhXaOcY83gFLdVO7XQA1qwzhjjJjDbG2UMxoT6kTuiTWabUHyHyApMky5jGbxkQOHtVO-y6WsYtl7uI98O3R7LbX8XjLQDwdfdmlDyi-z3Yi8Ru2B_OpIjMkzGRwHHEAw6ogn_-j6i9g9eJ0KM9_jc72wVoZCTaRW1MegKWuvXOHYMXcd-NZe5SWwV82DQWz
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=An+effective+and+efficient+divide-and-conquer+algorithm+for+energy+consumption+optimisation+problem+in+long+Bernoulli+serial+lines&rft.jtitle=International+journal+of+production+research&rft.au=Yan%2C+Chao-Bo&rft.au=Zheng%2C+Ziqian&rft.date=2021-12-02&rft.issn=0020-7543&rft.eissn=1366-588X&rft.volume=59&rft.issue=23&rft.spage=7018&rft.epage=7036&rft_id=info:doi/10.1080%2F00207543.2020.1832276&rft.externalDBID=n%2Fa&rft.externalDocID=10_1080_00207543_2020_1832276
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