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

Chao-Bo Yan and Ziqian Zheng

International Journal of Production Research, 2021, vol. 59, issue 23, 7018-7036

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.

Date: 2021
References: Add references at CitEc
Citations: View citations in EconPapers (2)

Downloads: (external link)
http://hdl.handle.net/10.1080/00207543.2020.1832276 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:taf:tprsxx:v:59:y:2021:i:23:p:7018-7036

Ordering information: This journal article can be ordered from
http://www.tandfonline.com/pricing/journal/TPRS20

DOI: 10.1080/00207543.2020.1832276

Access Statistics for this article

International Journal of Production Research is currently edited by Professor A. Dolgui

More articles in International Journal of Production Research from Taylor & Francis Journals
Bibliographic data for series maintained by Chris Longhurst ().