{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,18]],"date-time":"2026-03-18T20:11:15Z","timestamp":1773864675749,"version":"3.50.1"},"publisher-location":"Cham","reference-count":28,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032195814","type":"print"},{"value":"9783032195821","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-19582-1_9","type":"book-chapter","created":{"date-parts":[[2026,3,18]],"date-time":"2026-03-18T12:36:54Z","timestamp":1773837414000},"page":"120-133","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Variable Neighborhood Programming for\u00a0Job Shop Scheduling Problems"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0009-0005-4851-4291","authenticated-orcid":false,"given":"Michael-Alexandros","family":"Triantoglou","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5696-7021","authenticated-orcid":false,"given":"Angelo","family":"Sifaleras","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2553-4116","authenticated-orcid":false,"given":"Rachid","family":"Benmansour","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2026,3,19]]},"reference":[{"issue":"2","key":"9_CR1","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1016\/j.ejor.2025.01.034","volume":"327","author":"A Agnetis","year":"2025","unstructured":"Agnetis, A., Billaut, J.C., Pinedo, M., Shabtay, D.: Fifty years of research in scheduling \u2014 theory and applications. Eur. J. Oper. Res. 327(2), 367\u2013393 (2025)","journal-title":"Eur. J. Oper. Res."},{"key":"9_CR2","doi-asserted-by":"publisher","unstructured":"Benbrik, O., Benmansour, R., Elidrissi, A., Sifaleras, A.: Advanced algorithms for the reclaimer scheduling problem with sequence-dependent setup times and availability constraints. In: Sevaux, M., Olteanu, AL., Pardo, E.G., Sifaleras, A., Makboul, S. (eds.) MIC 2024. LNCS, vol. 14753, pp. 291\u2013308. Springer, Cham (2024). https:\/\/doi.org\/10.1007\/978-3-031-62912-9_28","DOI":"10.1007\/978-3-031-62912-9_28"},{"key":"9_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1007\/978-3-030-69625-2_6","volume-title":"Variable Neighborhood Search","author":"R Benmansour","year":"2021","unstructured":"Benmansour, R., Sifaleras, A.: Scheduling in parallel machines with two servers: the restrictive case. In: Mladenovic, N., Sleptchenko, A., Sifaleras, A., Omar, M. (eds.) ICVNS 2021. LNCS, vol. 12559, pp. 71\u201382. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-69625-2_6"},{"key":"9_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-15843-9","volume-title":"Variable Neighborhood Search","year":"2019","unstructured":"Sifaleras, A., Salhi, S., Brimberg, J. (eds.): ICVNS 2018. LNCS, vol. 11328. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-15843-9"},{"issue":"5","key":"9_CR5","doi-asserted-by":"publisher","first-page":"621","DOI":"10.1287\/opre.7.5.621","volume":"7","author":"EH Bowman","year":"1959","unstructured":"Bowman, E.H.: The schedule-sequencing problem. Oper. Res. 7(5), 621\u2013624 (1959)","journal-title":"Oper. Res."},{"key":"9_CR6","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2023.106221","volume":"155","author":"J Brimberg","year":"2023","unstructured":"Brimberg, J., Salhi, S., Todosijevi\u0107, R., Uro\u0161evi\u0107, D.: Variable neighborhood search: the power of change and simplicity. Comput. Oper. Res. 155, 106221 (2023)","journal-title":"Comput. Oper. Res."},{"issue":"9","key":"9_CR7","doi-asserted-by":"publisher","first-page":"2201","DOI":"10.1007\/s11590-022-01925-2","volume":"17","author":"A Elidrissi","year":"2023","unstructured":"Elidrissi, A., Benmansour, R., Sifaleras, A.: A general variable neighborhood search for the parallel machine scheduling problem with two common servers. Optim. Lett. 17(9), 2201\u20132231 (2023)","journal-title":"Optim. Lett."},{"key":"9_CR8","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1016\/j.endm.2017.03.025","volume":"58","author":"S Elleuch","year":"2017","unstructured":"Elleuch, S., Hansen, P., Jarboui, B., Mladenovi\u0107, N.: New VNP for automatic programming. Electron. Notes Discrete Math. 58, 191\u2013198 (2017)","journal-title":"Electron. Notes Discrete Math."},{"key":"9_CR9","series-title":"Lecture Notes in Networks and Systems","doi-asserted-by":"publisher","first-page":"1237","DOI":"10.1007\/978-3-030-96308-8_115","volume-title":"Intelligent Systems Design and Applications","author":"S Elleuch","year":"2022","unstructured":"Elleuch, S., Jarboui, B.: Analysis of\u00a0six different GP-tree neighborhood structures. In: Abraham, A., Gandhi, N., Hanne, T., Hong, T.-P., Nogueira Rios, T., Ding, W. (eds.) ISDA 2021. LNNS, vol. 418, pp. 1237\u20131249. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-030-96308-8_115"},{"issue":"1","key":"9_CR10","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1007\/s11590-020-01649-1","volume":"16","author":"S Elleuch","year":"2022","unstructured":"Elleuch, S., Jarboui, B., Mladenovi\u0107, N., Pei, J.: Variable neighborhood programming for symbolic regression. Optim. Lett. 16(1), 191\u2013210 (2022)","journal-title":"Optim. Lett."},{"key":"9_CR11","volume-title":"Genetic Programming: On the Programming of Computers by Means of Natural Selection","author":"JR Koza","year":"1992","unstructured":"Koza, J.R.: Genetic Programming: On the Programming of Computers by Means of Natural Selection. MIT Press, Cambridge (1992)"},{"key":"9_CR12","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1016\/j.cor.2016.04.006","volume":"73","author":"WY Ku","year":"2016","unstructured":"Ku, W.Y., Beck, J.C.: Mixed integer programming models for job shop scheduling: a computational analysis. Comput. Oper. Res. 73, 165\u2013173 (2016)","journal-title":"Comput. Oper. Res."},{"key":"9_CR13","doi-asserted-by":"publisher","unstructured":"Lagos, A.I., Avgerinos, I., Zois, G., Mourtos, I., Casla, P.: Optimising a manufacturing-as-a-service platform through mathematical modeling. In: Mizuyama, H., Morinaga, E., Nonaka, T., Kaihara, T., von Cieminski, G., Romero, D. (eds.) APMS 2025. IFIP, vol. 769, pp. 478\u2013493. Springer, Cham (2025). https:\/\/doi.org\/10.1007\/978-3-032-03550-9_32","DOI":"10.1007\/978-3-032-03550-9_32"},{"issue":"2","key":"9_CR14","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1287\/opre.8.2.219","volume":"8","author":"AS Manne","year":"1960","unstructured":"Manne, A.S.: On the job-shop scheduling problem. Oper. Res. 8(2), 219\u2013223 (1960)","journal-title":"Oper. Res."},{"key":"9_CR15","series-title":"Springer Optimization and Its Applications","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1007\/978-3-030-66515-9_9","volume-title":"Black Box Optimization, Machine Learning, and No-Free Lunch Theorems","author":"N Mladenovic","year":"2021","unstructured":"Mladenovic, N., Jarboui, B., Elleuch, S., Mussabayev, R., Rusetskaya, O.: Variable neighborhood programming as a tool of machine learning. In: Pardalos, P.M., Rasskazova, V., Vrahatis, M.N. (eds.) Black Box Optimization, Machine Learning, and No-Free Lunch Theorems. SOIA, vol. 170, pp. 221\u2013271. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-66515-9_9"},{"key":"9_CR16","series-title":"Studies in Computational Intelligence","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1007\/978-3-319-91341-4_8","volume-title":"Evolutionary and Swarm Intelligence Algorithms","author":"S Nguyen","year":"2019","unstructured":"Nguyen, S., Zhang, M., Johnston, M., Tan, K.C.: Genetic programming for job shop scheduling. In: Bansal, J.C., Singh, P.K., Pal, N.R. (eds.) Evolutionary and Swarm Intelligence Algorithms. SCI, vol. 779, pp. 143\u2013167. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-319-91341-4_8"},{"issue":"1","key":"9_CR17","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1080\/00207729708929360","volume":"28","author":"CH Pan","year":"1997","unstructured":"Pan, C.H.: A study of integer programming formulations for scheduling problems. Int. J. Syst. Sci. 28(1), 33\u201341 (1997)","journal-title":"Int. J. Syst. Sci."},{"key":"9_CR18","doi-asserted-by":"publisher","unstructured":"Pinedo, M.L.: Scheduling: Theory, Algorithms, and Systems, 6th edn. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-05921-6","DOI":"10.1007\/978-3-031-05921-6"},{"issue":"6","key":"9_CR19","doi-asserted-by":"publisher","first-page":"727","DOI":"10.1016\/S0952-1976(02)00013-1","volume":"14","author":"S Sette","year":"2001","unstructured":"Sette, S., Boullart, L.: Genetic programming: principles and applications. Eng. Appl. Artif. Intell. 14(6), 727\u2013736 (2001)","journal-title":"Eng. Appl. Artif. Intell."},{"issue":"1\u20132","key":"9_CR20","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1002\/nav.3800030106","volume":"3","author":"WE Smith","year":"1956","unstructured":"Smith, W.E.: Various optimizers for single-stage production. Naval Res. Logistics Q. 3(1\u20132), 59\u201366 (1956)","journal-title":"Naval Res. Logistics Q."},{"issue":"2","key":"9_CR21","doi-asserted-by":"publisher","first-page":"278","DOI":"10.1016\/0377-2217(93)90182-M","volume":"64","author":"E Taillard","year":"1993","unstructured":"Taillard, E.: Benchmarks for basic scheduling problems. Eur. J. Oper. Res. 64(2), 278\u2013285 (1993)","journal-title":"Eur. J. Oper. Res."},{"issue":"2","key":"9_CR22","doi-asserted-by":"publisher","first-page":"108","DOI":"10.1287\/ijoc.6.2.108","volume":"6","author":"ED Taillard","year":"1994","unstructured":"Taillard, E.D.: Parallel taboo search techniques for the job shop scheduling problem. ORSA J. Comput. 6(2), 108\u2013117 (1994)","journal-title":"ORSA J. Comput."},{"issue":"1","key":"9_CR23","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1007\/s10710-017-9310-3","volume":"19","author":"M \u0110urasevi\u0107","year":"2018","unstructured":"\u0110urasevi\u0107, M., Jakobovi\u0107, D.: Evolving dispatching rules for optimising many-objective criteria in the unrelated machines environment. Genet. Program Evolvable Mach. 19(1), 9\u201351 (2018)","journal-title":"Genet. Program Evolvable Mach."},{"issue":"1","key":"9_CR24","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1007\/s10951-017-0547-8","volume":"21","author":"JJ Van Hoorn","year":"2018","unstructured":"Van Hoorn, J.J.: The current state of bounds on benchmark instances of the job-shop scheduling problem. J. Sched. 21(1), 127\u2013128 (2018)","journal-title":"J. Sched."},{"issue":"2","key":"9_CR25","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1002\/nav.3800060205","volume":"6","author":"HM Wagner","year":"1959","unstructured":"Wagner, H.M.: An integer linear-programming model for machine scheduling. Naval Res. Logistics Q. 6(2), 131\u2013140 (1959)","journal-title":"Naval Res. Logistics Q."},{"key":"9_CR26","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."},{"key":"9_CR27","doi-asserted-by":"publisher","unstructured":"Zhang, F., Nguyen, S., Mei, Y., Zhang, M.: Genetic Programming for Production Scheduling. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-981-16-4859-5","DOI":"10.1007\/978-981-16-4859-5"},{"key":"9_CR28","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2024.106929","volume":"175","author":"X Zhang","year":"2025","unstructured":"Zhang, X., Zhu, G.Y.: A literature review of reinforcement learning methods applied to job-shop scheduling problems. Comput. Oper. Res. 175, 106929 (2025)","journal-title":"Comput. Oper. Res."}],"container-title":["Lecture Notes in Computer Science","Variable Neighborhood Search"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-19582-1_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,18]],"date-time":"2026-03-18T12:36:54Z","timestamp":1773837414000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-19582-1_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9783032195814","9783032195821"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-19582-1_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026]]},"assertion":[{"value":"19 March 2026","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICVNS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Variable Neighborhood Search","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Montreal, QC","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Canada","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":"12 May 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 May 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"icvns2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/2025.icvns.com","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}