Abstract
In order to solve the problem of the deadlock situation which usually happens in the process of Re-entrant Flexible Flow-shop with Limited Buffer Scheduling (RFFLBS), this paper focuses on the study of Dynamic Buffer Reservation Method Based on Markov Chain, DBRM-MC. The occurrence of the deadlock situation will be reduced by actively reserving buffer capacity for reentry jobs to reduce the competition for other buffer resources from non-reentrant processes. The mathematical model of RFFLBS is established and the simulation test is carried out. The test results show that the dynamic buffer reservation method based on Markov Chain can effectively decreases the deadlock situation.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Tran, T.H., Ng, K.M.: A hybrid water flow algorithm for multi-objective flexible flow shop scheduling problems. Eng. Optim. 4(4), 83–502 (2013)
Chu, F., Liu, M., Liu, X.: Reentrant flow shop scheduling considering multiresource qualification matching. Sci. Program. 10(1), 95–96 (2018)
Han, Z., Zhu, Y., Ma, X., Chen, Z.: Multiple rules with game theoretic analysis for flexible flow shop scheduling problem with component altering times. Int. J. Model. Ident. Control 26(1), 1–18 (2016)
Hekmatfar, M., Fatemi Ghomi, S.M.T., Karimi, B.: Two stage reentrant hybrid flow shop with setup times and the criterion of minimizing makespan. Appl. Soft Comput. J. 12(11), 4530–4539 (2011)
Fan, G., Lu, Y., Xu, Z., Yang, J.: Resource allocation model and deadlock-free optimization scheduling for underground locomotive transportation. Syst. Eng. Theory Pract. 8(33), 2087–2096 (2013)
Zhang, C., Shi, Z., Huang, Z.: Flow shop scheduling with a batch processor and limited buffer. Int. J. Prod. Res. 6(11), 3217–3233 (2017)
Pan, Q., Wang, L., Gao, L.: A chaotic harmony search algorithm for the flow shop scheduling problem with limited buffers. Appl. Soft Comput. J. 12(11), 5270–5280 (2011)
Xing, K., Kang, M., Gao, Z.: Deadlock-free modified particle swarm optimization scheduling algorithm for flexible manufacturing systems. Control Decis. 29(08), 1345–1353 (2014)
Xing, K., Han, L., Zhou, M.: Deadlock-free genetic scheduling algorithm for automated manufacturing systems based on deadlock control policy. IEEE Trans. Syst. Man Cybern. Part B Cybern. 3(42), 603–615 (2012)
Li, J., Munehisa, T.: Genetic algorithm using the inhomogeneous Markov Chain for job shop scheduling problem. ICIC Express Lett. 1(9), 501–509 (2015)
Acknowledgements
This work was supported by Liaoning Provincial Science Foundation, China (No. 2018106008), Project of Liaoning Province Education Department (No. LJZ2017015) and Shenyang Municipal Science and Technology Project, China (No. Z18-5-015).
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2020 Springer Nature Singapore Pte Ltd.
About this paper
Cite this paper
Han, Z., Liu, Y., Shi, H., Tian, X. (2020). A Dynamic Buffer Reservation Method Based on Markov Chain to Solve Deadlock Problem in Scheduling. In: Wang, R., Chen, Z., Zhang, W., Zhu, Q. (eds) Proceedings of the 11th International Conference on Modelling, Identification and Control (ICMIC2019). Lecture Notes in Electrical Engineering, vol 582. Springer, Singapore. https://doi.org/10.1007/978-981-15-0474-7_113
Download citation
DOI: https://doi.org/10.1007/978-981-15-0474-7_113
Published:
Publisher Name: Springer, Singapore
Print ISBN: 978-981-15-0473-0
Online ISBN: 978-981-15-0474-7
eBook Packages: Intelligent Technologies and RoboticsIntelligent Technologies and Robotics (R0)