{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:25:11Z","timestamp":1740122711725,"version":"3.37.3"},"reference-count":38,"publisher":"Springer Science and Business Media LLC","issue":"2-3","license":[{"start":{"date-parts":[[2023,5,29]],"date-time":"2023-05-29T00:00:00Z","timestamp":1685318400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,5,29]],"date-time":"2023-05-29T00:00:00Z","timestamp":1685318400000},"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":["J Heuristics"],"published-print":{"date-parts":[[2023,6]]},"DOI":"10.1007\/s10732-023-09513-y","type":"journal-article","created":{"date-parts":[[2023,5,29]],"date-time":"2023-05-29T11:01:43Z","timestamp":1685358103000},"page":"383-408","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["An efficient scenario penalization matheuristic for a stochastic scheduling problem"],"prefix":"10.1007","volume":"29","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-6346-2550","authenticated-orcid":false,"given":"Michel","family":"Vasquez","sequence":"first","affiliation":[]},{"given":"Mirsad","family":"Buljubasic","sequence":"additional","affiliation":[]},{"given":"Sa\u00efd","family":"Hanafi","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,5,29]]},"reference":[{"issue":"1","key":"9513_CR1","doi-asserted-by":"publisher","first-page":"423","DOI":"10.1016\/j.ejor.2005.07.020","volume":"176","author":"S Benati","year":"2007","unstructured":"Benati, S., Rizzi, R.: A mixed integer linear programming formulation of the optimal mean\/value-at-risk portfolio problem. Eur. J. Oper. Res. 176(1), 423\u2013434 (2007)","journal-title":"Eur. J. Oper. Res."},{"issue":"2","key":"9513_CR2","doi-asserted-by":"publisher","first-page":"1107","DOI":"10.1007\/s10479-017-2550-z","volume":"271","author":"M Buljuba\u0161i\u0107","year":"2018","unstructured":"Buljuba\u0161i\u0107, M., Vasquez, M., Gavranovi\u0107, H.: Two-phase heuristic for SNCF rolling stock problem. Ann. Oper. Res. 271(2), 1107\u20131129 (2018)","journal-title":"Ann. Oper. Res."},{"unstructured":"Cattaruzza, D., Labb\u00e9, M., Petris, M., Roland, M., Schmidt, M.: Exact and heuristic solution techniques for mixed-integer quantile minimization problems (2022)","key":"9513_CR3"},{"issue":"5","key":"9513_CR4","doi-asserted-by":"publisher","first-page":"525","DOI":"10.1023\/B:HEUR.0000045323.83583.bd","volume":"10","author":"TG Crainic","year":"2004","unstructured":"Crainic, T.G., Gendron, B., Hernu, G.: A slope scaling\/Lagrangean perturbation heuristic with long-term memory for multicommodity capacitated fixed-charge network design. J. Heuristics 10(5), 525\u2013545 (2004)","journal-title":"J. Heuristics"},{"doi-asserted-by":"crossref","unstructured":"Crognier, G., Tournebise, P., Ruiz, M., Panciatici, P.: Grid operation-based outage maintenance planning. Electric Power Syst. Res. 190 (2021)","key":"9513_CR5","DOI":"10.1016\/j.epsr.2020.106682"},{"issue":"1","key":"9513_CR6","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1007\/s10852-005-9032-z","volume":"5","author":"L Di Gaspero","year":"2006","unstructured":"Di Gaspero, L., Schaerf, A.: Neighborhood portfolio approach for local search applied to timetabling problems. J. Math. Model. Algorithms 5(1), 65\u201389 (2006)","journal-title":"J. Math. Model. Algorithms"},{"issue":"3","key":"9513_CR7","doi-asserted-by":"publisher","first-page":"695","DOI":"10.1016\/j.ejor.2015.08.045","volume":"251","author":"A Froger","year":"2016","unstructured":"Froger, A., Gendreau, M., Mendoza, J.E., Pinson, E., Rousseau, L.-M.: Maintenance scheduling in the electricity industry: a literature review. Eur. J. Oper. Res. 251(3), 695\u2013706 (2016)","journal-title":"Eur. J. Oper. Res."},{"issue":"1","key":"9513_CR8","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1016\/0898-1221(76)90003-1","volume":"2","author":"D Gabay","year":"1976","unstructured":"Gabay, D., Mercier, B.: A dual algorithm for the solution of nonlinear variational problems via finite element approximation. Comput. Math. Appl. 2(1), 17\u201340 (1976)","journal-title":"Comput. Math. Appl."},{"issue":"1","key":"9513_CR9","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1007\/s10479-014-1686-3","volume":"242","author":"H Gavranovi\u0107","year":"2016","unstructured":"Gavranovi\u0107, H., Buljuba\u0161i\u0107, M.: An efficient local search with noising strategy for google machine reassignment problem. Ann. Oper. Res. 242(1), 19\u201331 (2016)","journal-title":"Ann. Oper. Res."},{"issue":"1","key":"9513_CR10","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1023\/A:1026102724889","volume":"122","author":"B Gendron","year":"2003","unstructured":"Gendron, B., Potvin, J.-Y., Soriano, P.: A Tabu search with slope scaling for the multicommodity capacitated location problem with balancing requirements. Ann. Oper. Res. 122(1), 193\u2013217 (2003)","journal-title":"Ann. Oper. Res."},{"issue":"1","key":"9513_CR11","doi-asserted-by":"publisher","first-page":"70","DOI":"10.1016\/j.ejor.2018.01.022","volume":"268","author":"B Gendron","year":"2018","unstructured":"Gendron, B., Hanafi, S., Todosijevi\u0107, R.: Matheuristics based on iterative linear programming and slope scaling for multicommodity capacitated fixed charge network design. Eur. J. Oper. Res. 268(1), 70\u201381 (2018)","journal-title":"Eur. J. Oper. Res."},{"issue":"8","key":"9513_CR12","doi-asserted-by":"publisher","first-page":"801","DOI":"10.1016\/0305-0548(94)90012-4","volume":"21","author":"F Glover","year":"1994","unstructured":"Glover, F.: Optimization by ghost image processes in neural networks. Comput. Oper. Res. 21(8), 801\u2013822 (1994)","journal-title":"Comput. Oper. Res."},{"issue":"4","key":"9513_CR13","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1007\/s10732-005-2135-x","volume":"11","author":"F Glover","year":"2005","unstructured":"Glover, F.: Parametric ghost image processes for fixed-charge problems: a study of transportation networks. J. Heuristics 11(4), 307\u2013336 (2005)","journal-title":"J. Heuristics"},{"key":"9513_CR14","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4615-6089-0","volume-title":"Tabu Search","author":"F Glover","year":"1997","unstructured":"Glover, F., Laguna, M.: Tabu Search. Kluwer Academic Publishers, Boston (1997)"},{"doi-asserted-by":"crossref","unstructured":"Glowinski, R., Marroco, A.: Sur l\u2019approximation, par \u00e9l\u00e9ments finis d\u2019ordre un, et la r\u00e9solution, par p\u00e9nalisation-dualit\u00e9 d\u2019une classe de probl\u00e8mes de dirichlet non lin\u00e9aires. Revue fran\u00e7aise d\u2019automatique, informatique, recherche op\u00e9rationnelle. Analyse num\u00e9rique 9(R2), 41\u201376 (1975)","key":"9513_CR15","DOI":"10.1051\/m2an\/197509R200411"},{"unstructured":"Gouvine, G.: Mixed-integer programming for the ROADEF\/EURO 2020 challenge. arXiv preprint arXiv:2111.01047 (2021)","key":"9513_CR16"},{"issue":"4","key":"9513_CR17","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1007\/s10732-017-9336-y","volume":"23","author":"S Hanafi","year":"2017","unstructured":"Hanafi, S., Todosijevi\u0107, R.: Mathematical programming based heuristics for the 0\u20131 MIP: a survey. J. Heuristics 23(4), 165\u2013206 (2017)","journal-title":"J. Heuristics"},{"issue":"1","key":"9513_CR18","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1162\/106365603321828970","volume":"11","author":"N Hansen","year":"2003","unstructured":"Hansen, N., M\u00fcller, S.D., Koumoutsakos, P.: Reducing the time complexity of the derandomized evolution strategy with covariance matrix adaptation (CMA-ES). Evol. Comput. 11(1), 1\u201318 (2003)","journal-title":"Evol. Comput."},{"issue":"3","key":"9513_CR19","doi-asserted-by":"publisher","first-page":"423","DOI":"10.1007\/s13675-016-0075-x","volume":"5","author":"P Hansen","year":"2017","unstructured":"Hansen, P., Mladenovi\u0107, N., Todosijevi\u0107, R., Hanafi, S.: Variable neighborhood search: basics and variants. EURO J. Comput. Optim. 5(3), 423\u2013454 (2017)","journal-title":"EURO J. Comput. Optim."},{"issue":"1","key":"9513_CR20","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1007\/s10479-009-0545-0","volume":"183","author":"H Hashimoto","year":"2011","unstructured":"Hashimoto, H., Boussier, S., Vasquez, M., Wilbaut, C.: A grasp-based approach for technicians and interventions scheduling for telecommunications. Ann. Oper. Res. 183(1), 143\u2013161 (2011)","journal-title":"Ann. Oper. Res."},{"key":"9513_CR21","volume-title":"Stochastic Local Search: Foundations and Applications","author":"HH Hoos","year":"2004","unstructured":"Hoos, H.H., St\u00fctzle, T.: Stochastic Local Search: Foundations and Applications. Elsevier, Amsterdam (2004)"},{"key":"9513_CR22","volume-title":"Value at Risk: The New Benchmark for Controlling Market Risk","author":"P Jorion","year":"1997","unstructured":"Jorion, P.: Value at Risk: The New Benchmark for Controlling Market Risk, vol. 2. McGraw-Hill, New York (1997)"},{"issue":"4","key":"9513_CR23","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1016\/S0167-6377(99)00004-8","volume":"24","author":"D Kim","year":"1999","unstructured":"Kim, D., Pardalos, P.M.: A solution approach to the fixed charge network flow problem using a dynamic slope scaling procedure. Oper. Res. Lett. 24(4), 195\u2013203 (1999)","journal-title":"Oper. Res. Lett."},{"issue":"4598","key":"9513_CR24","doi-asserted-by":"publisher","first-page":"671","DOI":"10.1126\/science.220.4598.671","volume":"220","author":"S Kirkpatrick","year":"1983","unstructured":"Kirkpatrick, S., Gelatt, C.D., Vecchi, M.P.: Optimization by simulated annealing. Science 220(4598), 671\u2013680 (1983)","journal-title":"Science"},{"key":"9513_CR25","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-00784-6","volume-title":"Self Organization and Associative Memory","author":"T Kohonen","year":"1988","unstructured":"Kohonen, T.: Self Organization and Associative Memory. Springer, Berlin (1988)"},{"issue":"2","key":"9513_CR26","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1007\/s10732-010-9128-0","volume":"17","author":"Z L\u00fc","year":"2011","unstructured":"L\u00fc, Z., Hao, J.-K., Glover, F.: Neighborhood analysis: a case study on curriculum-based course timetabling. J. Heuristics 17(2), 97\u2013118 (2011)","journal-title":"J. Heuristics"},{"doi-asserted-by":"crossref","unstructured":"Markowitz, H.: Portfolio selection. J. Finance 7(1) (1952)","key":"9513_CR27","DOI":"10.2307\/2975974"},{"key":"9513_CR28","volume-title":"Mean-variance Analysis in Portfolio Choice and Capital Markets","author":"HM Markowitz","year":"2000","unstructured":"Markowitz, H.M., Todd, G.P.: Mean-variance Analysis in Portfolio Choice and Capital Markets, vol. 66. John Wiley & Sons, London (2000)"},{"issue":"3","key":"9513_CR29","doi-asserted-by":"publisher","first-page":"615","DOI":"10.1111\/itor.12282","volume":"24","author":"A Mjirda","year":"2017","unstructured":"Mjirda, A., Todosijevi\u0107, R., Hanafi, S., Hansen, P., Mladenovi\u0107, N.: Sequential variable neighborhood descent variants: an empirical study on the traveling salesman problem. Int. Trans. Oper. Res. 24(3), 615\u2013633 (2017)","journal-title":"Int. Trans. Oper. Res."},{"issue":"1","key":"9513_CR30","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1137\/S1052623400375075","volume":"13","author":"W Ogryczak","year":"2002","unstructured":"Ogryczak, W., Ruszczynski, A.: Dual stochastic dominance and related mean-risk models. SIAM J. Optim. 13(1), 60\u201378 (2002)","journal-title":"SIAM J. Optim."},{"issue":"5","key":"9513_CR31","doi-asserted-by":"publisher","first-page":"661","DOI":"10.1111\/1475-3995.00380","volume":"9","author":"W Ogryczak","year":"2002","unstructured":"Ogryczak, W., Ruszczy\u0144ski, A.: Dual stochastic dominance and quantile risk measures. Int. Trans. Oper. Res. 9(5), 661\u2013680 (2002)","journal-title":"Int. Trans. Oper. Res."},{"issue":"1","key":"9513_CR32","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1137\/1033004","volume":"33","author":"M Padberg","year":"1991","unstructured":"Padberg, M., Rinaldi, G.: A branch-and-cut algorithm for the resolution of large-scale symmetric traveling salesman problems. SIAM Rev. 33(1), 60\u2013100 (1991)","journal-title":"SIAM Rev."},{"issue":"3","key":"9513_CR33","doi-asserted-by":"publisher","first-page":"801","DOI":"10.1016\/j.ejor.2016.12.005","volume":"259","author":"R Rahmaniani","year":"2017","unstructured":"Rahmaniani, R., Crainic, T.G., Gendreau, M., Rei, W.: The benders decomposition algorithm: a literature review. Eur. J. Oper. Res. 259(3), 801\u2013817 (2017)","journal-title":"Eur. J. Oper. Res."},{"unstructured":"ROADEF\/EURO challenge (2020). https:\/\/www.euro-online.org\/media_site\/reports\/Challenge_Subject","key":"9513_CR34"},{"issue":"5","key":"9513_CR35","doi-asserted-by":"publisher","first-page":"1263","DOI":"10.2307\/2329860","volume":"6","author":"WF Sharpe","year":"1971","unstructured":"Sharpe, W.F.: A linear programming approximation for the general portfolio analysis problem. J. Financial Quant. Anal. 6(5), 1263\u20131275 (1971)","journal-title":"J. Financial Quant. Anal."},{"key":"9513_CR36","volume-title":"Stochastic Dominance: An Approach to Decision-making Under Risk","author":"GA Whitmore","year":"1978","unstructured":"Whitmore, G.A., Findlay, M.C.: Stochastic Dominance: An Approach to Decision-making Under Risk. Lexington Books, Lexington (1978)"},{"issue":"4","key":"9513_CR37","doi-asserted-by":"publisher","first-page":"468","DOI":"10.1287\/ijoc.7.4.468","volume":"7","author":"DL Woodruff","year":"1995","unstructured":"Woodruff, D.L.: Ghost image processing for minimum covariance determinants. ORSA J. Comput. 7(4), 468\u2013473 (1995)","journal-title":"ORSA J. Comput."},{"doi-asserted-by":"crossref","unstructured":"Zholobova, A., Zholobov, Y., Polyakov, I., Petrosian, O., Vlasova, T.: An industry maintenance planning optimization problem using CMA-VNS and its variations. In: International Conference on Mathematical Optimization Theory and Operations Research, pp. 429\u2013443. Springer, Berlin (2021)","key":"9513_CR38","DOI":"10.1007\/978-3-030-86433-0_30"}],"container-title":["Journal of Heuristics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10732-023-09513-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10732-023-09513-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10732-023-09513-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,12]],"date-time":"2023-06-12T11:32:38Z","timestamp":1686569558000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10732-023-09513-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,5,29]]},"references-count":38,"journal-issue":{"issue":"2-3","published-print":{"date-parts":[[2023,6]]}},"alternative-id":["9513"],"URL":"https:\/\/doi.org\/10.1007\/s10732-023-09513-y","relation":{},"ISSN":["1381-1231","1572-9397"],"issn-type":[{"type":"print","value":"1381-1231"},{"type":"electronic","value":"1572-9397"}],"subject":[],"published":{"date-parts":[[2023,5,29]]},"assertion":[{"value":"25 March 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"28 April 2023","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"5 May 2023","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"29 May 2023","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}