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

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:International journal of production research Jg. 59; H. 23; S. 7018 - 7036
Hauptverfasser: Yan, Chao-Bo, Zheng, Ziqian
Format: Journal Article
Sprache:Englisch
Veröffentlicht: London Taylor & Francis 02.12.2021
Taylor & Francis LLC
Schlagworte:
Algorithms
computational efficiency
continuous improvement
divide-and-conquer algorithm
Energy consumption
Energy reduction
Optimization
production lines
ISSN:0020-7543, 1366-588X
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung: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.
Bibliographie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:0020-7543
1366-588X
DOI:10.1080/00207543.2020.1832276