{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,7]],"date-time":"2026-03-07T00:33:25Z","timestamp":1772843605456,"version":"3.50.1"},"reference-count":47,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2023,12,6]],"date-time":"2023-12-06T00:00:00Z","timestamp":1701820800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,12,6]],"date-time":"2023-12-06T00:00:00Z","timestamp":1701820800000},"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":["Oper. Res. Forum"],"DOI":"10.1007\/s43069-023-00276-7","type":"journal-article","created":{"date-parts":[[2023,12,6]],"date-time":"2023-12-06T12:02:31Z","timestamp":1701864151000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["The Seeds of the NEH Algorithm: An Overview Using Bibliometric Analysis"],"prefix":"10.1007","volume":"4","author":[{"given":"Bruno","family":"de Athayde Prata","sequence":"first","affiliation":[]},{"given":"Marcelo Seido","family":"Nagano","sequence":"additional","affiliation":[]},{"given":"N\u00e1dia Junqueira","family":"Martarelli Fr\u00f3es","sequence":"additional","affiliation":[]},{"given":"Levi Ribeiro","family":"de Abreu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,12,6]]},"reference":[{"issue":"17","key":"276_CR1","doi-asserted-by":"crossref","first-page":"5401","DOI":"10.1080\/00207543.2020.1718794","volume":"58","author":"M Parente","year":"2020","unstructured":"Parente M, Figueira G, Amorim P, Marques A (2020) Production scheduling in the context of industry 4.0: review and trends. Int J Prod Res 58(17):5401\u20135431","journal-title":"Int J Prod Res"},{"key":"276_CR2","doi-asserted-by":"crossref","first-page":"425","DOI":"10.1016\/j.jocs.2017.06.004","volume":"25","author":"HY Fuchigami","year":"2018","unstructured":"Fuchigami HY, Rangel S (2018) A survey of case studies in production scheduling: analysis and perspectives. J Comput Sci 25:425\u2013436","journal-title":"J Comput Sci"},{"issue":"1","key":"276_CR3","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s11518-015-5266-0","volume":"24","author":"M Pinedo","year":"2015","unstructured":"Pinedo M, Zacharias C, Zhu N (2015) Scheduling in the service industries: an overview. J Syst Sci Syst Eng 24(1):1\u201348","journal-title":"J Syst Sci Syst Eng"},{"key":"276_CR4","unstructured":"Michael LP (2018) Scheduling: theory, algorithms, and systems. Springer"},{"issue":"1","key":"276_CR5","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 EE 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":"1","key":"276_CR6","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1016\/0377-2217(90)90090-X","volume":"47","author":"E Taillard","year":"1990","unstructured":"Taillard E (1990) Some efficient heuristic methods for the flow shop sequencing problem. Eur J Oper Res 47(1):65\u201374","journal-title":"Eur J Oper Res"},{"issue":"3","key":"276_CR7","doi-asserted-by":"crossref","first-page":"559","DOI":"10.1016\/S0377-2217(01)00278-8","volume":"141","author":"JM Framinan","year":"2002","unstructured":"Framinan JM, Leisten R, Ruiz-Usano R (2002) Efficient heuristics for flowshop sequencing with the objectives of makespan and flowtime minimisation. Eur J Oper Res 141(3):559\u2013569","journal-title":"Eur J Oper Res"},{"issue":"1","key":"276_CR8","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1080\/00207540210161650","volume":"41","author":"J Framinan","year":"2003","unstructured":"Framinan J, Leisten R, Rajendran C (2003) Different initial sequences for the heuristic of nawaz, enscore and ham to minimize makespan, idletime or flowtime in the static permutation flowshop sequencing problem. Int J Prod Res 41(1):121\u2013148","journal-title":"Int J Prod Res"},{"key":"276_CR9","doi-asserted-by":"crossref","first-page":"60","DOI":"10.1016\/j.cor.2013.12.012","volume":"45","author":"V Fernandez-Viagas","year":"2014","unstructured":"Fernandez-Viagas V, Framinan JM (2014) On insertion tie-breaking rules in heuristics for the permutation flowshop scheduling problem. Comput Oper Res 45:60\u201367","journal-title":"Comput Oper Res"},{"issue":"3","key":"276_CR10","doi-asserted-by":"crossref","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 JM (2017) 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","journal-title":"Eur J Oper Res"},{"key":"276_CR11","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1016\/j.cor.2015.02.002","volume":"60","author":"V Fernandez-Viagas","year":"2015","unstructured":"Fernandez-Viagas V, Framinan JM (2015) Neh-based heuristics for the permutation flowshop scheduling problem to minimise total tardiness. Comput Oper Res 60:27\u201336","journal-title":"Comput Oper Res"},{"issue":"3","key":"276_CR12","doi-asserted-by":"crossref","first-page":"858","DOI":"10.1016\/j.ejor.2019.10.017","volume":"282","author":"V Fernandez-Viagas","year":"2020","unstructured":"Fernandez-Viagas V, Molina-Pariente JM, Framinan JM (2020) Generalised accelerations for insertion-based heuristics in permutation flowshop scheduling. Eur J Oper Res 282(3):858\u2013872","journal-title":"Eur J Oper Res"},{"issue":"1","key":"276_CR13","doi-asserted-by":"crossref","first-page":"160","DOI":"10.1016\/0377-2217(95)00037-2","volume":"91","author":"E Nowicki","year":"1996","unstructured":"Nowicki E, Smutnicki C (1996) A fast tabu search algorithm for the permutation flow-shop problem. Eur J Oper Res 91(1):160\u2013175","journal-title":"Eur J Oper Res"},{"issue":"3","key":"276_CR14","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1016\/S0305-0548(98)00060-4","volume":"26","author":"VA Armentano","year":"1999","unstructured":"Armentano VA, Ronconi DP (1999) Tabu search for total tardiness minimization in flowshop scheduling problems. Comput Oper Res 26(3):219\u2013235","journal-title":"Comput Oper Res"},{"issue":"3","key":"276_CR15","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. Eur J Oper Res 177(3):2033\u20132049","journal-title":"Eur J Oper Res"},{"issue":"2","key":"276_CR16","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1016\/0166-218X(93)E0127-K","volume":"58","author":"F Werner","year":"1995","unstructured":"Werner F, Winkler A (1995) Insertion techniques for the heuristic solution of the job shop problem. Discret Appl Math 58(2):191\u2013211","journal-title":"Discret Appl Math"},{"issue":"2","key":"276_CR17","first-page":"101","volume":"18","author":"MR De Paula","year":"2007","unstructured":"De Paula MR, Ravetti MG, Mateus GR, Pardalos PM (2007) Solving parallel machines scheduling problems with sequence-dependent setup times using variable neighbourhood search. IMA J Manag Math 18(2):101\u2013115","journal-title":"IMA J Manag Math"},{"issue":"4","key":"276_CR18","doi-asserted-by":"crossref","first-page":"259","DOI":"10.1080\/01969720902830322","volume":"40","author":"G Zobolas","year":"2009","unstructured":"Zobolas G, Tarantilis CD, Ioannou G (2009) Solving the open shop scheduling problem via a hybrid genetic-variable neighborhood search algorithm. Cybernetics and Systems: An International Journal 40(4):259\u2013285","journal-title":"Cybernetics and Systems: An International Journal"},{"issue":"4","key":"276_CR19","doi-asserted-by":"crossref","first-page":"1111","DOI":"10.1080\/00207543.2014.948578","volume":"53","author":"V Fernandez-Viagas","year":"2015","unstructured":"Fernandez-Viagas V, Framinan JM (2015) A bounded-search iterated greedy algorithm for the distributed permutation flowshop scheduling problem. Int J Prod Res 53(4):1111\u20131123","journal-title":"Int J Prod Res"},{"key":"276_CR20","doi-asserted-by":"crossref","DOI":"10.1016\/j.eswa.2021.116097","volume":"189","author":"BA Prata","year":"2022","unstructured":"Prata BA, Rodrigues CD, Framinan JM (2022) A differential evolution algorithm for the customer order scheduling problem with sequence-dependent setup times. Expert Syst Appl 189:116097","journal-title":"Expert Syst Appl"},{"issue":"5","key":"276_CR21","doi-asserted-by":"crossref","first-page":"955","DOI":"10.1287\/opre.16.5.955","volume":"16","author":"MB Teitz","year":"1968","unstructured":"Teitz MB, Bart P (1968) Heuristic methods for estimating the generalized vertex median of a weighted graph. Oper Res 16(5):955\u2013961","journal-title":"Oper Res"},{"issue":"2","key":"276_CR22","doi-asserted-by":"crossref","first-page":"498","DOI":"10.1287\/opre.21.2.498","volume":"21","author":"S Lin","year":"1973","unstructured":"Lin S, Kernighan BW (1973) An effective heuristic algorithm for the traveling-salesman problem. Oper Res 21(2):498\u2013516","journal-title":"Oper Res"},{"key":"276_CR23","doi-asserted-by":"crossref","first-page":"108161","DOI":"10.1016\/j.cie.2022.108161","volume":"169","author":"AM Dalavi","year":"2022","unstructured":"Dalavi AM, Gomes A, Husain AJ (2022) Bibliometric analysis of nature inspired optimization techniques. Comput Ind Eng 169:108161","journal-title":"Comput Ind Eng"},{"key":"276_CR24","doi-asserted-by":"crossref","first-page":"107255","DOI":"10.1016\/j.cie.2021.107255","volume":"158","author":"M Di Mascolo","year":"2021","unstructured":"Di Mascolo M, Martinez C, Espinouse ML (2021) Routing and scheduling in home health care: a literature survey and bibliometric analysis. Comput Ind Eng 158:107255","journal-title":"Comput Ind Eng"},{"key":"276_CR25","doi-asserted-by":"crossref","first-page":"106182","DOI":"10.1016\/j.cie.2019.106182","volume":"139","author":"M Eghtesadifard","year":"2020","unstructured":"Eghtesadifard M, Khalifeh M, Khorram M (2020) A systematic review of research themes and hot topics in assembly line balancing through the web of science within 1990\u20132017. Comput Ind Eng 139:106182","journal-title":"Comput Ind Eng"},{"key":"276_CR26","doi-asserted-by":"crossref","first-page":"114702","DOI":"10.1016\/j.eswa.2021.114702","volume":"173","author":"Y Riahi","year":"2021","unstructured":"Riahi Y, Saikouk T, Gunasekaran A, Badraoui I (2021) Artificial intelligence applications in supply chain: a descriptive bibliometric analysis and future research directions. Expert Syst Appl 173:114702","journal-title":"Expert Syst Appl"},{"key":"276_CR27","doi-asserted-by":"crossref","first-page":"102295","DOI":"10.1016\/j.omega.2020.102295","volume":"98","author":"X Zhou","year":"2021","unstructured":"Zhou X, Wei X, Lin J, Tian X, Lev B, Wang S (2021) Supply chain management under carbon taxes: a review and bibliometric analysis. Omega 98:102295","journal-title":"Omega"},{"issue":"4","key":"276_CR28","doi-asserted-by":"crossref","first-page":"959","DOI":"10.1016\/j.joi.2017.08.007","volume":"11","author":"M Aria","year":"2017","unstructured":"Aria M, Cuccurullo C (2017) bibliometrix: An r-tool for comprehensive science mapping analysis. J Informet 11(4):959\u2013975","journal-title":"J Informet"},{"key":"276_CR29","first-page":"85","volume":"137","author":"SC Bradford","year":"1934","unstructured":"Bradford SC (1934) Sources of information on specific subjects. Engineering 137:85\u201386","journal-title":"Engineering"},{"key":"276_CR30","first-page":"445","volume":"4","author":"EL Lawler","year":"1993","unstructured":"Lawler EL, Lenstra JK, Kan AHR, Shmoys DB (1993) Sequencing and scheduling: Algorithms and complexity. Handbooks Oper Res Management Sci 4:445\u2013522","journal-title":"Handbooks Oper Res Management Sci"},{"issue":"2","key":"276_CR31","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. Eur J Oper Res 165(2):479\u2013494","journal-title":"Eur J Oper Res"},{"key":"276_CR32","doi-asserted-by":"crossref","unstructured":"Pinedo ML (2012) Scheduling, vol\u00a029. Springer","DOI":"10.1007\/978-1-4614-2361-4"},{"key":"276_CR33","unstructured":"T\u2019kindt V, Billaut JC (2006) Multicriteria scheduling: theory, models and algorithms. Springer Science & Business Media"},{"issue":"1","key":"276_CR34","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1016\/0305-0548(93)E0014-K","volume":"22","author":"CR Reeves","year":"1995","unstructured":"Reeves CR (1995) A genetic algorithm for flowshop sequencing. Comput Oper Res 22(1):5\u201313","journal-title":"Comput Oper Res"},{"issue":"6","key":"276_CR35","doi-asserted-by":"crossref","first-page":"551","DOI":"10.1016\/0305-0483(89)90059-5","volume":"17","author":"IH Osman","year":"1989","unstructured":"Osman IH, Potts C (1989) Simulated annealing for permutation flow-shop scheduling. Omega 17(6):551\u2013557","journal-title":"Omega"},{"issue":"3","key":"276_CR36","doi-asserted-by":"crossref","first-page":"1930","DOI":"10.1016\/j.ejor.2005.12.024","volume":"177","author":"MF Tasgetiren","year":"2007","unstructured":"Tasgetiren MF, Liang YC, Sevkli M, Gencyilmaz G (2007) A particle swarm optimization algorithm for makespan and total flowtime minimization in the permutation flowshop sequencing problem. Eur J Oper Res 177(3):1930\u20131947","journal-title":"Eur J Oper Res"},{"key":"276_CR37","unstructured":"He Q (1999) Knowledge discovery through co-word analysis. Graduate School of Library and Information Science. University of Illinois .."},{"issue":"1","key":"276_CR38","doi-asserted-by":"crossref","first-page":"146","DOI":"10.1016\/j.joi.2010.10.002","volume":"5","author":"MJ Cobo","year":"2011","unstructured":"Cobo MJ, L\u00f3pez-Herrera AG, Herrera-Viedma E, Herrera F (2011) An approach for detecting, quantifying, and visualizing the evolution of a research field: A practical application to the fuzzy sets theory field. J Informet 5(1):146\u2013166","journal-title":"J Informet"},{"issue":"2","key":"276_CR39","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. Eur J Oper Res 64(2):278\u2013285","journal-title":"Eur J Oper Res"},{"issue":"4598","key":"276_CR40","doi-asserted-by":"crossref","first-page":"671","DOI":"10.1126\/science.220.4598.671","volume":"220","author":"S Kirkpatrick","year":"1983","unstructured":"Kirkpatrick S, Gelatt CD Jr, Vecchi MP (1983) Optimization by simulated annealing. Science 220(4598):671\u2013680","journal-title":"Science"},{"key":"276_CR41","doi-asserted-by":"crossref","DOI":"10.1016\/j.cie.2020.106803","volume":"149","author":"GA Rolim","year":"2020","unstructured":"Rolim GA, Nagano MS (2020) Structural properties and algorithms for earliness and tardiness scheduling against common due dates and windows: A review. Comput Ind Eng 149:106803","journal-title":"Comput Ind Eng"},{"key":"276_CR42","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1016\/j.omega.2017.05.010","volume":"77","author":"DA Rossit","year":"2018","unstructured":"Rossit DA, Tohm\u00e9 F, Frutos M (2018) The non-permutation flow-shop scheduling problem: a literature review. Omega 77:143\u2013153","journal-title":"Omega"},{"key":"276_CR43","doi-asserted-by":"crossref","first-page":"126","DOI":"10.1016\/j.tcs.2015.02.020","volume":"579","author":"E Bampis","year":"2015","unstructured":"Bampis E, Letsios D, Lucarelli G (2015) Green scheduling, flows and matchings. Theoret Comput Sci 579:126\u2013136","journal-title":"Theoret Comput Sci"},{"issue":"3","key":"276_CR44","doi-asserted-by":"crossref","first-page":"744","DOI":"10.1016\/j.ejor.2015.07.017","volume":"248","author":"C Gahm","year":"2016","unstructured":"Gahm C, Denz F, Dirr M, Tuma A (2016) Energy-efficient scheduling in manufacturing companies: A review and research framework. Eur J Oper Res 248(3):744\u2013757","journal-title":"Eur J Oper Res"},{"issue":"13","key":"276_CR45","doi-asserted-by":"crossref","first-page":"1643","DOI":"10.1016\/j.dam.2007.02.003","volume":"155","author":"D Shabtay","year":"2007","unstructured":"Shabtay D, Steiner G (2007) A survey of scheduling with controllable processing times. Discret Appl Math 155(13):1643\u20131666","journal-title":"Discret Appl Math"},{"key":"276_CR46","doi-asserted-by":"crossref","unstructured":"Fernandez-Viagas V, Framinan JM (2015) Controllable processing times in project and production management: analysing the trade-off between processing times and the amount of resources. Math Probl Eng 2015","DOI":"10.1155\/2015\/826318"},{"issue":"4","key":"276_CR47","doi-asserted-by":"crossref","first-page":"1002","DOI":"10.1080\/00207543.2014.932935","volume":"53","author":"J Ding","year":"2015","unstructured":"Ding J, Song S, Zhang R, Gupta JN, Wu C (2015) Accelerated methods for total tardiness minimisation in no-wait flowshops. Int J Prod Res 53(4):1002\u20131018","journal-title":"Int J Prod Res"}],"container-title":["Operations Research Forum"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s43069-023-00276-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s43069-023-00276-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s43069-023-00276-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,2,2]],"date-time":"2024-02-02T17:03:06Z","timestamp":1706893386000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s43069-023-00276-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,12,6]]},"references-count":47,"journal-issue":{"issue":"4","published-online":{"date-parts":[[2023,12]]}},"alternative-id":["276"],"URL":"https:\/\/doi.org\/10.1007\/s43069-023-00276-7","relation":{},"ISSN":["2662-2556"],"issn-type":[{"value":"2662-2556","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,12,6]]},"assertion":[{"value":"17 October 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 November 2023","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"6 December 2023","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"Not applicable.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethics Approval"}},{"value":"Not applicable.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Consent to Participate"}},{"value":"Not applicable.","order":4,"name":"Ethics","group":{"name":"EthicsHeading","label":"Consent for Publication"}},{"value":"The authors declare no competing interests.","order":5,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing Interests"}}],"article-number":"98"}}