{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,5]],"date-time":"2026-01-05T05:24:56Z","timestamp":1767590696457,"version":"3.48.0"},"publisher-location":"Cham","reference-count":25,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032141620","type":"print"},{"value":"9783032141637","type":"electronic"}],"license":[{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2026]]},"DOI":"10.1007\/978-3-032-14163-7_3","type":"book-chapter","created":{"date-parts":[[2026,1,5]],"date-time":"2026-01-05T05:23:17Z","timestamp":1767590597000},"page":"33-47","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A Randomized Insertion-Based Trigonometric Algorithm (RITA) for Permutation Flowshop Scheduling Problems"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-5019-9973","authenticated-orcid":false,"given":"Baskar","family":"Amaladosan","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6921-1178","authenticated-orcid":false,"given":"Anthony Xavior","family":"Michael","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2181-4380","authenticated-orcid":false,"given":"Anna","family":"Burduk","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4640-3916","authenticated-orcid":false,"given":"Suthep","family":"Butdee","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4917-2474","authenticated-orcid":false,"given":"Jose","family":"Machado","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2026,1,6]]},"reference":[{"issue":"2","key":"3_CR1","first-page":"353","volume":"7","author":"A Baskar","year":"2016","unstructured":"Baskar, A.: Revisiting the NEH algorithm-the power of job insertion technique for optimizing the makespan in permutation flow shop scheduling. Int. J. Ind. Eng. Comput. 7(2), 353\u2013366 (2016)","journal-title":"Int. J. Ind. Eng. Comput."},{"issue":"3","key":"3_CR2","first-page":"153","volume":"6","author":"A Baskar","year":"2015","unstructured":"Baskar, A., Xavior, M.A.: Analysis of job insertion technique for different initial sequences in permutation flow shop scheduling problems. Int. J. Enterpr. Netw. Manage. 6(3), 153\u2013174 (2015)","journal-title":"Int. J. Enterpr. Netw. Manage."},{"key":"3_CR3","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2021.105348","volume":"133","author":"A Baskar","year":"2021","unstructured":"Baskar, A., Xavior, M.A.: New idle time-based tie-breaking rules in heuristics for the permutation flowshop scheduling problems. Comput. Oper. Res. 133, 105348 (2021)","journal-title":"Comput. Oper. Res."},{"issue":"1","key":"3_CR4","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1051\/ro\/2023195","volume":"58","author":"A Baskar","year":"2024","unstructured":"Baskar, A.: Simple population-based algorithms for solving optimization problems. RAIRO-Operat. Res. 58(1), 253\u2013280 (2024)","journal-title":"RAIRO-Operat. Res."},{"issue":"4","key":"3_CR5","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1051\/ro\/1978120403331","volume":"12","author":"J Carlier","year":"1978","unstructured":"Carlier, J.: Ordonnancements a contraintes disjonctives. RAIRO-Operations Research 12(4), 333\u2013350 (1978)","journal-title":"RAIRO-Operations Research"},{"issue":"1","key":"3_CR6","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1016\/S0377-2217(97)00019-2","volume":"109","author":"E Demirkol","year":"1998","unstructured":"Demirkol, E., Mehta, S., Uzsoy, R.: Benchmarks for shop scheduling problems. Eur. J. Oper. Res. 109(1), 137\u2013141 (1998)","journal-title":"Eur. J. Oper. Res."},{"issue":"12","key":"3_CR7","doi-asserted-by":"publisher","first-page":"3962","DOI":"10.1016\/j.cor.2007.05.005","volume":"35","author":"X Dong","year":"2008","unstructured":"Dong, X., Huang, H., Chen, P.: An improved NEH-based heuristic for the permutation flowshop problem. Comput. Oper. Res. 35(12), 3962\u20133968 (2008)","journal-title":"Comput. Oper. Res."},{"issue":"2\u20133","key":"3_CR8","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1016\/j.tcs.2005.05.020","volume":"344","author":"M Dorigo","year":"2005","unstructured":"Dorigo, M., Blum, C.: Ant colony optimization theory: a survey. Theoret. Comput. Sci. 344(2\u20133), 243\u2013278 (2005)","journal-title":"Theoret. Comput. Sci."},{"key":"3_CR9","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1016\/j.cor.2013.12.012","volume":"45","author":"V Fernandez-Viagas","year":"2014","unstructured":"Fernandez-Viagas, V., Framinan, J.M.: On insertion tie-breaking rules in heuristics for the permutation flowshop scheduling problem. Comput. Oper. Res. 45, 60\u201367 (2014)","journal-title":"Comput. Oper. Res."},{"issue":"3","key":"3_CR10","doi-asserted-by":"publisher","first-page":"707","DOI":"10.1016\/j.ejor.2016.09.055","volume":"257","author":"V Fernandez-Viagas","year":"2017","unstructured":"Fernandez-Viagas, V., Ruiz, R., Framinan, J.M.: A new vision of approximate methods for the permutation flowshop to minimise makespan: State-of-the-art and computational evaluation. Eur. J. Oper. Res. 257(3), 707\u2013721 (2017)","journal-title":"Eur. J. Oper. Res."},{"key":"3_CR11","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1007\/s00366-011-0241-y","volume":"29","author":"AH Gandomi","year":"2013","unstructured":"Gandomi, A.H., Yang, X.S., Alavi, A.H.: Cuckoo search algorithm: a metaheuristic approach to solve structural optimization problems. Eng. Comp. 29, 17\u201335 (2013)","journal-title":"Eng. Comp."},{"issue":"2","key":"3_CR12","doi-asserted-by":"publisher","first-page":"178","DOI":"10.1287\/opre.8.2.178","volume":"8","author":"J Heller","year":"1960","unstructured":"Heller, J.: Some numerical experiments for an M\u00d7 J flow shop and its decision-theoretical aspects. Oper. Res. 8(2), 178\u2013184 (1960)","journal-title":"Oper. Res."},{"issue":"1","key":"3_CR13","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1002\/nav.3800010110","volume":"1","author":"SM Johnson","year":"1954","unstructured":"Johnson, S.M.: Optimal two-and three-stage production schedules with setup times included. Naval Res. Logi. Q. 1(1), 61\u201368 (1954)","journal-title":"Naval Res. Logi. Q."},{"key":"3_CR14","doi-asserted-by":"crossref","unstructured":"Karaboga, D., Basturk, B.: Artificial bee colony (ABC) optimization algorithm for solving constrained optimization problems. In: International fuzzy systems association world congress, pp. 789\u2013798. Springer Berlin Heidelberg, Berlin, Heidelberg (2007)","DOI":"10.1007\/978-3-540-72950-1_77"},{"key":"3_CR15","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1016\/j.ijpe.2017.06.026","volume":"193","author":"W Liu","year":"2017","unstructured":"Liu, W., Jin, Y., Price, M.: A new improved NEH heuristic for permutation flowshop scheduling problems. Int. J. Prod. Econ. 193, 21\u201330 (2017)","journal-title":"Int. J. Prod. Econ."},{"key":"3_CR16","doi-asserted-by":"publisher","first-page":"46","DOI":"10.1016\/j.advengsoft.2013.12.007","volume":"69","author":"S Mirjalili","year":"2014","unstructured":"Mirjalili, S., Mirjalili, S.M., Lewis, A.: Grey wolf optimizer. Adv. Eng. Softw. 69, 46\u201361 (2014)","journal-title":"Adv. Eng. Softw."},{"issue":"1","key":"3_CR17","doi-asserted-by":"publisher","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.: A heuristic algorithm for the m-machine, n-job flow-shop sequencing problem. Omega 11(1), 91\u201395 (1983)","journal-title":"Omega"},{"issue":"3","key":"3_CR18","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1016\/j.cad.2010.12.015","volume":"43","author":"RV Rao","year":"2011","unstructured":"Rao, R.V., Savsani, V.J., Vakharia, D.P.: Teaching\u2013learning-based optimization: a novel method for constrained mechanical design optimization problems. Comput. Aided Des. 43(3), 303\u2013315 (2011)","journal-title":"Comput. Aided Des."},{"issue":"1","key":"3_CR19","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1162\/evco.1998.6.1.45","volume":"6","author":"CR Reeves","year":"1998","unstructured":"Reeves, C.R., Yamada, T.: Genetic algorithms, path relinking, and the flowshop sequencing problem. Evol. Comput. 6(1), 45\u201360 (1998)","journal-title":"Evol. Comput."},{"issue":"5","key":"3_CR20","doi-asserted-by":"publisher","first-page":"112","DOI":"10.3390\/a13050112","volume":"13","author":"C Sauvey","year":"2020","unstructured":"Sauvey, C., Sauer, N.: Two NEH heuristic improvements for flowshop scheduling problem with makespan criterion. Algorithms 13(5), 112 (2020)","journal-title":"Algorithms"},{"key":"3_CR21","unstructured":"Summary of best known lower and upper bounds of Taillard's instances, http:\/\/mistic.heig-vd.ch\/taillard\/problemes.dir\/ordonnancement.dir\/flowshop.dir\/best_lb_up.txt. Last accessed 22 May 2015"},{"key":"3_CR22","doi-asserted-by":"crossref","unstructured":"Taillard, E.: Benchmarks for basic scheduling problems. European J. Operat. Res. 64(2), 278\u2013285 (1993)","DOI":"10.1016\/0377-2217(93)90182-M"},{"issue":"3","key":"3_CR23","doi-asserted-by":"publisher","first-page":"666","DOI":"10.1016\/j.ejor.2014.07.033","volume":"240","author":"E Vallada","year":"2015","unstructured":"Vallada, E., Ruiz, R., Framinan, J.M.: New hard benchmark for flowshop scheduling problems minimising makespan. Eur. J. Oper. Res. 240(3), 666\u2013677 (2015)","journal-title":"Eur. J. Oper. Res."},{"issue":"2","key":"3_CR24","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1007\/s12293-016-0212-3","volume":"10","author":"GG Wang","year":"2018","unstructured":"Wang, G.G.: Moth search algorithm: a bio-inspired metaheuristic algorithm for global optimization problems. Memetic Computing 10(2), 151\u2013164 (2018)","journal-title":"Memetic Computing"},{"key":"3_CR25","doi-asserted-by":"crossref","unstructured":"Yang, X.S.: A new metaheuristic bat-inspired algorithm. In: Nature inspired cooperative strategies for optimization (NICSO 2010), pp. 65\u201374. Springer Berlin Heidelberg, Berlin, Heidelberg (2010)","DOI":"10.1007\/978-3-642-12538-6_6"}],"container-title":["Lecture Notes in Networks and Systems","Proceedings of the Fifth International Conference on Intelligent Systems in Production Engineering and Maintenance ISPEM 2025"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-14163-7_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,1,5]],"date-time":"2026-01-05T05:23:18Z","timestamp":1767590598000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-14163-7_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9783032141620","9783032141637"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-14163-7_3","relation":{},"ISSN":["2367-3370","2367-3389"],"issn-type":[{"value":"2367-3370","type":"print"},{"value":"2367-3389","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026]]},"assertion":[{"value":"6 January 2026","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ISPEM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Intelligent Systems in Production Engineering and Maintenance","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Wroc\u0142aw","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Poland","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 June 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27 June 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ispem2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.ispem.pwr.edu.pl\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}