{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,3]],"date-time":"2025-11-03T13:46:35Z","timestamp":1762177595202,"version":"3.37.3"},"reference-count":26,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2023,8,5]],"date-time":"2023-08-05T00:00:00Z","timestamp":1691193600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2023,8,5]],"date-time":"2023-08-05T00:00:00Z","timestamp":1691193600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/100011941","name":"Gobierno del Principado de Asturias","doi-asserted-by":"publisher","award":["Severo Ochoa"],"award-info":[{"award-number":["Severo Ochoa"]}],"id":[{"id":"10.13039\/100011941","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100014440","name":"Ministerio de Ciencia, Innovaci\u00f3n y Universidades","doi-asserted-by":"publisher","award":["PID2019-106263RB-I00","PID2019-106263RB-I00","PID2019-106263RB-I00","PID2019-106263RB-I00"],"award-info":[{"award-number":["PID2019-106263RB-I00","PID2019-106263RB-I00","PID2019-106263RB-I00","PID2019-106263RB-I00"]}],"id":[{"id":"10.13039\/100014440","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100006382","name":"Universidad de Oviedo","doi-asserted-by":"crossref","id":[{"id":"10.13039\/501100006382","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Nat Comput"],"published-print":{"date-parts":[[2023,12]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>This paper addresses a variant of the Job Shop Scheduling Problem with makespan minimisation where uncertainty in task durations is taken into account and modelled with intervals. A novel Artificial Bee Colony algorithm is proposed where the classical layout is simplified, increasing the algorithm\u2019s speed and reducing the number of parameters to set up. We also take into account the fundamental principles of exploration around a local solution and attraction to a global solution to improve diversity in the hive. The increase on speed and diversity allows to include a Local Search phase to better exploit promising areas of the search space. A parametric analysis is conducted and the contribution of the new strategies is analysed. The results of the new approach are competitive with those obtained with previous methods in the literature, but taking less runtime. The addition of Local Search improves the results even further, outperforming the best-known ones from the literature. An additional sensitivity study is conducted to assess the advantages of considering uncertainty and how increasing it affects the solution\u2019s robustness.<\/jats:p>","DOI":"10.1007\/s11047-023-09953-2","type":"journal-article","created":{"date-parts":[[2023,8,5]],"date-time":"2023-08-05T05:01:43Z","timestamp":1691211703000},"page":"645-657","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Fast elitist ABC for makespan optimisation in interval JSP"],"prefix":"10.1007","volume":"22","author":[{"given":"Hern\u00e1n","family":"D\u00edaz","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Juan Jos\u00e9","family":"Palacios","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"In\u00e9s","family":"Gonz\u00e1lez-Rodr\u00edguez","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Camino R.","family":"Vela","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,8,5]]},"reference":[{"key":"9953_CR1","doi-asserted-by":"publisher","first-page":"200","DOI":"10.1016\/j.cor.2014.06.003","volume":"51","author":"A Allahverdi","year":"2014","unstructured":"Allahverdi A, Aydilek H, Aydilek A (2014) Single machine scheduling problem with interval processing times to minimize mean weighted completion time. Comput Oper Res 51:200\u2013207. https:\/\/doi.org\/10.1016\/j.cor.2014.06.003","journal-title":"Comput Oper Res"},{"issue":"3","key":"9953_CR2","doi-asserted-by":"publisher","first-page":"583","DOI":"10.1016\/j.engappai.2011.08.003","volume":"25","author":"A Banharnsakun","year":"2012","unstructured":"Banharnsakun A, Sirinaovakul B, Achalakul T (2012) Job shop scheduling with the best-so-far ABC. Eng Appl Artif Intell 25(3):583\u2013593. https:\/\/doi.org\/10.1016\/j.engappai.2011.08.003","journal-title":"Eng Appl Artif Intell"},{"key":"9953_CR3","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1007\/s10951-008-0080-x","volume":"12","author":"J Bidot","year":"2009","unstructured":"Bidot J, Vidal T, Laboire P (2009) A theoretic and practical framework for scheduling in stochastic environment. J Sched 12:315\u2013344","journal-title":"J Sched"},{"key":"9953_CR4","doi-asserted-by":"crossref","unstructured":"Bierwirth C, Mattfeld DC, Kopfer H (1996) On permutation representations for scheduling problems. In: PPSN IV: Proceedings of the 4th international conference on parallel problem solving from nature, pp 310\u2013318. Springer London, UK","DOI":"10.1007\/3-540-61723-X_995"},{"key":"9953_CR5","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1007\/BF01719250","volume":"17","author":"C Bierwirth","year":"1995","unstructured":"Bierwirth C (1995) A generalized permutation approach to jobshop scheduling with genetic algorithms. OR Spectrum 17:87\u201392","journal-title":"OR Spectrum"},{"key":"9953_CR6","doi-asserted-by":"publisher","unstructured":"D\u00edaz H, Gonz\u00e1lez-Rodr\u00edguez I, Palacios JJ, D\u00edaz I, Vela CR (2020) A genetic approach to the job shop scheduling problem with interval uncertainty. In: Lesot M-J, Vieira S., Reformat MZ, Carvalho JP, Wilbik A, Bouchon-Meunier B, Yager RR (eds.) Information processing and management of uncertainty in knowledge-based systems, pp 663\u2013676. Springer. https:\/\/doi.org\/10.1007\/978-3-030-50143-3_52","DOI":"10.1007\/978-3-030-50143-3_52"},{"key":"9953_CR7","doi-asserted-by":"publisher","unstructured":"D\u00edaz H, Palacios JJ, Gonz\u00e1lez-Rodr\u00edguez I, Vela CR (2023) An elitist seasonal artificial bee colony algorithm for the interval job shop. Integrated Comput-Aid Eng 1\u201320. https:\/\/doi.org\/10.3233\/ICA-230705","DOI":"10.3233\/ICA-230705"},{"key":"9953_CR8","doi-asserted-by":"publisher","unstructured":"D\u00edaz H, Palacios JJ, Gonz\u00e1lez-Rodr\u00edguez I, Vela CR (2022) Elite artificial bee colony for makespan optimisation in job shop with interval uncertainty. In: Ferr\u00e1ndez\u00a0Vicente, J.M., \u00c1lvarez-S\u00e1nchez, J.R., Paz\u00a0L\u00f3pez, F., Adeli, H. (eds.) Bio-inspired Systems and Applications: from Robotics to Ambient Intelligence, pp. 98\u2013108. Springer. https:\/\/doi.org\/10.1007\/978-3-031-06527-9_10","DOI":"10.1007\/978-3-031-06527-9_10"},{"key":"9953_CR9","doi-asserted-by":"publisher","DOI":"10.1093\/jigpal\/jzac016","author":"H D\u00edaz","year":"2022","unstructured":"D\u00edaz H, Palacios JJ, D\u00edaz I, Vela CR, Gonz\u00e1lez-Rodr\u00edguez I (2022) Robust schedules for tardiness optimization in job shop with interval uncertainty. Logic J IGPL. https:\/\/doi.org\/10.1093\/jigpal\/jzac016","journal-title":"Logic J IGPL"},{"key":"9953_CR10","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1016\/0165-0114(95)00273-1","volume":"82","author":"P Fortemps","year":"1996","unstructured":"Fortemps P, Roubens M (1996) Ranking and defuzzification methods based on area compensation. Fuzzy Sets Syst 82:319\u2013330","journal-title":"Fuzzy Sets Syst"},{"issue":"10","key":"9953_CR11","doi-asserted-by":"publisher","first-page":"2572","DOI":"10.3390\/en11102752","volume":"11","author":"J Garc\u00eda-\u00c1lvarez","year":"2018","unstructured":"Garc\u00eda-\u00c1lvarez J, Gonz\u00e1lez MA, Vela CR, Varela R (2018) Electric vehicle charging scheduling by an enhanced artificial bee colony algorithm. Energies 11(10):2572. https:\/\/doi.org\/10.3390\/en11102752","journal-title":"Energies"},{"key":"9953_CR12","unstructured":"Gonz\u00e1lez\u00a0Rodr\u00edguez I, Vela CR, Puente J, Varela R (2008) A new local search for the job shop problem with uncertain durations. In: Proceedings of the eighteenth international conference on automated planning and scheduling (ICAPS-2008), pp 124\u2013131. AAAI Press Sidney (2008)"},{"key":"9953_CR13","unstructured":"Karaboga D (2005) An idea based on honey bee swarm for numerical optimization, technical report - tr06. Technical Report, Erciyes University"},{"issue":"1","key":"9953_CR14","doi-asserted-by":"publisher","first-page":"108","DOI":"10.1016\/j.amc.2009.03.090","volume":"214","author":"D Karaboga","year":"2009","unstructured":"Karaboga D, Akay B (2009) A comparative study of artificial bee colony algorithm. Appl Math Comput 214(1):108\u2013132. https:\/\/doi.org\/10.1016\/j.amc.2009.03.090","journal-title":"Appl Math Comput"},{"key":"9953_CR15","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1007\/s10462-012-9328-0","volume":"42","author":"D Karaboga","year":"2014","unstructured":"Karaboga D, Gorkemli B, Ozturk C, Karaboga N (2014) A comprehensive survey: artificial bee colony (ABC) algorithm and applications. Artif Intell Rev 42:21\u201357. https:\/\/doi.org\/10.1007\/s10462-012-9328-0","journal-title":"Artif Intell Rev"},{"key":"9953_CR16","doi-asserted-by":"crossref","unstructured":"Kennedy J, Eberhart R (1995) Particle swarm optimization. In: IEEE international conference on neural networks, pp 1942\u20131948. IEEE Press. New Jersey","DOI":"10.1109\/ICNN.1995.488968"},{"key":"9953_CR17","doi-asserted-by":"publisher","first-page":"1200","DOI":"10.1016\/j.cie.2011.07.010","volume":"61","author":"D Lei","year":"2011","unstructured":"Lei D (2011) Population-based neighborhood search for job shop scheduling with interval processing time. Comput Ind Eng 61:1200\u20131208. https:\/\/doi.org\/10.1016\/j.cie.2011.07.010","journal-title":"Comput Ind Eng"},{"key":"9953_CR18","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1007\/s00170-011-3600-3","volume":"60","author":"D Lei","year":"2012","unstructured":"Lei D (2012) Interval job shop scheduling problems. Int J Adv Manuf Technol 60:291\u2013301. https:\/\/doi.org\/10.1007\/s00170-011-3600-3","journal-title":"Int J Adv Manuf Technol"},{"key":"9953_CR19","doi-asserted-by":"publisher","first-page":"1036","DOI":"10.1016\/j.cie.2019.04.028","volume":"235","author":"X Li","year":"2019","unstructured":"Li X, Gao L, Wang W, Wang C, Wen L (2019) Particle swarm optimization hybridized with genetic algorithm for uncertain integrated process planning and scheduling with interval processing time. Comput Ind Eng 235:1036\u20131046","journal-title":"Comput Ind Eng"},{"key":"9953_CR20","doi-asserted-by":"crossref","unstructured":"Ono I, Yamamura M, Kobayashi S (1996) A genetic algorithm for job-shop scheduling problems using job-based order crossover. In: Proceedings of IEEE international conference on evolutionary computation, pp 547\u2013552. IEEE","DOI":"10.1109\/ICEC.1996.542658"},{"key":"9953_CR21","doi-asserted-by":"publisher","unstructured":"Palacios JJ, Vela CR, Gonz\u00e1lez-Rodr\u00edguez I, Puente J (2014) Schedule generation schemes for job shop problems with fuzziness. In: Schaub T, Friedrich G, O\u2019Sullivan B (eds.) Proceedings of ECAI 2014. Frontiers in Artificial Intelligence and Applications, vol. 263, pp 687\u2013692. IOS Press. https:\/\/doi.org\/10.3233\/978-1-61499-419-0-687","DOI":"10.3233\/978-1-61499-419-0-687"},{"key":"9953_CR22","volume-title":"Scheduling. Theory, algorithms, and systems","author":"ML Pinedo","year":"2016","unstructured":"Pinedo ML (2016) Scheduling. Theory, algorithms, and systems, 5th edn. Springer, Cham","edition":"5"},{"key":"9953_CR23","doi-asserted-by":"publisher","first-page":"94","DOI":"10.1016\/0377-2217(93)E0294-8","volume":"80","author":"A Sprecher","year":"1995","unstructured":"Sprecher A, Kolisch R, Drexl A (1995) Semi-active, active, and non-delay schedules for the resource-constrained project scheduling problem. Eur J Oper Res 80:94\u2013102","journal-title":"Eur J Oper Res"},{"key":"9953_CR24","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1287\/opre.40.1.113","volume":"40","author":"P Van Laarhoven","year":"1992","unstructured":"Van Laarhoven P, Aarts E, Lenstra K (1992) Job shop scheduling by simulated annealing. Oper Res 40:113\u2013125","journal-title":"Oper Res"},{"key":"9953_CR25","doi-asserted-by":"publisher","unstructured":"Wong L-P, Puan CY, Low MYH, Chong CS (2008) Bee colony optimization algorithm with big valley landscape exploitation for job shop scheduling problems. In: 2008 Winter simulation conference, pp 2050\u20132058. https:\/\/doi.org\/10.4028\/www.scientific.net\/amm.26-28.657","DOI":"10.4028\/www.scientific.net\/amm.26-28.657"},{"key":"9953_CR26","doi-asserted-by":"publisher","first-page":"657","DOI":"10.4028\/www.scientific.net\/amm.26-28.657","volume":"26\u201328","author":"B Yao","year":"2010","unstructured":"Yao B, Yang C, Hu J, Yin G, Yu B (2010) An improved artificial bee colony algorithm for job shop problem. Appl Mech Mater 26\u201328:657\u2013660. https:\/\/doi.org\/10.4028\/www.scientific.net\/amm.26-28.657","journal-title":"Appl Mech Mater"}],"container-title":["Natural Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11047-023-09953-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11047-023-09953-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11047-023-09953-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,25]],"date-time":"2024-10-25T19:08:55Z","timestamp":1729883335000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11047-023-09953-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,8,5]]},"references-count":26,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2023,12]]}},"alternative-id":["9953"],"URL":"https:\/\/doi.org\/10.1007\/s11047-023-09953-2","relation":{},"ISSN":["1567-7818","1572-9796"],"issn-type":[{"type":"print","value":"1567-7818"},{"type":"electronic","value":"1572-9796"}],"subject":[],"published":{"date-parts":[[2023,8,5]]},"assertion":[{"value":"11 July 2023","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"5 August 2023","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"This research has been supported by the Spanish Government under research grant PID2019-106263RB-I00 and by the Asturian Government under research grant Severo Ochoa.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Funding"}},{"value":"The authors declare that they have no financial or non-financial conflicts of interest.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}},{"value":"Not applicable","order":4,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethics approval"}}]}}