Next Article in Journal
Antifungal Activity of Euclea divinorum Root and Study of its Ethnobotany and Phytopharmacology
Next Article in Special Issue
Load State Identification Method for Ball Mills Based on Improved EWT, Multiscale Fuzzy Entropy and AEPSO_PNN Classification
Previous Article in Journal
Multi-Agent Consensus Algorithm-Based Optimal Power Dispatch for Islanded Multi-Microgrids
Previous Article in Special Issue
Intelligent Control Strategy for Transient Response of a Variable Geometry Turbocharger System Based on Deep Reinforcement Learning
Open AccessArticle

Flexible Flow Shop Scheduling Method with Public Buffer

by 1,2,3,4, Chao Han 1,*, 1, 1,5 and 2,3,4
1
Faculty of Information and Control Engineering, Shenyang Jianzhu University, Shenyang 110168, China
2
Shenyang Institute of Automation, Chinese Academy of Sciences, Shenyang 110016, China
3
Key Laboratory of Network Control System, Chinese Academy of Sciences, Shenyang 110016, China
4
Institutes for Robotics and Intelligent Manufacturing, Chinese Academy of Sciences, Shenyang 110016, China
5
Department of Equipment Engineering, Sichuan College of Architectural Technology, Deyang 618000, China
*
Author to whom correspondence should be addressed.
Processes 2019, 7(10), 681; https://doi.org/10.3390/pr7100681
Received: 5 August 2019 / Revised: 23 September 2019 / Accepted: 29 September 2019 / Published: 1 October 2019
Actual manufacturing enterprises usually solve the production blockage problem by increasing the public buffer. However, the increase of the public buffer makes the flexible flow shop scheduling rather challenging. In order to solve the flexible flow shop scheduling problem with public buffer (FFSP–PB), this study proposes a novel method combining the simulated annealing algorithm-based Hopfield neural network algorithm (SAA–HNN) and local scheduling rules. The SAA–HNN algorithm is used as the global optimization method, and constructs the energy function of FFSP–PB to apply its asymptotically stable characteristic. Due to the limitations, such as small search range and high probability of falling into local extremum, this algorithm introduces the simulated annealing algorithm idea such that the algorithm is able to accept poor fitness solution and further expand its search scope during asymptotic convergence. In the process of local scheduling, considering the transferring time of workpieces moving into and out of public buffer and the manufacturing state of workpieces in the production process, this study designed serval local scheduling rules to control the moving process of the workpieces between the public buffer and the limited buffer between the stages. These local scheduling rules can also be used to reduce the production blockage and improve the efficiency of the workpiece transfer. Evaluated by the groups of simulation schemes with the actual production data of one bus manufacturing enterprise, the proposed method outperforms other methods in terms of searching efficiency and optimization target.
Keywords: flexible flow shop; limited buffer; public buffer; Hopfield neural network; local scheduling; simulated annealing algorithm flexible flow shop; limited buffer; public buffer; Hopfield neural network; local scheduling; simulated annealing algorithm
MDPI and ACS Style

Han, Z.; Han, C.; Lin, S.; Dong, X.; Shi, H. Flexible Flow Shop Scheduling Method with Public Buffer. Processes 2019, 7, 681.

Show more citation formats Show less citations formats
Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.

Article Access Map by Country/Region

1
Back to TopTop