Abstract
This paper deals with a parallel machine scheduling problem with linearly increasing energy consumption cost. Maintenance activities are considered in the problem. After maintenance, the machine energy consumption cost returns to the normal level. Thus, an important decision is how to determine a reasonable number of maintenance activities to enable a significant tradeoff between the maintenance cost and the energy consumption cost. We define the jobs processed between two adjacent maintenance activities as a batch since the job processing cannot be interrupted. A further decision is how to batch the jobs. To solve the investigated problem, we first study a special case where there is only one single machine. A heuristic approach is proposed to solve the single machine scheduling problem. Then, we present a variable neighborhood search (VNS) algorithm for general cases, where the heuristic approach for the single machine case is intergrated. Extensive computational experiments are conducted and the results show that the proposed VNS algorithm is superior to artificial bee colony (ABC) algorithm, genetic algorithm (GA), ant colony optimization (ACO) algorithm, Tabu search (TS)algorithm, and greedy randomized adaptive search procedure (GRASP) algorithm.
Similar content being viewed by others
References
Zeballos, L.J.: A constraint programming approach to tool allocation and production scheduling in flexible manufacturing systems [J]. Robot. Comput. Integr. Manuf. 26(6), 725–743 (2010)
Dai, M., Tang, D., Giret, A., et al.: Energy-efficient scheduling for a flexible flow shop using an improved genetic-simulated annealing algorithm[J]. Robot. Comput. Integr. Manuf. 29(5), 418–429 (2013)
Moon, J.Y., Park, J.: Smart production scheduling with time-dependent and machine-dependent electricity cost by considering distributed energy resources and energy storage [J]. Int. J. Prod. Res. 52(13), 3922–3939 (2014)
Lee, S., Do Chung, B., Jeon, H.W., et al.: A dynamic control approach for energy-efficient production scheduling on a single machine under time-varying electricity pricing [J]. J. Clean. Prod. 165, 552–563 (2017)
Módos, I., Šůcha, P., Hanzálek, Z.: Algorithms for robust production scheduling with energy consumption limits [J]. Comput. Ind. Eng. 112, 391–408 (2017)
Aghelinejad, M.M., Ouazene, Y., Yalaoui, A.: Production scheduling optimisation with machine state and time-dependent energy costs[J]. Int. J. Prod. Res. 56(16), 5558–5575 (2018)
Faria, G., Vieira, S., Branco, P.J.C.: Evolutionary process scheduling approach for energy cost minimization in a yeast production factory: design, simulation, and factory implementation [J]. Energy Syst. 10(1), 113–139 (2019)
An, Y., Chen, X., Zhang, J., et al.: A hybrid multi-objective evolutionary algorithm to integrate optimization of the production scheduling and imperfect cutting tool maintenance considering total energy consumption [J]. J. Clean. Prod. 268, 121540 (2020)
Tong, Y., Li, J., Li, S., et al.: Research on energy-saving production scheduling based on a clustering algorithm for a forging enterprise[J]. Sustainability 8(2), 136 (2016)
Li, J., Xiao, X., Tang, Q., et al.: Production scheduling of a large-scale steelmaking continuous casting process via unit-specific event-based continuous-time models: Short-term and medium-term scheduling[J]. Ind. Eng. Chem. Res. 51(21), 7300–7319 (2012)
Hadera, H., Harjunkoski, I., Sand, G., et al.: Optimization of steel production scheduling with complex time-sensitive electricity cost[J]. Comput. Chem. Eng. 76, 117–136 (2015)
Pechmann, A., Schöler, I.: Optimizing energy costs by intelligent production scheduling [M]//Glocalized Solutions for Sustainability in Manufacturing, pp. 293–298. Springer, Berlin, Heidelberg (2011)
Maghsoudlou, H., Afshar-Nadjafi, B., Niaki, S.T.A.: A framework for preemptive multi-skilled project scheduling problem with time-of-use energy tariffs [J]. Energy Syst. 12(2), 431–458 (2021)
Gong, G., Chiong, R., Deng, Q., et al.: Energy-efficient production scheduling through machine on/off control during preventive maintenance[J]. Eng. Appl. Artif. Intell. 104, 104359 (2021)
Berg, M.: Optimal replacement policies for two-unit machines with increasing energy consumption costs 1[J]. Stoch. Process. Applic. 4(1), 89–106 (1976)
Babel, L., Kellerer, H., Kotov, V.: Thek-partitioning problem[J]. Math. Methods Oper. Res. 47(1), 59–82 (1998)
Mladenović, N., Hansen, P.: Variable neighborhood search[J]. Comput. Oper. Res. 24(11), 1097–1100 (1997)
Pei, J., Dražić, Z., Dražić, M., et al.: Continuous variable neighborhood search (C-VNS) for solving systems of nonlinear equations[J]. INFORMS J. Comput. 31(2), 235–250 (2019)
Lu, S., Pei, J., Liu, X., et al.: Less is more: variable neighborhood search for integrated production and assembly in smart manufacturing [J]. J. Sched. 23(6), 649–664 (2020)
Irawan, C.A., Salhi, S., Drezner, Z.: Hybrid meta-heuristics with VNS and exact methods: application to large unconditional and conditional vertex p p-centre problems[J]. J. Heuristics 22(4), 507–537 (2016)
Papalitsas C, Giannakis K, Andronikos T, et al.: Initialization methods for the TSP with Time Windows using Variable Neighborhood Search. 2015 6th International Conference on Information, Intelligence, Systems and Applications (IISA), pp. 1–6. IEEE, Corfu (2015). https://doi.org/10.1109/IISA.2015.7388106
Caniyilmaz, E., Benli, B., Ilkay, M.S.: An artificial bee colony algorithm approach for unrelated parallel machine scheduling with processing set restrictions, job sequence-dependent setup times, and due date[J]. Int. J. Adv. Manuf. Technol. 77(9–12), 2105–2115 (2015)
Chaudhry, I.A., Elbadawi, I.A.Q.: Minimisation of total tardiness for identical parallel machine scheduling using genetic algorithm [J]. Sādhanā 42(1), 11–21 (2017)
Neto, R.F.T., Godinho Filho, M., Da Silva, F.M.: An ant colony optimization approach for the parallel machine scheduling problem with outsourcing allowed[J]. J. Intell. Manuf. 26(3), 527–538 (2015)
Lee, J.H., Yu, J.M., Lee, D.H.: A tabu search algorithm for unrelated parallel machine scheduling with sequence-and machine-dependent setups: minimizing total tardiness[J]. Int. J. Adv. Manuf. Technol. 69(9), 2081–2089 (2013)
Yepes-Borrero, J.C., Villa, F., Perea, F., et al.: GRASP algorithm for the unrelated parallel machine scheduling problem with setup times and additional resources[J]. Expert Syst. Appl. 141, 112959 (2020)
Acknowledgements
This work is supported by the National Key Research and Development Program of China (2019YFB1705300), the National Natural Science Foundation of China (Nos. 72101071, 72071056, 71690235, 71601060), the Fundamental Research Funds for the Central Universities (Nos. JZ2020HGTB0035, JZ2021HGTA0134, JZ2021HGQA0200), the Anhui Province Natural Science Foundation (No. 1908085MG223), Natural Science Foundation of Anhui Province (2108085QG287), Key Research and Development Project of Anhui Province (2022a05020023), and the Base of Introducing Talents of Discipline to Universities for Optimization and Decision-making in the Manufacturing Process of Complex Product (111 projects).
Author information
Authors and Affiliations
Corresponding authors
Ethics declarations
Conflict of Interests
The authors declare that they have no conflict of interest.
Additional information
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
Springer Nature or its licensor holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.
About this article
Cite this article
Hu, C., Lu, S., Kong, M. et al. Parallel machine scheduling with linearly increasing energy consumption cost. Ann Math Artif Intell 91, 239–258 (2023). https://doi.org/10.1007/s10472-022-09810-5
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10472-022-09810-5