{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,25]],"date-time":"2026-01-25T14:20:27Z","timestamp":1769350827371,"version":"3.49.0"},"reference-count":41,"publisher":"MDPI AG","issue":"5","license":[{"start":{"date-parts":[[2023,3,3]],"date-time":"2023-03-03T00:00:00Z","timestamp":1677801600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"name":"National Natural Science Foundation of China","award":["52275504"],"award-info":[{"award-number":["52275504"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Sensors"],"abstract":"<jats:p>Owing to the different quantities and processing times of sub-lots, intermingling sub-lots with each other, instead of fixing the production sequence of sub-lots of a lot as in the existing studies, is a more practical approach to lot-streaming flow shops. Hence, a lot-streaming hybrid flow shop scheduling problem with consistent and intermingled sub-lots (LHFSP-CIS) was studied. A mixed integer linear programming (MILP) model was established, and a heuristic-based adaptive iterated greedy algorithm (HAIG) with three modifications was designed to solve the problem. Specifically, a two-layer encoding method was proposed to decouple the sub-lot-based connection. Two heuristics were embedded in the decoding process to reduce the manufacturing cycle. Based on this, a heuristic-based initialization is proposed to improve the performance of the initial solution; an adaptive local search with four specific neighborhoods and an adaptive strategy has been structured to improve the exploration and exploitation ability. Besides, an acceptance criterion of inferior solutions has been improved to promote global optimization ability. The experiment and the non-parametric Kruskal\u2013Wallis test (p = 0) showed the significant advantages of HAIG in effectiveness and robustness compared with five state-of-the-art algorithms. An industrial case study verifies that intermingling sub-lots is an effective technique to enhance the utilization ratio of machines and shorten the manufacturing cycle.<\/jats:p>","DOI":"10.3390\/s23052808","type":"journal-article","created":{"date-parts":[[2023,3,6]],"date-time":"2023-03-06T02:28:34Z","timestamp":1678069714000},"page":"2808","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":16,"title":["A Heuristic-Based Adaptive Iterated Greedy Algorithm for Lot-Streaming Hybrid Flow Shop Scheduling Problem with Consistent and Intermingled Sub-Lots"],"prefix":"10.3390","volume":"23","author":[{"given":"Yiling","family":"Lu","sequence":"first","affiliation":[{"name":"Key Laboratory of Metallurgical Equipment and Control Technology of Ministry of Education, Wuhan University of Science and Technology, Wuhan 430081, China"},{"name":"Hubei Key Laboratory of Mechanical Transmission and Manufacturing Engineering, Wuhan University of Science and Technology, Wuhan 430081, China"}]},{"given":"Qiuhua","family":"Tang","sequence":"additional","affiliation":[{"name":"Key Laboratory of Metallurgical Equipment and Control Technology of Ministry of Education, Wuhan University of Science and Technology, Wuhan 430081, China"},{"name":"Hubei Key Laboratory of Mechanical Transmission and Manufacturing Engineering, Wuhan University of Science and Technology, Wuhan 430081, China"}]},{"given":"Quanke","family":"Pan","sequence":"additional","affiliation":[{"name":"School of Mechatronic Engineering and Automation, Shanghai University, Shanghai 200444, China"}]},{"given":"Lianpeng","family":"Zhao","sequence":"additional","affiliation":[{"name":"Key Laboratory of Metallurgical Equipment and Control Technology of Ministry of Education, Wuhan University of Science and Technology, Wuhan 430081, China"},{"name":"Hubei Key Laboratory of Mechanical Transmission and Manufacturing Engineering, Wuhan University of Science and Technology, Wuhan 430081, China"}]},{"given":"Yingying","family":"Zhu","sequence":"additional","affiliation":[{"name":"Key Laboratory of Metallurgical Equipment and Control Technology of Ministry of Education, Wuhan University of Science and Technology, Wuhan 430081, China"},{"name":"Hubei Key Laboratory of Mechanical Transmission and Manufacturing Engineering, Wuhan University of Science and Technology, Wuhan 430081, China"}]}],"member":"1968","published-online":{"date-parts":[[2023,3,3]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.ejor.2009.09.024","article-title":"The hybrid flow shop scheduling problem","volume":"205","author":"Ruiz","year":"2010","journal-title":"Eur. J. Oper. Res."},{"key":"ref_2","doi-asserted-by":"crossref","first-page":"7023","DOI":"10.1080\/00207543.2013.774506","article-title":"A review of lot streaming","volume":"51","author":"Cheng","year":"2013","journal-title":"Int. J. Prod. Res."},{"key":"ref_3","doi-asserted-by":"crossref","first-page":"2033","DOI":"10.1016\/j.ejor.2005.12.009","article-title":"A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem","volume":"177","author":"Ruiz","year":"2007","journal-title":"Eur. J. Oper. Res."},{"key":"ref_4","doi-asserted-by":"crossref","first-page":"160","DOI":"10.1016\/j.cor.2016.12.021","article-title":"An iterated greedy algorithm with optimization of partial solutions for the makespan permutation flowshop problem","volume":"81","author":"Pagnozzi","year":"2017","journal-title":"Comput. Oper. Res."},{"key":"ref_5","doi-asserted-by":"crossref","unstructured":"Ni, F., Hao, J., Lu, J., Tong, X., Yuan, M., Duan, J., Ma, Y., and He, K. (2021, January 14\u201318). A Multi-Graph Attributed Reinforcement Learning based Optimization Algorithm for Large-scale Hybrid Flow Shop Scheduling Problem. Proceedings of the 27th ACM SIGKDD Conference on Knowledge Discovery & Data Mining, Singapore.","DOI":"10.1145\/3447548.3467135"},{"key":"ref_6","doi-asserted-by":"crossref","unstructured":"Ercan, M.F. (2008, January 16\u201320). A performance comparison of PSO and GA in scheduling hybrid flow-shops with multiprocessor tasks. Proceedings of the 2008 ACM Symposium on Applied Computing, Cear\u00e1, Brazil.","DOI":"10.1145\/1363686.1364112"},{"key":"ref_7","doi-asserted-by":"crossref","unstructured":"Salhi, A., Rodr\u00edguez, J.A.V., and Zhang, Q. (2007, January 7\u201311). An estimation of distribution algorithm with guided mutation for a complex flow shop scheduling problem. Proceedings of the 9th Annual Conference on Genetic and Evolutionary Computation, London, UK.","DOI":"10.1145\/1276958.1277076"},{"key":"ref_8","doi-asserted-by":"crossref","unstructured":"Caricato, P., Grieco, A., and Nucci, F. (2008, January 7\u201310). Simulation and mathematical programming for a multi-objective configuration problem in a hybrid flow shop. Proceedings of the 2008 Winter Simulation Conference, Miami, FL, USA.","DOI":"10.1109\/WSC.2008.4736271"},{"key":"ref_9","doi-asserted-by":"crossref","first-page":"763","DOI":"10.1016\/j.ijpe.2009.07.003","article-title":"Two-machine flow shop scheduling to minimize the sum of maximum earliness and tardiness","volume":"122","author":"Moslehi","year":"2009","journal-title":"Int. J. Prod. Econ."},{"key":"ref_10","doi-asserted-by":"crossref","first-page":"464","DOI":"10.1016\/j.cie.2018.03.014","article-title":"The distributed permutation flow shop to minimise the total flowtime","volume":"118","author":"Framinan","year":"2018","journal-title":"Comput. Ind. Eng."},{"key":"ref_11","doi-asserted-by":"crossref","first-page":"361","DOI":"10.1109\/TASE.2022.3151648","article-title":"Improved Meta-Heuristics for Solving Distributed Lot-Streaming Permutation Flow Shop Scheduling Problems","volume":"20","author":"Pan","year":"2022","journal-title":"IEEE Trans. Autom. Sci. Eng."},{"key":"ref_12","first-page":"459","article-title":"Lot streaming in a two-stage assembly hybrid flow shop scheduling problem with a work shift constraint","volume":"33","author":"Nejati","year":"2016","journal-title":"J. Ind. Prod. Eng."},{"key":"ref_13","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1016\/j.knosys.2018.02.029","article-title":"A novel hybrid multi-objective artificial bee colony algorithm for blocking lot-streaming flow shop scheduling problems","volume":"148","author":"Gong","year":"2018","journal-title":"Knowl.-Based Syst."},{"key":"ref_14","doi-asserted-by":"crossref","first-page":"107305","DOI":"10.1016\/j.asoc.2021.107305","article-title":"A collaborative variable neighborhood descent algorithm for the hybrid flowshop scheduling problem with consistent sublots","volume":"106","author":"Zhang","year":"2021","journal-title":"Appl. Soft Comput."},{"key":"ref_15","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1016\/j.apm.2013.06.005","article-title":"A branch and bound algorithm for hybrid flow shop scheduling problem with setup time and assembly operations","volume":"38","author":"Fattahi","year":"2014","journal-title":"Appl. Math. Model."},{"key":"ref_16","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1080\/00207540600930065","article-title":"Lot streaming in a multiple product permutation flow shop with intermingling","volume":"46","author":"Feldmann","year":"2007","journal-title":"Int. J. Prod. Res."},{"key":"ref_17","doi-asserted-by":"crossref","first-page":"689","DOI":"10.4028\/www.scientific.net\/AMM.564.689","article-title":"Lot Streaming and Preventive Maintenance in a Multiple Product Permutation Flow Shop with Intermingling","volume":"564","author":"Mortezaei","year":"2014","journal-title":"Appl. Mech. Mater."},{"key":"ref_18","doi-asserted-by":"crossref","unstructured":"Zhang, P., Wang, L., and Wang, S.-Y. (2014, January 28\u201330). A discrete fruit fly optimization algorithm for flow shop scheduling problem with intermingling equal sublots. Proceedings of the 33rd Chinese Control Conference, Nanjing, China.","DOI":"10.1109\/ChiCC.2014.6896242"},{"key":"ref_19","doi-asserted-by":"crossref","first-page":"1119","DOI":"10.1080\/00207543.2018.1501166","article-title":"Mathematical modelling and optimisation of energy-conscious hybrid flow shop scheduling problem with unrelated parallel machines","volume":"57","author":"Meng","year":"2018","journal-title":"Int. J. Prod. Res."},{"key":"ref_20","doi-asserted-by":"crossref","first-page":"101058","DOI":"10.1016\/j.swevo.2022.101058","article-title":"Novel MILP and CP models for distributed hybrid flowshop scheduling problem with sequence-dependent setup times","volume":"71","author":"Meng","year":"2022","journal-title":"Swarm Evol. Comput."},{"key":"ref_21","doi-asserted-by":"crossref","first-page":"710","DOI":"10.1016\/j.jclepro.2018.11.021","article-title":"MILP models for energy-aware flexible job shop scheduling problem","volume":"210","author":"Meng","year":"2018","journal-title":"J. Clean. Prod."},{"key":"ref_22","doi-asserted-by":"crossref","first-page":"106347","DOI":"10.1016\/j.cie.2020.106347","article-title":"Mixed-integer linear programming and constraint programming formulations for solving distributed flexible job shop scheduling problem","volume":"142","author":"Meng","year":"2020","journal-title":"Comput. Ind. Eng."},{"key":"ref_23","doi-asserted-by":"crossref","unstructured":"\u00d6ztop, H., Tasgetiren, M.F., Eliiyi, D.T., and Pan, Q.-K. (2018, January 15\u201319). Iterated greedy algorithms for the hybrid flowshop scheduling with total flow time minimization. Proceedings of the Genetic and Evolutionary Computation Conference, Kyoto, Japan.","DOI":"10.1145\/3205455.3205500"},{"key":"ref_24","unstructured":"Zhang, H., Li, J., Hong, M., and Man, Y. (2021). Applications of Artificial Intelligence in Process Systems Engineering, Elsevier."},{"key":"ref_25","doi-asserted-by":"crossref","first-page":"3037","DOI":"10.1080\/00207549608905076","article-title":"The impact of lot sizing and sequencing on manufacturing performance in a two-stage hybrid flow shop","volume":"34","author":"Tsubone","year":"1996","journal-title":"Int. J. Prod. Res."},{"key":"ref_26","doi-asserted-by":"crossref","first-page":"106629","DOI":"10.1016\/j.asoc.2020.106629","article-title":"An effective Iterated Greedy algorithm for the distributed permutation flowshop scheduling with due windows","volume":"96","author":"Jing","year":"2020","journal-title":"Appl. Soft Comput."},{"key":"ref_27","doi-asserted-by":"crossref","first-page":"2153","DOI":"10.1109\/TASE.2021.3062979","article-title":"A Hybrid Iterated Greedy Algorithm for a Crane Transportation Flexible Job Shop Problem","volume":"19","author":"Li","year":"2021","journal-title":"IEEE Trans. Autom. Sci. Eng."},{"key":"ref_28","doi-asserted-by":"crossref","first-page":"104839","DOI":"10.1016\/j.cor.2019.104839","article-title":"A new iterated greedy algorithm for no-idle permutation flowshop scheduling with the total tardiness criterion","volume":"117","author":"Riahi","year":"2019","journal-title":"Comput. Oper. Res."},{"key":"ref_29","doi-asserted-by":"crossref","first-page":"100742","DOI":"10.1016\/j.swevo.2020.100742","article-title":"An effective iterated greedy method for the distributed permutation flowshop scheduling problem with sequence-dependent setup times","volume":"59","author":"Huang","year":"2020","journal-title":"Swarm Evol. Comput."},{"key":"ref_30","doi-asserted-by":"crossref","unstructured":"Du, K.-L., and Swamy, M.N.S. (2016). Search and Optimization by Metaheuristics, Birkh\u00e4user.","DOI":"10.1007\/978-3-319-41192-7"},{"key":"ref_31","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1287\/opre.49.2.293.13536","article-title":"The Asymptotic Optimality of the SPT Rule for the Flow Shop Mean Completion Time Problem","volume":"49","author":"Kaminsky","year":"2001","journal-title":"Oper. Res."},{"key":"ref_32","unstructured":"Duarte, A., S\u00e1nchez-Oro, J., Mladenovi\u0107, N., and Todosijevi\u0107, R. (2018). Handbook of Heuristics, Springer."},{"key":"ref_33","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1016\/j.cor.2019.06.009","article-title":"Metaheuristic algorithms for the hybrid flowshop scheduling problem","volume":"111","author":"Tasgetiren","year":"2019","journal-title":"Comput. Oper. Res."},{"key":"ref_34","doi-asserted-by":"crossref","first-page":"22","DOI":"10.1016\/j.cie.2017.12.013","article-title":"A hybrid variable neighborhood search algorithm for the hot rolling batch scheduling problem in compact strip production","volume":"116","author":"Zhang","year":"2018","journal-title":"Comput. Ind. Eng."},{"key":"ref_35","doi-asserted-by":"crossref","first-page":"7","DOI":"10.1016\/j.fsigss.2007.10.050","article-title":"Reduce optimisation time and effort: Taguchi experimental design methods","volume":"1","author":"Ballantyne","year":"2008","journal-title":"Forensic Sci. Int. Genet. Suppl. Ser."},{"key":"ref_36","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1016\/0305-0483(83)90088-9","article-title":"A heuristic algorithm for the m-machine, n-job flow-shop sequencing problem","volume":"11","author":"Nawaz","year":"1983","journal-title":"Omega"},{"key":"ref_37","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1016\/j.cor.2018.07.025","article-title":"A genetic algorithm for the hybrid flow shop scheduling with unrelated machines and machine eligibility","volume":"100","author":"Yu","year":"2018","journal-title":"Comput. Oper. Res."},{"key":"ref_38","unstructured":"Anjana, V., Sridharan, R., and Kumar, P.N.R. (2020). Advances in Simulation, Product Design and Development; Proceedings of AIMTDR 2018, Springer."},{"key":"ref_39","doi-asserted-by":"crossref","first-page":"102081","DOI":"10.1016\/j.rcim.2020.102081","article-title":"A discrete whale swarm algorithm for hybrid flow-shop scheduling problem with limited buffers","volume":"68","author":"Zhang","year":"2020","journal-title":"Robot. Comput. Manuf."},{"key":"ref_40","doi-asserted-by":"crossref","first-page":"107298","DOI":"10.1016\/j.asoc.2021.107298","article-title":"Discrete Grey Wolf Optimizer for symmetric travelling salesman problem","volume":"105","author":"Panwar","year":"2021","journal-title":"Appl. Soft Comput."},{"key":"ref_41","doi-asserted-by":"crossref","first-page":"706","DOI":"10.1016\/j.procs.2020.09.043","article-title":"Tabu-search optimization approach for no-wait hybrid flow-shop scheduling with dedicated machines","volume":"176","author":"Harbaoui","year":"2020","journal-title":"Procedia Comput. Sci."}],"container-title":["Sensors"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/1424-8220\/23\/5\/2808\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,10]],"date-time":"2025-10-10T18:47:27Z","timestamp":1760122047000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/1424-8220\/23\/5\/2808"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,3,3]]},"references-count":41,"journal-issue":{"issue":"5","published-online":{"date-parts":[[2023,3]]}},"alternative-id":["s23052808"],"URL":"https:\/\/doi.org\/10.3390\/s23052808","relation":{},"ISSN":["1424-8220"],"issn-type":[{"value":"1424-8220","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,3,3]]}}}