357
Views
4
CrossRef citations to date
0
Altmetric
Articles

A sequence learning harmony search algorithm for the flexible process planning problem

ORCID Icon
Pages 3182-3200 | Received 28 Dec 2020, Accepted 25 Mar 2021, Published online: 13 Apr 2021
 

Abstract

Flexible process planning involves selecting and sequencing the requisite operations, and assigning the right machine, tool and access direction to each selected operation for minimising the production cost or the completion time. It is one of the challenging combinatorial optimisation problems due to sequencing flexibility, processing flexibility and operation flexibility. A sequence learning harmony search algorithm is accordingly proposed. Distinctively, the well-designed algorithm searches for the optimal process plan by intelligently finding the proper immediate successor for each selected operation in turn rather than resorting to the common shifting and swapping operators in sequencing. The innovative algorithm does not also require extra efforts to plot the operational precedence graph or the AND/OR-network graph. The experimental results indicate that the proposed algorithm significantly outperforms other heuristics in terms of the quality of solution found and the convergence rate of the algorithm. For the large-scale complicated instances, the proposed algorithm establishes a challenging flag.

Acknowledgements

The authors would like to thank the editors and anonymous reviewers for their valuable comments. This work was supported by the National Natural Science Foundation of China under grant no. 71871004.

Disclosure statement

No potential conflict of interest was reported by the author.

Correction Statement

This article has been republished with minor changes. These changes do not impact the academic content of the article.

Additional information

Funding

This work was supported by the National Natural Science Foundation of China [grant no. 71871004].

Notes on contributors

Kaiping Luo

He is currently an associate professor in the Department of Management Science and Engineering, Beihang University, Beijing, China. His research interests include operations research, optimisation and computational intelligence. He has published more than 30 articles in various prestigious journals.

Log in via your institution

Log in to Taylor & Francis Online

PDF download + Online access

  • 48 hours access to article PDF & online version
  • Article PDF can be downloaded
  • Article PDF can be printed
USD 61.00 Add to cart

Issue Purchase

  • 30 days online access to complete issue
  • Article PDFs can be downloaded
  • Article PDFs can be printed
USD 973.00 Add to cart

* Local tax will be added as applicable

Related Research

People also read lists articles that other readers of this article have read.

Recommended articles lists articles that we recommend and is powered by our AI driven recommendation engine.

Cited by lists all citing articles based on Crossref citations.
Articles with the Crossref icon will open in a new tab.