{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,9]],"date-time":"2026-06-09T07:39:19Z","timestamp":1780990759995,"version":"3.54.1"},"reference-count":14,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2020,3,1]],"date-time":"2020-03-01T00:00:00Z","timestamp":1583020800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2020,3,1]],"date-time":"2020-03-01T00:00:00Z","timestamp":1583020800000},"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":["SN COMPUT. SCI."],"published-print":{"date-parts":[[2020,3]]},"DOI":"10.1007\/s42979-020-0084-y","type":"journal-article","created":{"date-parts":[[2020,3,14]],"date-time":"2020-03-14T02:03:06Z","timestamp":1584151386000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Integrated Search Method for Flexible Job Shop Scheduling Problem Using HHS\u2013ALNS Algorithm"],"prefix":"10.1007","volume":"1","author":[{"given":"C.","family":"Anand Deva Durai","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"M.","family":"Azath","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"J. S. C.","family":"Jeniffer","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2020,3,14]]},"reference":[{"key":"84_CR1","doi-asserted-by":"publisher","first-page":"3076","DOI":"10.1016\/j.apm.2008.10.029","volume":"33","author":"P Fattahi","year":"2009","unstructured":"Fattahi P, Jolai F, Arkat J. Flexible job shop scheduling with overlapping-in operations. Appl Math Modell. 2009;33:3076\u201387.","journal-title":"Appl Math Modell"},{"key":"84_CR2","unstructured":"Yuan Y, Xu H. HHS\/LNS: an integrated search method for flexible job shop scheduling. In: IEEE congress on evolutionary computation. 2012."},{"key":"84_CR3","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1007\/s10951-005-6364-5","volume":"8","author":"E Nowicki","year":"2005","unstructured":"Nowicki E, Smutnicki C. An advanced tabu search algorithm for job shop problem. J Sched. 2005;8:145\u201359.","journal-title":"J Sched"},{"key":"84_CR4","doi-asserted-by":"publisher","first-page":"1030","DOI":"10.1016\/j.cor.2006.07.003","volume":"35","author":"KL Huang","year":"2008","unstructured":"Huang KL, Liao CJ. Ant colony optimization combined with taboo search for the job shop scheduling problem. Comput Oper Res. 2008;35:1030\u201346.","journal-title":"Comput Oper Res"},{"key":"84_CR5","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1007\/BF02023073","volume":"41","author":"P Brandimarte","year":"1993","unstructured":"Brandimarte P. Routing and scheduling in a flexible job shop by tabu search. Ann Oper Res. 1993;41:157\u201383.","journal-title":"Ann Oper Res"},{"key":"84_CR6","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1007\/s00170-011-3610-1","volume":"60","author":"L Wang","year":"2012","unstructured":"Wang L, Zhou G, Xu Y, Wang S, Liu M. An effective artificial bee colony algorithm for the flexible job-shop scheduling problem. Int J Adv Manuf Technol. 2012;60:303\u201315.","journal-title":"Int J Adv Manuf Technol"},{"key":"84_CR7","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1177\/003754970107600201","volume":"76","author":"Z Geem","year":"2001","unstructured":"Geem Z, Kim J, Loganathan G. A new heuristic optimization algorithm: harmony search. Simulation. 2001;76:60.","journal-title":"Simulation"},{"key":"84_CR8","doi-asserted-by":"publisher","first-page":"597","DOI":"10.1016\/S0360-8352(03)00077-9","volume":"45","author":"BJ Park","year":"2003","unstructured":"Park BJ, Choi HR, Kim HS. A hybrid genetic algorithm for the job shop scheduling problems. Comput Ind Eng. 2003;45:597\u2013613.","journal-title":"Comput Ind Eng"},{"issue":"9","key":"84_CR9","first-page":"713","volume":"3","author":"HR Mollaei","year":"2013","unstructured":"Mollaei HR, Zeynali S, Pour NS. Solving the multi objective flexible job shop problem using combinational meta heuristic algorithm based on genetic algorithm and tabu-search. J Basic Appl Sci Res. 2013;3(9):713\u201320.","journal-title":"J Basic Appl Sci Res"},{"key":"84_CR10","doi-asserted-by":"publisher","first-page":"2892","DOI":"10.1016\/j.cor.2007.01.001","volume":"35","author":"J Gao","year":"2008","unstructured":"Gao J, Sun L, Gen M. A hybrid genetic and variable neighborhood descent algorithm for flexible job shop scheduling problems. Comput Oper Res. 2008;35:2892\u2013907.","journal-title":"Comput Oper Res"},{"key":"84_CR11","doi-asserted-by":"publisher","first-page":"2192","DOI":"10.1016\/j.cor.2010.03.009","volume":"37","author":"AB Hmida","year":"2010","unstructured":"Hmida AB, Haouari M, Huguet MJ, Lopez P. Discrepancy search for the flexible job shop scheduling problem. Comput Oper Res. 2010;37:2192\u2013201.","journal-title":"Comput Oper Res"},{"key":"84_CR12","unstructured":"Oddi A, Rasconi R, Cesta A, Smith SF. Iterative flattening search for the flexible job shop scheduling problem. In: Proceedings of the 22nd international joint conference on artificial intelligence, vol 3, July 2011, pp. 1991\u20131996"},{"key":"84_CR13","doi-asserted-by":"publisher","first-page":"455","DOI":"10.1287\/trsc.1050.0135","volume":"40","author":"S R\u00f8pke","year":"2006","unstructured":"R\u00f8pke S, Pisinger D. An adaptive large neighborhood search heuristic for the pickup and delivery problem with time windows. Transp Sci. 2006;40:455\u201372. https:\/\/doi.org\/10.1287\/trsc.1050.0135.","journal-title":"Transp Sci"},{"key":"84_CR14","first-page":"39","volume":"34","author":"A Coroni","year":"1994","unstructured":"Coroni A, Dorigo M, Maniezzo V. Ant system for job shop scheduling. Belgian J Oper Res Stat Comput Sci. 1994;34:39\u201353.","journal-title":"Belgian J Oper Res Stat Comput Sci"}],"updated-by":[{"DOI":"10.1007\/s42979-023-02168-3","type":"correction","label":"Correction","source":"publisher","updated":{"date-parts":[[2023,9,28]],"date-time":"2023-09-28T00:00:00Z","timestamp":1695859200000}}],"container-title":["SN Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s42979-020-0084-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s42979-020-0084-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s42979-020-0084-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,9,28]],"date-time":"2023-09-28T09:21:01Z","timestamp":1695892861000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s42979-020-0084-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,3]]},"references-count":14,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2020,3]]}},"alternative-id":["84"],"URL":"https:\/\/doi.org\/10.1007\/s42979-020-0084-y","relation":{"correction":[{"id-type":"doi","id":"10.1007\/s42979-023-02168-3","asserted-by":"object"}]},"ISSN":["2662-995X","2661-8907"],"issn-type":[{"value":"2662-995X","type":"print"},{"value":"2661-8907","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,3]]},"assertion":[{"value":"14 March 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"28 September 2023","order":2,"name":"change_date","label":"Change Date","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"Correction","order":3,"name":"change_type","label":"Change Type","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"A Correction to this paper has been published:","order":4,"name":"change_details","label":"Change Details","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"https:\/\/doi.org\/10.1007\/s42979-023-02168-3","URL":"https:\/\/doi.org\/10.1007\/s42979-023-02168-3","order":5,"name":"change_details","label":"Change Details","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"83"}}