{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,25]],"date-time":"2026-02-25T15:24:15Z","timestamp":1772033055999,"version":"3.50.1"},"publisher-location":"Cham","reference-count":28,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031206108","type":"print"},{"value":"9783031206115","type":"electronic"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-031-20611-5_17","type":"book-chapter","created":{"date-parts":[[2022,11,23]],"date-time":"2022-11-23T00:14:47Z","timestamp":1669162487000},"page":"198-209","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["A Hybrid Algorithm Based on\u00a0Ant Colony System for\u00a0Flexible Job Shop"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-5874-3091","authenticated-orcid":false,"given":"William","family":"Torres-Tapia","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6251-3667","authenticated-orcid":false,"given":"Jairo R.","family":"Montoya-Torres","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9155-5612","authenticated-orcid":false,"given":"Jos\u00e9","family":"Ruiz-Meza","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,11,23]]},"reference":[{"key":"17_CR1","doi-asserted-by":"publisher","first-page":"9270802","DOI":"10.1155\/2018\/9270802","volume":"2018","author":"MK Amjad","year":"2018","unstructured":"Amjad, M.K., et al.: Recent Research Trends in Genetic Algorithm Based Flexible Job Shop Scheduling Problems. Math. Probl. Eng. 2018, 9270802 (2018)","journal-title":"Math. Probl. Eng."},{"issue":"3","key":"17_CR2","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. 41(3), 157\u2013183 (1993)","journal-title":"Ann. Oper. Res."},{"issue":"4","key":"17_CR3","doi-asserted-by":"publisher","first-page":"369","DOI":"10.1007\/BF02238804","volume":"45","author":"P Brucker","year":"1990","unstructured":"Brucker, P., Schlie, R.: Job-shop scheduling with multi-purpose machines. Computing 45(4), 369\u2013375 (1990)","journal-title":"Computing"},{"key":"17_CR4","doi-asserted-by":"crossref","unstructured":"Dauz\u00e8re-P\u00e9r\u00e8s, S., Paulli, J.: An integrated approach for modeling and solving the general multiprocessor job-shop scheduling problem using tabu search. Anna. Operat. Res. 70, 281\u2013306 (1997)","DOI":"10.1023\/A:1018930406487"},{"issue":"3","key":"17_CR5","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1007\/BF02023076","volume":"41","author":"M Dell\u2019Amico","year":"1993","unstructured":"Dell\u2019Amico, M., Trubian, M.: Applying tabu search to the job-shop scheduling problem. Ann. Oper. Res. 41(3), 231\u2013252 (1993)","journal-title":"Ann. Oper. Res."},{"key":"17_CR6","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2020.104951","volume":"121","author":"H Ding","year":"2020","unstructured":"Ding, H., Gu, X.: Improved particle swarm optimization algorithm based novel encoding and decoding schemes for flexible job shop scheduling problem. Comput. Operat. Res. 121, 104951 (2020)","journal-title":"Comput. Operat. Res."},{"key":"17_CR7","doi-asserted-by":"publisher","unstructured":"Duarte, A., S\u00e1nchez-Oro, J., Mladenovi\u0107, N., Todosijevi\u0107, R.: Variable neighborhood descent, pp. 341\u2013367. Springer International Publishing, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-07153-4_9-1","DOI":"10.1007\/978-3-319-07153-4_9-1"},{"key":"17_CR8","series-title":"Communications in Computer and Information Science","doi-asserted-by":"publisher","first-page":"208","DOI":"10.1007\/978-3-030-61834-6_18","volume-title":"Applied Computer Sciences in Engineering","author":"AA Garc\u00eda-Le\u00f3n","year":"2020","unstructured":"Garc\u00eda-Le\u00f3n, A.A., Torres Tapia, W.F.: A hybrid algorithm to minimize regular criteria in the job-shop scheduling problem with maintenance activities, sequence dependent and set-up times. In: Figueroa-Garc\u00eda, J.C., Garay-Rair\u00e1n, F.S., Hern\u00e1ndez-P\u00e9rez, G.J., D\u00edaz-Gutierrez, Y. (eds.) WEA 2020. CCIS, vol. 1274, pp. 208\u2013221. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-61834-6_18"},{"key":"17_CR9","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1016\/j.cor.2019.04.012","volume":"108","author":"AA Garc\u00eda-Le\u00f3n","year":"2019","unstructured":"Garc\u00eda-Le\u00f3n, A.A., Dauz\u00e8re-P\u00e9r\u00e8s, S., Mati, Y.: An efficient Pareto approach for solving the multi-objective flexible job-shop scheduling problem with regular criteria. Comput. Oper. Res. 108, 187\u2013200 (2019)","journal-title":"Comput. Oper. Res."},{"key":"17_CR10","doi-asserted-by":"publisher","first-page":"764","DOI":"10.1007\/978-3-030-31019-6_64","volume-title":"Applied Computer Sciences in Engineering","author":"AA Garc\u00eda-Le\u00f3n","year":"2019","unstructured":"Garc\u00eda-Le\u00f3n, A.A., Torres Tapia, W.F.: A general local search pareto approach with regular criteria for solving the job-shop scheduling problem multi-resource resource flexibility with linear routes. In: Figueroa-Garc\u00eda, J.C., Duarte-Gonz\u00e1lez, M., Jaramillo-Isaza, S., Orjuela-Ca\u00f1on, A.D., D\u00edaz-Gutierrez, Y. (eds.) Applied Computer Sciences in Engineering, pp. 764\u2013775. Springer International Publishing, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-31019-6_64"},{"issue":"2","key":"17_CR11","doi-asserted-by":"publisher","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.: The complexity of flowshop and jobshop scheduling. Math. Oper. Res. 1(2), 117\u2013129 (1976)","journal-title":"Math. Oper. Res."},{"issue":"1","key":"17_CR12","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1016\/j.ejor.2015.02.052","volume":"245","author":"M Gonz\u00e1lez","year":"2015","unstructured":"Gonz\u00e1lez, M., Vela, C., Varela, R.: Scatter search with path relinking for the flexible job shop scheduling problem. Eur. J. Oper. Res. 245(1), 35\u201345 (2015)","journal-title":"Eur. J. Oper. Res."},{"issue":"4","key":"17_CR13","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1007\/BF01719451","volume":"15","author":"J Hurink","year":"1994","unstructured":"Hurink, J., Jurisch, B., Thole, M.: Tabu search for the job-shop scheduling problem with multi-purpose machines. OR Spektrum 15(4), 205\u2013215 (1994)","journal-title":"OR Spektrum"},{"key":"17_CR14","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1016\/j.eswa.2015.09.050","volume":"45","author":"V Kaplano\u011flu","year":"2016","unstructured":"Kaplano\u011flu, V.: An object-oriented approach for multi-objective flexible job-shop scheduling problem. Expert Syst. Appl. 45, 71\u201384 (2016)","journal-title":"Expert Syst. Appl."},{"key":"17_CR15","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1016\/j.ijpe.2016.01.016","volume":"174","author":"X Li","year":"2016","unstructured":"Li, X., Gao, L.: An effective hybrid genetic algorithm and tabu search for flexible job shop scheduling problem. Int. J. Prod. Econ. 174, 93\u2013110 (2016)","journal-title":"Int. J. Prod. Econ."},{"issue":"1","key":"17_CR16","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1002\/(SICI)1099-1425(200001\/02)3:1<3::AID-JOS32>3.0.CO;2-Y","volume":"3","author":"M Mastrolilli","year":"2000","unstructured":"Mastrolilli, M., Gambardella, L.M.: Effective neighbourhood functions for the flexible job shop problem. J. Sched. 3(1), 3\u201320 (2000)","journal-title":"J. Sched."},{"key":"17_CR17","doi-asserted-by":"publisher","first-page":"387","DOI":"10.1007\/978-981-16-2794-1_35","volume-title":"Advances in Mechanical and Materials Technology","author":"S Nayak","year":"2022","unstructured":"Nayak, S., Sood, A.K., Pandey, A.: Integrated approach for flexible job shop scheduling using multi-objective genetic algorithm. In: Govindan, K., Kumar, H., Yadav, S. (eds.) Advances in Mechanical and Materials Technology, pp. 387\u2013395. Springer, Singapore (2022). https:\/\/doi.org\/10.1007\/978-981-16-2794-1_35"},{"issue":"1","key":"17_CR18","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1016\/0377-2217(95)00059-Y","volume":"86","author":"J Paulli","year":"1995","unstructured":"Paulli, J.: A hierarchical approach for the fms scheduling problem. Eur. J. Oper. Res. 86(1), 32\u201342 (1995)","journal-title":"Eur. J. Oper. Res."},{"issue":"10","key":"17_CR19","doi-asserted-by":"publisher","first-page":"3202","DOI":"10.1016\/j.cor.2007.02.014","volume":"35","author":"F Pezzella","year":"2008","unstructured":"Pezzella, F., Morganti, G., Ciaschetti, G.: A genetic algorithm for the flexible job-shop scheduling problem. Comput. Operat. Res. 35(10), 3202\u20133212 (2008)","journal-title":"Comput. Operat. Res."},{"issue":"20","key":"17_CR20","doi-asserted-by":"publisher","first-page":"6247","DOI":"10.1080\/00207543.2013.827806","volume":"51","author":"V Roshanaei","year":"2013","unstructured":"Roshanaei, V., Azab, A., ElMaraghy, H.: Mathematical modelling and a meta-heuristic for flexible job shop scheduling. Int. J. Prod. Res. 51(20), 6247\u20136274 (2013)","journal-title":"Int. J. Prod. Res."},{"issue":"1","key":"17_CR21","doi-asserted-by":"publisher","first-page":"10","DOI":"10.1287\/opre.7.1.10","volume":"7","author":"RL Sisson","year":"1959","unstructured":"Sisson, R.L.: Methods of sequencing in job shops-a review. Oper. Res. 7(1), 10\u201329 (1959)","journal-title":"Oper. Res."},{"key":"17_CR22","doi-asserted-by":"publisher","unstructured":"St\u00fctzle, T., Hoos, H.: Improvements on the ant-system: Introducing the max-min ant system. In: Artificial Neural Nets and Genetic Algorithms, pp. 245\u2013249. Springer, Vienna (1998). https:\/\/doi.org\/10.1007\/978-3-7091-6492-1_54","DOI":"10.1007\/978-3-7091-6492-1_54"},{"key":"17_CR23","doi-asserted-by":"crossref","unstructured":"Taillard, D.: Parallel taboo search techniques for the job shop scheduling problem. ORSA J. Comput. 6(2), 108\u2013117 (1994)","DOI":"10.1287\/ijoc.6.2.108"},{"key":"17_CR24","doi-asserted-by":"crossref","unstructured":"Torres-Tapia, W., Montoya-Torres, J.R., Ruiz-Meza, J., Belmokhtar-Berraf, S.: A Matheuristic based on ant colony system for the combined flexible jobshop scheduling and vehicle routing problem. In: 10th IFAC Conference on Manufacturing Modelling, Management and Control. Elsevier, Nantes, France (2022)","DOI":"10.1016\/j.ifacol.2022.09.621"},{"key":"17_CR25","first-page":"9016303","volume":"2017","author":"L Wang","year":"2017","unstructured":"Wang, L., Cai, J., Li, M., Liu, Z.: Flexible job shop scheduling problem using an improved ant colony optimization. Sci. Program. 2017, 9016303 (2017)","journal-title":"Sci. Program."},{"issue":"2","key":"17_CR26","doi-asserted-by":"publisher","first-page":"409","DOI":"10.1016\/j.cie.2005.01.018","volume":"48","author":"W Xia","year":"2005","unstructured":"Xia, W., Wu, Z.: An effective hybrid optimization approach for multi-objective flexible job-shop scheduling problems. Comput. Ind. Eng. 48(2), 409\u2013425 (2005)","journal-title":"Comput. Ind. Eng."},{"issue":"3","key":"17_CR27","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1049\/iet-cim.2018.0009","volume":"1","author":"J Xie","year":"2019","unstructured":"Xie, J., Gao, L., Peng, K., Li, X., Li, H.: Review on flexible job shop scheduling. IET Collaborative Intell. Manuf. 1(3), 67\u201377 (2019)","journal-title":"IET Collaborative Intell. Manuf."},{"key":"17_CR28","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2022.105731","volume":"142","author":"H Xiong","year":"2022","unstructured":"Xiong, H., Shi, S., Ren, D., Hu, J.: A survey of job shop scheduling problem: The types and models. Comput. Oper. Res. 142, 105731 (2022)","journal-title":"Comput. Oper. Res."}],"container-title":["Communications in Computer and Information Science","Applied Computer Sciences in Engineering"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-20611-5_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,12,20]],"date-time":"2022-12-20T20:11:38Z","timestamp":1671567098000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-20611-5_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031206108","9783031206115"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-20611-5_17","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"value":"1865-0929","type":"print"},{"value":"1865-0937","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"23 November 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WEA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Workshop on Engineering Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Bogot\u00e1","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Colombia","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30 November 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2 December 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"woea2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/ieee.udistrital.edu.co\/wea2022","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Easy Chair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"143","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"39","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"27% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2.83","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2.73","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}