Abstract
As one of the manufacturing industries with high energy consumption and high pollution, sand casting is facing major challenges in green manufacturing. In order to balance production and green sustainable development, this paper puts forward man–machine dual resource constraint mechanism. In addition, a multi-objective flexible job shop scheduling problem model constrained by job transportation time and learning effect is constructed, and the goal is to minimize processing time energy consumption and noise. Subsequently, a hybrid discrete multi-objective imperial competition algorithm (HDMICA) is developed to solve the model. The global search mechanism based on the HDMICA improves two aspects: a new initialization method to improve the quality of the initial population, and the empire selection method based on Pareto non-dominated solution to balance the empire forces. Then, the improved simulated annealing algorithm is embedded in imperial competition algorithm (ICA), which overcomes the premature convergence problem of ICA. Therefore, four neighborhood structures are designed to help the algorithm jump out of the local optimal solution. Finally, an example is used to verify the feasibility of the proposed algorithm. By comparing with the original ICA and other four algorithms, the effectiveness of the proposed algorithm in the quality of the first frontier solution is verified.
Similar content being viewed by others
References
Atashpaz-Gargari, E., & Lucas, C. (2007). Imperialist competitive algorithm: An algorithm for optimization inspired by imperialistic competition. In 2007 IEEE congress on evolutionary computation (pp. 4661–4667). IEEE.
Azzouz, A., Ennigrou, M., & Said, L. B. (2017). A self-adaptive evolutionary algorithm for solving flexible job-shop problem with sequence dependent setup time and learning effects. In 2017 IEEE congress on evolutionary computation (CEC) (pp. 1827–1834). IEEE.
Behnamian, J., & Ghomi, S. M. T. F. (2011). Hybrid flowshop scheduling with machine and resource-dependent processing times. Applied Mathematical Modelling, 35(3), 1107–1123.
Bewoor, L. A., Prakash, V. C., & Sapkal, S. U. (2018). Production scheduling optimization in foundry using hybrid particle swarm optimization algorithm. Procedia Manufacturing, 22, 57–64.
Biskup, D. (1999). Single-machine scheduling with learning considerations. European Journal of Operational Research, 115(1), 173–178.
Boutsinas, B. (2013). Machine-part cell formation using biclustering. European Journal of Operational Research, 230(3), 563–572.
Cao, S., & Lei, D. (2019). A novel constrained multi-objective imperialist competitive algorithm. Information and Control, 48(04), 437–451. (in Chinese).
Coca, G., Castrillón, O. D., Ruiz, S., et al. (2019). Sustainable evaluation of environmental and occupational risks scheduling flexible job shop manufacturing systems. Journal of Cleaner Production, 209, 146–168.
Deb, K., Agrawal, S., Pratap, A., et al. (2000). A fast elitist non-dominated sorting genetic algorithm for multi-objective optimization: NSGA-II. In International conference on parallel problem solving from nature (pp. 849–858). Berlin: Springer.
Gen, M., & Lin, L. (2014). Multiobjective evolutionary algorithm for manufacturing scheduling problems: State-of-the-art survey. Journal of Intelligent Manufacturing, 25(5), 849–866.
Gong, G., Deng, Q., Gong, X., et al. (2018). A new double flexible job-shop scheduling problem integrating processing time, green production, and human factor indicators. Journal of Cleaner Production, 174, 560–576.
Hajiaghaei-Keshteli, M., & Fathollahi-Fard, A. M. (2018). A set of efficient heuristics and metaheuristics to solve a two-stage stochastic bi-level decision-making model for the distribution network problem. Computers & Industrial Engineering, 123, 378–395.
Hans, E., & van de Velde, S. (2011). The lot sizing and scheduling of sand casting operations. International Journal of Production Research, 49(9), 2481–2499.
He, Z., & Pan, H. (2015). Germany “Industry 4.0” and “Made in China 2025”. Journal of Changsha University of Science and Technology, 30(3), 103–110. (in Chinese).
Hosseini, S., & Al, Khaled A. (2019). A hybrid ensemble and AHP approach for resilient supplier selection. Journal of Intelligent Manufacturing, 30(1), 207–228.
Ji, Zhou. (2015). Intelligent mannfacturing——main direction of “Made in China 2025”. China Mechanical Engineering, 26(17), 2273–2284. (in Chinese).
Karimi, S., Ardalan, Z., Naderi, B., et al. (2017). Scheduling flexible job-shops with transportation times: Mathematical models and a hybrid imperialist competitive algorithm. Applied Mathematical Modellíng, 41, 667–682.
Lei, D., Pan, Z., & Zhang, Q. (2018). Researches on multi-objective low carbon parallel machines scheduling. Journal of Huazhong University of Science and Technology (Science and Technology), 46(08), 104–109. (in Chinese).
Li, M., Zhen, L., & Yao, X. (2017). How to read many-objective solution sets in parallel coordinates [educational forum]. IEEE Computational Intelligence Magazine, 12(4), 88–100.
Liu, Q., Xiong, S., & Zhan, M. (2019). Many-objectives Scheduling Optimization based on PCA-NSGAII with an improved elite strategy. In Computer integrated manufacturing system (pp. 1–13). Retrieved July 12, 2019, from http://kns.cnki.net/kcms/detail/11.5946.tp.20190419.1016.002.html.
Lu, C., Gao, L., Li, X., et al. (2018). A multi-objective approach to welding shop scheduling for makespan, noise pollution and energy consumption. Journal of Cleaner Production, 196, 773–787.
Nowicki, E., & Smutnicki, C. (1996). A fast taboo search algorithm for the job shop problem. Management Science, 42(6), 797–813.
Olayinka, O. S., & Abdullahi, S. A. (2009). An overview of industrial employees’ exposure to noise in sundry processing and manufacturing industries in Ilorin metropolis, Nigeria. Industrial Health, 47(2), 123–133.
Shivasankaran, N., Kumar, P. S., & Raja, K. V. (2015). Hybrid sorting immune simulated annealing algorithm for flexible job shop scheduling. International Journal of Computational Intelligence Systems, 8(3), 455–466.
Tandon, N. (2000). Noise-reducing designs of machines and structures. Sadhana, 25(3), 331–339.
Tang, H., Chen, R., Li, Y., et al. (2019). Flexible job-shop scheduling with tolerated time interval and limited starting time interval based on hybrid discrete PSO-SA: An application from a casting workshop. Applied Soft Computing, 78, 176–194.
Wan, J., Yi, M., Li, D., et al. (2016). Mobile services for customization manufacturing systems: An example of industry 4.0. IEEE Access, 4, 8977–8986.
Wang, S., Wan, J., Zhang, D., et al. (2016). Towards smart factory for industry 4.0. Computer Networks, 101(101), 158–168.
Wang, B., Wang, X., Lan, F., et al. (2018). A hybrid local-search algorithm for robust job-shop scheduling under scenarios. Applied Soft Computing, 62, 259–271.
Wirojanagud, P., Gel, E. S., Fowler, J. W., et al. (2007). Modelling inherent worker differences for workforce planning. International Journal of Production Research, 45(3), 525–553.
Wu, M., Song, Z., & Moon, Y. B. (2019). Detecting cyber-physical attacks in CyberManufacturing systems with machine learning methods. Journal of Intelligent Manufacturing, 30(3), 1111–1123.
Wu, X., & Sun, Y. (2018). A green scheduling algorithm for flexible job shop with energy-saving measures. Journal of Cleaner Production, 172, 3249–3264.
Xinchao, Z. (2011). Simulated annealing algorithm with adaptive neighborhood. Applied Soft Computing, 11(2), 1827–1836.
Xu, Y., Ye, C., & Cao, L. (2019). Research on flexible Job-Shop scheduling problem with AGVs constraints and behavioral effects. Application Research of Computers, 36(10), 3033–3038. (in Chinese).
Yin, L., Li, X., Gao, L., et al. (2017). A novel mathematical model and multi-objective method for the low-carbon flexible job shop scheduling problem. Sustainable Computing: Informatics and Systems, 13, 15–30.
Yu, J. (2016). Research of learning curve based similarity and single machine scheduling. Chongqing University (in Chinese)
Zhang, J. (2014). Research of flexible job shop scheduling problem based on hybrid discrete particle swarm optimization algorithm. Zhejiang University of Technology. (in Chinese)
Zhang, J., Ding, G., Zou, Y., et al. (2019). Review of job shop scheduling research and its new perspectives under Industry 4.0. Journal of Intelligent Manufacturing, 30(4), 1809–1830.
Zhao, C., Fang, J., Cheng, T. C. E., et al. (2017). A note on the time complexity of machine scheduling with DeJong’s learning effect. Computers & Industrial Engineering, 112, 447–449.
Author information
Authors and Affiliations
Corresponding author
Additional information
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
About this article
Cite this article
Peng, Z., Zhang, H., Tang, H. et al. Research on flexible job-shop scheduling problem in green sustainable manufacturing based on learning effect. J Intell Manuf 33, 1725–1746 (2022). https://doi.org/10.1007/s10845-020-01713-8
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10845-020-01713-8