{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,3]],"date-time":"2026-03-03T15:53:30Z","timestamp":1772553210439,"version":"3.50.1"},"reference-count":72,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2024,12,28]],"date-time":"2024-12-28T00:00:00Z","timestamp":1735344000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,12,28]],"date-time":"2024-12-28T00:00:00Z","timestamp":1735344000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"name":"Fonds voor wetenschappelijke onderzoek","award":["12A4222N"],"award-info":[{"award-number":["12A4222N"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Ann Oper Res"],"published-print":{"date-parts":[[2025,2]]},"DOI":"10.1007\/s10479-024-06430-6","type":"journal-article","created":{"date-parts":[[2024,12,28]],"date-time":"2024-12-28T06:30:10Z","timestamp":1735367410000},"page":"371-403","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Synchronizing production and delivery in flow shops with time-of-use electricity pricing"],"prefix":"10.1007","volume":"345","author":[{"given":"Humyun Fuad","family":"Rahman","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tom","family":"Servranckx","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ripon K.","family":"Chakrabortty","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6702-3563","authenticated-orcid":false,"given":"Mario","family":"Vanhoucke","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sondoss","family":"El Sawah","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,12,28]]},"reference":[{"key":"6430_CR1","doi-asserted-by":"crossref","first-page":"194","DOI":"10.1016\/j.cor.2014.08.012","volume":"53","author":"F Ahmadizar","year":"2015","unstructured":"Ahmadizar, F., & Farhadi, S. (2015). Single-machine batch delivery scheduling with job release dates, due windows and earliness, tardiness, holding and delivery costs. Computers & Operations Research, 53, 194\u2013205.","journal-title":"Computers & Operations Research"},{"issue":"3","key":"6430_CR2","doi-asserted-by":"crossref","first-page":"985","DOI":"10.1016\/j.ejor.2006.06.060","volume":"187","author":"A Allahverdi","year":"2008","unstructured":"Allahverdi, A., Ng, C. T., Cheng, T. E., & Kovalyov, M. Y. (2008). A survey of scheduling problems with setup times or costs. European Journal of Operational Research, 187(3), 985\u20131032.","journal-title":"European Journal of Operational Research"},{"issue":"3","key":"6430_CR3","doi-asserted-by":"crossref","first-page":"355","DOI":"10.1007\/s12293-022-00372-x","volume":"14","author":"T Azad","year":"2022","unstructured":"Azad, T., Rahman, H. F., Chakrabortty, R. K., & Ryan, M. J. (2022). Optimization of integrated production scheduling and vehicle routing problem with batch delivery to multiple customers in supply chain. Memetic Computing, 14(3), 355\u2013376.","journal-title":"Memetic Computing"},{"issue":"10","key":"6430_CR4","doi-asserted-by":"crossref","first-page":"2624","DOI":"10.1080\/00207543.2011.578162","volume":"50","author":"E Cakici","year":"2012","unstructured":"Cakici, E., Mason, S. J., & Kurz, M. E. (2012). Multi-objective analysis of an integrated supply chain scheduling problem. International Journal of Production Research, 50(10), 2624\u20132638.","journal-title":"International Journal of Production Research"},{"issue":"3","key":"6430_CR5","doi-asserted-by":"crossref","first-page":"1091","DOI":"10.1016\/j.ejor.2023.01.029","volume":"308","author":"D Catanzaro","year":"2023","unstructured":"Catanzaro, D., Pesenti, R., & Ronco, R. (2023). Job scheduling under time-of-use energy tariffs for sustainable manufacturing: A survey. European Journal of Operational Research, 308(3), 1091\u20131109.","journal-title":"European Journal of Operational Research"},{"issue":"9","key":"6430_CR6","doi-asserted-by":"crossref","first-page":"2787","DOI":"10.1080\/00207543.2014.994075","volume":"53","author":"J Chen","year":"2015","unstructured":"Chen, J., Huang, G. Q., Luo, H., & Wang, J. (2015). Synchronisation of production scheduling and shipment in an assembly flowshop. International Journal of Production Research, 53(9), 2787\u20132802.","journal-title":"International Journal of Production Research"},{"key":"6430_CR7","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1007\/s10479-021-04059-3","volume":"304","author":"L Chen","year":"2021","unstructured":"Chen, L., Megow, N., Rischke, R., & Verschae, J. (2021). Optimal algorithms for scheduling under time-of-use tariffs. Annals of Operations Research, 304, 85\u2013107.","journal-title":"Annals of Operations Research"},{"issue":"2","key":"6430_CR8","first-page":"145","volume":"10","author":"T Cheng","year":"1993","unstructured":"Cheng, T., & Kahlbacher, H. (1993). Scheduling with delivery and earliness penalties. Asia-Pacific Journal of Operational Research, 10(2), 145\u2013152.","journal-title":"Asia-Pacific Journal of Operational Research"},{"issue":"2","key":"6430_CR9","doi-asserted-by":"crossref","first-page":"182","DOI":"10.1109\/4235.996017","volume":"6","author":"K Deb","year":"2002","unstructured":"Deb, K., Pratap, A., Agarwal, S., & Meyarivan, T. A. M. T. (2002). A fast and elitist multiobjective genetic algorithm: NSGA-II. IEEE Transactions on Evolutionary Computation, 6(2), 182\u2013197.","journal-title":"IEEE Transactions on Evolutionary Computation"},{"issue":"2","key":"6430_CR10","doi-asserted-by":"crossref","first-page":"1138","DOI":"10.1109\/TASE.2015.2495328","volume":"13","author":"JY Ding","year":"2015","unstructured":"Ding, J. Y., Song, S., Zhang, R., & Wu, C. (2015). Parallel machine scheduling under time-of-use electricity prices: New models and optimization approaches. IEEE Transactions on Automation Science and Engineering, 13(2), 1138\u20131154.","journal-title":"IEEE Transactions on Automation Science and Engineering"},{"issue":"1","key":"6430_CR11","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1007\/s10479-012-1294-z","volume":"206","author":"K Fang","year":"2013","unstructured":"Fang, K., Uhan, N. A., Zhao, F., & Sutherland, J. W. (2013). Flow shop scheduling with peak power consumption constraints. Annals of Operations Research, 206(1), 115\u2013145.","journal-title":"Annals of Operations Research"},{"issue":"4","key":"6430_CR12","doi-asserted-by":"crossref","first-page":"699","DOI":"10.1016\/j.cie.2011.01.003","volume":"60","author":"L Gao","year":"2011","unstructured":"Gao, L., Zhang, G., Zhang, L., & Li, X. (2011). An efficient memetic algorithm for solving the job shop scheduling problem. Computers & Industrial Engineering, 60(4), 699\u2013705.","journal-title":"Computers & Industrial Engineering"},{"issue":"2","key":"6430_CR13","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1287\/moor.1.2.117","volume":"1","author":"MR Garey","year":"1976","unstructured":"Garey, M. R., Johnson, D. S., & Sethi, R. (1976). The complexity of flowshop and jobshop scheduling. Mathematics of Operations Research, 1(2), 117\u2013129.","journal-title":"Mathematics of Operations Research"},{"issue":"2","key":"6430_CR14","doi-asserted-by":"crossref","first-page":"519","DOI":"10.1016\/j.ejor.2022.09.034","volume":"307","author":"M Ghorbanzadeh","year":"2023","unstructured":"Ghorbanzadeh, M., & Ranjbar, M. (2023). Energy-aware production scheduling in the flow shop environment under sequence-dependent setup times, group scheduling and renewable energy constraints. European Journal of Operational Research, 307(2), 519\u2013537.","journal-title":"European Journal of Operational Research"},{"issue":"3","key":"6430_CR15","doi-asserted-by":"crossref","first-page":"814","DOI":"10.1016\/j.ejor.2020.01.039","volume":"284","author":"J Gmys","year":"2020","unstructured":"Gmys, J., Mezmaz, M., Melab, N., & Tuyttens, D. (2020). A computationally efficient branch-and-bound algorithm for the permutation flow-shop scheduling problem. European Journal of Operational Research, 284(3), 814\u2013833.","journal-title":"European Journal of Operational Research"},{"key":"6430_CR16","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1023\/A:1022602019183","volume":"3","author":"DE Goldberg","year":"1988","unstructured":"Goldberg, D. E., & Holland, J. H. (1988). Genetic algorithms and machine learning. Machine Learning, 3, 95\u201399.","journal-title":"Machine Learning"},{"key":"6430_CR17","doi-asserted-by":"crossref","first-page":"387","DOI":"10.1016\/j.procir.2016.11.136","volume":"61","author":"X Gong","year":"2017","unstructured":"Gong, X., Van der Wee, M., De Pessemier, T., et al. (2017). Energy-and labor-aware production scheduling for sustainable manufacturing: A case study on plastic bottle manufacturing. Procedia CIRP, 61, 387\u2013392.","journal-title":"Procedia CIRP"},{"key":"6430_CR18","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1016\/j.asoc.2016.01.052","volume":"42","author":"Z Guo","year":"2016","unstructured":"Guo, Z., Zhang, D., Leung, S. Y. S., & Shi, L. (2016). A bi-level evolutionary optimization approach for integrated production and transportation scheduling. Applied Soft Computing, 42, 215\u2013228.","journal-title":"Applied Soft Computing"},{"issue":"2","key":"6430_CR19","doi-asserted-by":"crossref","first-page":"426","DOI":"10.1016\/j.ejor.2017.09.029","volume":"266","author":"H Hadda","year":"2018","unstructured":"Hadda, H., Dridi, N., & Hajji, M. K. (2018). On the optimality conditions of the two-machine flow shop problem. European Journal of Operational Research, 266(2), 426\u2013435.","journal-title":"European Journal of Operational Research"},{"issue":"1","key":"6430_CR20","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1016\/j.cie.2011.08.014","volume":"62","author":"A Hamidinia","year":"2012","unstructured":"Hamidinia, A., Khakabimamaghani, S., Mazdeh, M. M., & Jafari, M. (2012). A genetic algorithm for minimizing total tardiness\/earliness of weighted jobs in a batched delivery system. Computers & Industrial Engineering, 62(1), 29\u201338.","journal-title":"Computers & Industrial Engineering"},{"key":"6430_CR21","doi-asserted-by":"crossref","first-page":"176170","DOI":"10.1109\/ACCESS.2020.3027018","volume":"8","author":"D Han","year":"2020","unstructured":"Han, D., Tang, Q., Zhang, Z., & Cao, J. (2020). Energy-efficient integration optimization of production scheduling and ladle dispatching in steelmaking plants. IEEE Access, 8, 176170\u2013176187.","journal-title":"IEEE Access"},{"key":"6430_CR22","first-page":"6121","volume":"5","author":"L Hidri","year":"2017","unstructured":"Hidri, L., & Gharbi, A. (2017). New efficient lower bound for the hybrid flow shop scheduling problem with multiprocessor tasks. IEEE Access, 5, 6121\u20136133.","journal-title":"IEEE Access"},{"issue":"4","key":"6430_CR23","doi-asserted-by":"crossref","first-page":"1041","DOI":"10.1080\/00207543.2020.1715504","volume":"59","author":"MH Ho","year":"2021","unstructured":"Ho, M. H., Hnaien, F., & Dugardin, F. (2021). Electricity cost minimisation for optimal makespan solution in flow shop scheduling under time-of-use tariffs. International Journal of Production Research, 59(4), 1041\u20131067.","journal-title":"International Journal of Production Research"},{"issue":"1","key":"6430_CR24","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1002\/nav.3800010110","volume":"1","author":"SM Johnson","year":"1954","unstructured":"Johnson, S. M. (1954). Optimal two-and three-stage production schedules with setup times included. Naval Research Logistics Quarterly, 1(1), 61\u201368.","journal-title":"Naval Research Logistics Quarterly"},{"key":"6430_CR25","doi-asserted-by":"crossref","first-page":"98","DOI":"10.1016\/j.engappai.2017.05.004","volume":"63","author":"H Kazemi","year":"2017","unstructured":"Kazemi, H., Mazdeh, M. M., & Rostami, M. (2017). The two stage assembly flow-shop scheduling problem with batching and delivery. Engineering Applications of Artificial Intelligence, 63, 98\u2013107.","journal-title":"Engineering Applications of Artificial Intelligence"},{"issue":"3","key":"6430_CR26","doi-asserted-by":"crossref","first-page":"228","DOI":"10.1080\/09537289108919351","volume":"2","author":"AS Kiran","year":"1991","unstructured":"Kiran, A. S., Alptekin, S., & Celal Kaplan, A. (1991). Tardiness heuristic for scheduling flexible manufacturing systems. Production Planning & Control, 2(3), 228\u2013241.","journal-title":"Production Planning & Control"},{"issue":"5","key":"6430_CR27","doi-asserted-by":"crossref","first-page":"100","DOI":"10.3390\/a12050100","volume":"12","author":"D Kizilay","year":"2019","unstructured":"Kizilay, D., Tasgetiren, M. F., Pan, Q. K., & Gao, L. (2019). A variable block insertion heuristic for solving permutation flow shop scheduling problem with makespan criterion. Algorithms, 12(5), 100.","journal-title":"Algorithms"},{"key":"6430_CR28","doi-asserted-by":"crossref","first-page":"106638","DOI":"10.1016\/j.cie.2020.106638","volume":"147","author":"Y Li","year":"2020","unstructured":"Li, Y., Li, X., Gao, L., & Meng, L. (2020). An improved artificial bee colony algorithm for distributed heterogeneous hybrid flowshop scheduling problem with sequence-dependent setup times. Computers & Industrial Engineering, 147, 106638.","journal-title":"Computers & Industrial Engineering"},{"key":"6430_CR29","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.ijpe.2016.03.006","volume":"176","author":"P Liu","year":"2016","unstructured":"Liu, P., & Lu, X. (2016). Integrated production and job delivery scheduling with an availability constraint. International Journal of Production Economics, 176, 1\u20136.","journal-title":"International Journal of Production Economics"},{"issue":"3","key":"6430_CR30","doi-asserted-by":"crossref","first-page":"772","DOI":"10.1016\/j.ejor.2015.08.064","volume":"248","author":"SA Mansouri","year":"2016","unstructured":"Mansouri, S. A., Aktas, E., & Besikci, U. (2016). Green scheduling of a two-machine flowshop: Trade-off between makespan and energy consumption. European Journal of Operational Research, 248(3), 772\u2013788.","journal-title":"European Journal of Operational Research"},{"key":"6430_CR31","volume-title":"Evolutionary search and the job shop: Investigations on genetic algorithms for production scheduling","author":"DC Mattfeld","year":"2013","unstructured":"Mattfeld, D. C. (2013). Evolutionary search and the job shop: Investigations on genetic algorithms for production scheduling. Springer."},{"issue":"4","key":"6430_CR32","doi-asserted-by":"crossref","first-page":"675","DOI":"10.1016\/j.cie.2013.09.014","volume":"66","author":"MM Mazdeh","year":"2013","unstructured":"Mazdeh, M. M., Rostami, M., & Namaki, M. H. (2013). Minimizing maximum tardiness and delivery costs in a batched delivery system. Computers & Industrial Engineering, 66(4), 675\u2013682.","journal-title":"Computers & Industrial Engineering"},{"key":"6430_CR33","volume-title":"Genetic algorithms+ data structures = evolution programs","author":"Z Michalewicz","year":"2013","unstructured":"Michalewicz, Z. (2013). Genetic algorithms+ data structures = evolution programs. Springer."},{"key":"6430_CR34","doi-asserted-by":"crossref","first-page":"509","DOI":"10.1016\/j.cie.2018.07.049","volume":"124","author":"A Mishra","year":"2018","unstructured":"Mishra, A., & Shrivastava, D. (2018). A TLBO and a Jaya heuristics for permutation flow shop scheduling to minimize the sum of inventory holding and batch delay costs. Computers & Industrial Engineering, 124, 509\u2013522.","journal-title":"Computers & Industrial Engineering"},{"issue":"18\u201319","key":"6430_CR35","doi-asserted-by":"crossref","first-page":"4247","DOI":"10.1080\/00207540701450013","volume":"45","author":"G Mouzon","year":"2007","unstructured":"Mouzon, G., Yildirim, M. B., & Twomey, J. (2007). Operational methods for minimization of energy consumption of manufacturing equipment. International Journal of Production Research, 45(18\u201319), 4247\u20134271.","journal-title":"International Journal of Production Research"},{"issue":"1","key":"6430_CR36","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1016\/0305-0483(83)90088-9","volume":"11","author":"M Nawaz","year":"1983","unstructured":"Nawaz, M., Enscore, E. E., Jr., & Ham, I. (1983). A heuristic algorithm for the m-machine, n-job flow-shop sequencing problem. Omega, 11(1), 91\u201395.","journal-title":"Omega"},{"issue":"9","key":"6430_CR37","first-page":"1016","volume":"34","author":"AC Nearchou","year":"2006","unstructured":"Nearchou, A. C. (2006). Balancing large assembly lines by a new heuristic based on differential evolution method. The International Journal of Advanced Manufacturing Technology, 34(9), 1016\u20131029.","journal-title":"The International Journal of Advanced Manufacturing Technology"},{"issue":"1","key":"6430_CR38","first-page":"143","volume":"29","author":"AE Pilerood","year":"2018","unstructured":"Pilerood, A. E., Heydari, M., & Mazdeh, M. M. (2018). A two-stage greedy heuristic for a flowshop scheduling problem under time-of-use electricity tariffs. South African Journal of Industrial Engineering, 29(1), 143\u2013154.","journal-title":"South African Journal of Industrial Engineering"},{"issue":"2","key":"6430_CR39","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1080\/09537287.2021.1891481","volume":"34","author":"R Pozzi","year":"2023","unstructured":"Pozzi, R., Rossi, T., & Secchi, R. (2023). Industry 4.0 technologies: Critical success factors for implementation and improvements in manufacturing companies. Production Planning & Control, 34(2), 139\u2013158.","journal-title":"Production Planning & Control"},{"key":"6430_CR40","doi-asserted-by":"crossref","first-page":"105552","DOI":"10.1016\/j.asoc.2019.105552","volume":"82","author":"HF Rahman","year":"2019","unstructured":"Rahman, H. F., & Nielsen, I. (2019). Scheduling automated transport vehicles for material distribution systems. Applied Soft Computing, 82, 105552.","journal-title":"Applied Soft Computing"},{"key":"6430_CR41","doi-asserted-by":"crossref","first-page":"12","DOI":"10.1016\/j.cie.2015.08.006","volume":"90","author":"HF Rahman","year":"2015","unstructured":"Rahman, H. F., Sarker, R., & Essam, D. (2015). A genetic algorithm for permutation flow shop scheduling under make to stock production system. Computers & Industrial Engineering, 90, 12\u201324.","journal-title":"Computers & Industrial Engineering"},{"issue":"2","key":"6430_CR42","doi-asserted-by":"crossref","first-page":"488","DOI":"10.1016\/j.ejor.2015.06.018","volume":"247","author":"HF Rahman","year":"2015","unstructured":"Rahman, H. F., Sarker, R., & Essam, D. (2015). A real-time order acceptance and scheduling approach for permutation flow shop problems. European Journal of Operational Research, 247(2), 488\u2013503.","journal-title":"European Journal of Operational Research"},{"issue":"1","key":"6430_CR43","first-page":"87","volume":"31","author":"HF Rahman","year":"2017","unstructured":"Rahman, H. F., Sarker, R., & Essam, D. (2017). A genetic algorithm for permutation flowshop scheduling under practical make-to-order production system. AI EDAM, 31(1), 87\u2013103.","journal-title":"AI EDAM"},{"issue":"5","key":"6430_CR44","doi-asserted-by":"crossref","first-page":"2781","DOI":"10.1007\/s00170-018-2146-z","volume":"97","author":"HF Rahman","year":"2018","unstructured":"Rahman, H. F., Sarker, R., & Essam, D. (2018). Multiple-order permutation flow shop scheduling under process interruptions. The International Journal of Advanced Manufacturing Technology, 97(5), 2781\u20132808.","journal-title":"The International Journal of Advanced Manufacturing Technology"},{"key":"6430_CR45","doi-asserted-by":"crossref","first-page":"112742","DOI":"10.1109\/ACCESS.2019.2935375","volume":"7","author":"HF Rahman","year":"2019","unstructured":"Rahman, H. F., Janardhanan, M. N., & Nielsen, I. E. (2019). Real-time order acceptance and scheduling problems in a flow shop environment using hybrid ga-pso algorithm. IEEE Access, 7, 112742\u2013112755.","journal-title":"IEEE Access"},{"key":"6430_CR46","doi-asserted-by":"crossref","first-page":"103052","DOI":"10.1016\/j.autcon.2019.103052","volume":"111","author":"HF Rahman","year":"2020","unstructured":"Rahman, H. F., Chakrabortty, R. K., & Ryan, M. J. (2020). Memetic algorithm for solving resource constrained project scheduling problems. Automation in Construction, 111, 103052.","journal-title":"Automation in Construction"},{"key":"6430_CR47","doi-asserted-by":"crossref","first-page":"107378","DOI":"10.1016\/j.cie.2021.107378","volume":"158","author":"HF Rahman","year":"2021","unstructured":"Rahman, H. F., Janardhanan, M. N., Chuen, L. P., & Ponnambalam, S. G. (2021). Flowshop scheduling with sequence dependent setup times and batch delivery in supply chain. Computers & Industrial Engineering, 158, 107378.","journal-title":"Computers & Industrial Engineering"},{"issue":"2","key":"6430_CR48","doi-asserted-by":"crossref","first-page":"479","DOI":"10.1016\/j.ejor.2004.04.017","volume":"165","author":"R Ruiz","year":"2005","unstructured":"Ruiz, R., & Maroto, C. (2005). A comprehensive review and evaluation of permutation flowshop heuristics. European Journal of Operational Research, 165(2), 479\u2013494.","journal-title":"European Journal of Operational Research"},{"issue":"3","key":"6430_CR49","doi-asserted-by":"crossref","first-page":"781","DOI":"10.1016\/j.ejor.2004.06.038","volume":"169","author":"R Ruiz","year":"2006","unstructured":"Ruiz, R., & Maroto, C. (2006). A genetic algorithm for hybrid flowshops with sequence dependent setup times and machine eligibility. European Journal of Operational Research, 169(3), 781\u2013800.","journal-title":"European Journal of Operational Research"},{"issue":"3","key":"6430_CR50","doi-asserted-by":"crossref","first-page":"2033","DOI":"10.1016\/j.ejor.2005.12.009","volume":"177","author":"R Ruiz","year":"2007","unstructured":"Ruiz, R., & St\u00fctzle, T. (2007). A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem. European Journal of Operational Research, 177(3), 2033\u20132049.","journal-title":"European Journal of Operational Research"},{"issue":"5","key":"6430_CR51","doi-asserted-by":"crossref","first-page":"461","DOI":"10.1016\/j.omega.2004.12.006","volume":"34","author":"R Ruiz","year":"2006","unstructured":"Ruiz, R., Maroto, C., & Alcaraz, J. (2006). Two new robust genetic algorithms for the flowshop scheduling problem. Omega, 34(5), 461\u2013476.","journal-title":"Omega"},{"issue":"4\u20135","key":"6430_CR52","doi-asserted-by":"crossref","first-page":"1351","DOI":"10.1051\/ro\/2018023","volume":"52","author":"A Sbihi","year":"2018","unstructured":"Sbihi, A., & Chemangui, M. (2018). A genetic algorithm for the steel continuous casting with inter-sequence dependent setups and dedicated machines. RAIRO-Operations Research, 52(4\u20135), 1351\u20131376.","journal-title":"RAIRO-Operations Research"},{"issue":"24","key":"6430_CR53","doi-asserted-by":"crossref","first-page":"7276","DOI":"10.1080\/00207543.2014.919421","volume":"52","author":"A Sbihi","year":"2014","unstructured":"Sbihi, A., Bellabdaoui, A., & Teghem, J. (2014). Solving a mixed integer linear program with times setup for the steel-continuous casting planning and scheduling problem. International Journal of Production Research, 52(24), 7276\u20137296.","journal-title":"International Journal of Production Research"},{"key":"6430_CR54","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1016\/j.ijpe.2013.08.015","volume":"147","author":"E Selvarajah","year":"2014","unstructured":"Selvarajah, E., & Zhang, R. (2014). Supply chain scheduling at the manufacturer to minimize inventory holding and delivery costs. International Journal of Production Economics, 147, 117\u2013124.","journal-title":"International Journal of Production Economics"},{"key":"6430_CR55","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1016\/j.jclepro.2013.12.024","volume":"67","author":"F Shrouf","year":"2014","unstructured":"Shrouf, F., Ordieres-Mer\u00e9, J., Garc\u00eda-S\u00e1nchez, A., et al. (2014). Optimizing the production scheduling of a single machine to minimize total energy consumption costs. Journal of Cleaner Production, 67, 197\u2013207.","journal-title":"Journal of Cleaner Production"},{"issue":"2","key":"6430_CR56","doi-asserted-by":"crossref","first-page":"278","DOI":"10.1016\/0377-2217(93)90182-M","volume":"64","author":"E Taillard","year":"1993","unstructured":"Taillard, E. (1993). Benchmarks for basic scheduling problems. European Journal of Operational Research, 64(2), 278\u2013285.","journal-title":"European Journal of Operational Research"},{"issue":"21","key":"6430_CR57","doi-asserted-by":"crossref","first-page":"6513","DOI":"10.1080\/00207543.2019.1683247","volume":"58","author":"S Valizadeh","year":"2020","unstructured":"Valizadeh, S., Fatahi Valilai, O., & Houshmand, M. (2020). Flexible flow line scheduling considering machine eligibility in a digital dental laboratory. International Journal of Production Research, 58(21), 6513\u20136531.","journal-title":"International Journal of Production Research"},{"key":"6430_CR58","doi-asserted-by":"crossref","unstructured":"Van\u00a0Veldhuizen, D. A., & Lamont, G. B. (2000). On measuring multiobjective evolutionary algorithm performance. In Proceedings of the 2000 congress on evolutionary computation. CEC00 (Cat. No. 00TH8512) (pp. 204\u2013211). IEEE.","DOI":"10.1109\/CEC.2000.870296"},{"key":"6430_CR59","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1016\/j.ijpe.2014.01.009","volume":"150","author":"L Wan","year":"2014","unstructured":"Wan, L., & Zhang, A. (2014). Coordinated scheduling on parallel machines with batch delivery. International Journal of Production Economics, 150, 199\u2013203.","journal-title":"International Journal of Production Economics"},{"issue":"2","key":"6430_CR60","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1016\/S0925-5273(99)00105-X","volume":"68","author":"G Wang","year":"2000","unstructured":"Wang, G., & Cheng, T. E. (2000). Parallel machine scheduling with batch delivery costs. International Journal of Production Economics, 68(2), 177\u2013183.","journal-title":"International Journal of Production Economics"},{"key":"6430_CR61","doi-asserted-by":"crossref","first-page":"108126","DOI":"10.1016\/j.cie.2022.108126","volume":"168","author":"W Jj","year":"2022","unstructured":"Jj, W., & Wang, L. (2022). A cooperative memetic algorithm with feedback for the energy-aware distributed flow-shops with flexible assembly scheduling. Computers & Industrial Engineering, 168, 108126.","journal-title":"Computers & Industrial Engineering"},{"issue":"10","key":"6430_CR62","doi-asserted-by":"crossref","first-page":"1826","DOI":"10.1109\/TSMC.2017.2720178","volume":"48","author":"K Wang","year":"2017","unstructured":"Wang, K., Luo, H., Liu, F., & Yue, X. (2017). Permutation flow shop scheduling with batch delivery to multiple customers in supply chains. IEEE Transactions on Systems, Man, and Cybernetics: Systems, 48(10), 1826\u20131837.","journal-title":"IEEE Transactions on Systems, Man, and Cybernetics: Systems"},{"key":"6430_CR63","doi-asserted-by":"crossref","unstructured":"Wang, S., Ali, S., Yue, T., & Lie, Y. (2016). A practical guide to select quality indicators for assessing pareto-based search algorithms in search-based software engineering. In Proceedings of the 38th international conference on software engineering (pp. 631\u2013642).","DOI":"10.1145\/2884781.2884880"},{"issue":"9","key":"6430_CR64","doi-asserted-by":"crossref","first-page":"3173","DOI":"10.1080\/00207543.2017.1401236","volume":"56","author":"S Wang","year":"2018","unstructured":"Wang, S., Zhu, Z., Fang, K., & Chu, C. (2018). Scheduling on a two-machine permutation flow shop under time-of-use electricity tariffs. International Journal of Production Research, 56(9), 3173\u20133187.","journal-title":"International Journal of Production Research"},{"issue":"2","key":"6430_CR65","doi-asserted-by":"crossref","first-page":"151","DOI":"10.7232\/iems.2013.12.2.151","volume":"12","author":"W Wisittipanich","year":"2013","unstructured":"Wisittipanich, W., & Kachitvichyanukul, V. (2013). An efficient PSO algorithm for finding Pareto-frontier in multi-objective job shop scheduling problems. Industrial Engineering and Management Systems, 12(2), 151\u2013160.","journal-title":"Industrial Engineering and Management Systems"},{"key":"6430_CR66","doi-asserted-by":"crossref","unstructured":"Wright, A. H. (1991). Genetic algorithms for real parameter optimization. In Foundations of genetic algorithms (vol.\u00a01, pp. 205\u2013218). Elsevier.","DOI":"10.1016\/B978-0-08-050684-5.50016-1"},{"issue":"8","key":"6430_CR67","first-page":"735","volume":"32","author":"X Yang","year":"2000","unstructured":"Yang, X. (2000). Scheduling with generalized batch delivery dates and earliness penalties. IIE Transactions, 32(8), 735\u2013741.","journal-title":"IIE Transactions"},{"issue":"1","key":"6430_CR68","doi-asserted-by":"crossref","first-page":"258","DOI":"10.1080\/00207543.2020.1842938","volume":"61","author":"KC Ying","year":"2023","unstructured":"Ying, K. C., Pourhejazy, P., Cheng, C. Y., & Syu, R. S. (2023). Supply chain-oriented permutation flowshop scheduling considering flexible assembly and setup times. International Journal of Production Research, 61(1), 258\u2013281.","journal-title":"International Journal of Production Research"},{"key":"6430_CR69","doi-asserted-by":"crossref","first-page":"3361","DOI":"10.1016\/j.jclepro.2015.09.097","volume":"112","author":"R Zhang","year":"2016","unstructured":"Zhang, R., & Chiong, R. (2016). Solving the energy-efficient job shop scheduling problem: A multi-objective genetic algorithm with enhanced local search for minimizing the total weighted tardiness and total energy consumption. Journal of Cleaner Production, 112, 3361\u20133375.","journal-title":"Journal of Cleaner Production"},{"issue":"13","key":"6430_CR70","doi-asserted-by":"crossref","first-page":"4103","DOI":"10.1080\/00207543.2019.1642529","volume":"58","author":"X Zheng","year":"2020","unstructured":"Zheng, X., Zhou, S., Xu, R., & Chen, H. (2020). Energy-efficient scheduling for multi-objective two-stage flow shop using a hybrid ant colony optimisation algorithm. International Journal of Production Research, 58(13), 4103\u20134120.","journal-title":"International Journal of Production Research"},{"issue":"15","key":"6430_CR71","doi-asserted-by":"crossref","first-page":"4756","DOI":"10.1080\/00207543.2020.1771456","volume":"59","author":"H Zhu","year":"2020","unstructured":"Zhu, H., Lu, Z., Lu, C., & Ren, Y. (2020). A reactive scheduling method for disturbances in aircraft moving assembly line. International Journal of Production Research, 59(15), 4756\u20134772.","journal-title":"International Journal of Production Research"},{"issue":"4","key":"6430_CR72","doi-asserted-by":"crossref","first-page":"1249","DOI":"10.1016\/j.cor.2008.01.007","volume":"36","author":"G Zobolas","year":"2009","unstructured":"Zobolas, G., Tarantilis, C. D., & Ioannou, G. (2009). Minimizing makespan in permutation flow shop scheduling problems using a hybrid metaheuristic algorithm. Computers & Operations Research, 36(4), 1249\u20131267.","journal-title":"Computers & Operations Research"}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-024-06430-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10479-024-06430-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-024-06430-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,27]],"date-time":"2025-01-27T12:24:57Z","timestamp":1737980697000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10479-024-06430-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,12,28]]},"references-count":72,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2025,2]]}},"alternative-id":["6430"],"URL":"https:\/\/doi.org\/10.1007\/s10479-024-06430-6","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"value":"0254-5330","type":"print"},{"value":"1572-9338","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,12,28]]},"assertion":[{"value":"21 November 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"2 December 2024","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"28 December 2024","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors have no Conflict of interest to declare that are relevant to the content of this article.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}