{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,20]],"date-time":"2025-12-20T21:48:01Z","timestamp":1766267281596},"reference-count":76,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2016,6,22]],"date-time":"2016-06-22T00:00:00Z","timestamp":1466553600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"name":"T\u00dcB\u0130TAK","award":["112M864"],"award-info":[{"award-number":["112M864"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Ann Oper Res"],"published-print":{"date-parts":[[2017,1]]},"DOI":"10.1007\/s10479-016-2251-z","type":"journal-article","created":{"date-parts":[[2016,6,23]],"date-time":"2016-06-23T18:43:33Z","timestamp":1466707413000},"page":"25-73","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":35,"title":["Minimizing value-at-risk in single-machine scheduling"],"prefix":"10.1007","volume":"248","author":[{"given":"Semih","family":"Atakan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kerem","family":"B\u00fclb\u00fcl","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nilay","family":"Noyan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,6,22]]},"reference":[{"issue":"3","key":"2251_CR1","doi-asserted-by":"crossref","first-page":"433","DOI":"10.1007\/s10107-005-0638-8","volume":"106","author":"S Ahmed","year":"2006","unstructured":"Ahmed, S. (2006). Convexity and decomposition of mean-risk stochastic programs. Mathematical Programming, 106(3), 433\u2013446.","journal-title":"Mathematical Programming"},{"issue":"1","key":"2251_CR2","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1007\/s10951-007-0034-8","volume":"11","author":"M Akker","year":"2008","unstructured":"Akker, M., & Hoogeveen, H. (2008). Minimizing the number of late jobs in a stochastic setting using a chance constraint. Journal of Scheduling, 11(1), 59\u201369.","journal-title":"Journal of Scheduling"},{"issue":"9","key":"2251_CR3","doi-asserted-by":"crossref","first-page":"2604","DOI":"10.1016\/j.cor.2005.10.007","volume":"34","author":"A Alonso-Ayuso","year":"2007","unstructured":"Alonso-Ayuso, A., Escudero, L., Ortu\u00f1o, M. O., & Pizarro, C. (2007). On a stochastic sequencing and scheduling problem. Computers and Operations Research, 34(9), 2604\u20132624.","journal-title":"Computers and Operations Research"},{"issue":"3","key":"2251_CR4","doi-asserted-by":"crossref","first-page":"338","DOI":"10.1016\/j.orl.2007.11.005","volume":"36","author":"MA Aloulou","year":"2008","unstructured":"Aloulou, M. A., & Croce, F. D. (2008). Complexity of single machine scheduling problems under scenario-based uncertainty. Operations Research Letters, 36(3), 338\u2013342.","journal-title":"Operations Research Letters"},{"issue":"3","key":"2251_CR5","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1111\/1467-9965.00068","volume":"9","author":"P Artzner","year":"1999","unstructured":"Artzner, P., Delbaen, F., Eber, J. M., & Heath, D. (1999). Coherent measures of risk. Mathematical Finance, 9(3), 203\u2013227.","journal-title":"Mathematical Finance"},{"key":"2251_CR6","unstructured":"Atakan, S., Tezel, B., B\u00fclb\u00fcl, K., & Noyan, N. (2011). Minimizing value-at-risk in the single-machine total weighted tardiness problem. In Proceedings of the 5th Multidisciplinary International Scheduling Conference on Scheduling: Theory and Applications (MISTA 2011), 9\u201311 August 2011 (pp. 215\u2013229). Arizona: Phoenix."},{"issue":"4","key":"2251_CR7","doi-asserted-by":"crossref","first-page":"730","DOI":"10.1016\/j.cie.2010.07.028","volume":"59","author":"KR Baker","year":"2010","unstructured":"Baker, K. R., & Keller, B. (2010). Solving the single-machine sequencing problem using integer programming. Computers and Industrial Engineering, 59(4), 730\u2013735.","journal-title":"Computers and Industrial Engineering"},{"issue":"1","key":"2251_CR8","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1613\/jair.2080","volume":"28","author":"JC Beck","year":"2007","unstructured":"Beck, J. C., & Wilson, N. (2007). Proactive algorithms for job shop scheduling with probabilistic durations. Journal of Artificial Intelligence Research, 28(1), 183\u2013232.","journal-title":"Journal of Artificial Intelligence Research"},{"issue":"6","key":"2251_CR9","doi-asserted-by":"crossref","first-page":"1167","DOI":"10.1016\/j.dam.2008.06.021","volume":"157","author":"HM Ben Amor","year":"2009","unstructured":"Ben Amor, H. M., Desrosiers, J., & Frangioni, A. (2009). On the choice of explicit stabilizing terms in column generation. Discrete Applied Mathematics, 157(6), 1167\u20131184.","journal-title":"Discrete Applied Mathematics"},{"key":"2251_CR10","volume-title":"Introduction to stochastic programming","author":"J Birge","year":"1997","unstructured":"Birge, J., & Louveaux, F. (1997). Introduction to stochastic programming. New York: Springer."},{"key":"2251_CR11","doi-asserted-by":"crossref","unstructured":"Bonfietti, A., Lombardi, M., & Milano, M. (2014). Disregarding duration uncertainty in partial order schedules? Yes, we can! In Simonis, H. (ed) Integration of AI and OR techniques in constraint programming, volume 8451 of Lecture notes in computer science (pp. 210\u2013225). New York: Springer.","DOI":"10.1007\/978-3-319-07046-9_15"},{"key":"2251_CR12","doi-asserted-by":"crossref","DOI":"10.1137\/1.9780898717754","volume-title":"Assignment problems","author":"R Burkard","year":"2009","unstructured":"Burkard, R., Dell\u2019Amico, M., & Martello, S. (2009). Assignment problems. Philadelphia: Society for Industrial and Applied Mathematics."},{"issue":"1\u20132","key":"2251_CR13","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1016\/S0167-6377(98)00050-9","volume":"24","author":"CC Car\u00f8e","year":"1999","unstructured":"Car\u00f8e, C. C., & Schultz, R. (1999). Dual decomposition in stochastic integer programming. Operations Research Letters, 24(1\u20132), 37\u201345.","journal-title":"Operations Research Letters"},{"issue":"1","key":"2251_CR14","doi-asserted-by":"crossref","first-page":"451","DOI":"10.1007\/BF02680570","volume":"83","author":"C Car\u00f8e","year":"1998","unstructured":"Car\u00f8e, C., & Tind, J. (1998). L-shaped decomposition of two-stage stochastic programs with integer recourse. Mathematical Programming, 83(1), 451\u2013464.","journal-title":"Mathematical Programming"},{"issue":"6","key":"2251_CR15","doi-asserted-by":"crossref","first-page":"593","DOI":"10.1080\/14697681003685597","volume":"10","author":"R Cont","year":"2010","unstructured":"Cont, R., Deguest, R., & Scandolo, G. (2010). Robustness and sensitivity analysis of risk measurement procedures. Quantitative Finance, 10(6), 593\u2013606.","journal-title":"Quantitative Finance"},{"issue":"11","key":"2251_CR16","first-page":"977","volume":"29","author":"RL Daniels","year":"1997","unstructured":"Daniels, R. L., & Carrillo, J. (1997). $$\\beta $$ \u03b2 -robust scheduling for single-machine systems with uncertain processing times. IIE Transactions, 29(11), 977\u2013985.","journal-title":"IIE Transactions"},{"issue":"2","key":"2251_CR17","doi-asserted-by":"crossref","first-page":"363","DOI":"10.1287\/mnsc.41.2.363","volume":"41","author":"R Daniels","year":"1995","unstructured":"Daniels, R., & Kouvelis, P. (1995). Robust scheduling to hedge against processing time uncertainty in single-stage production. Management Science, 41(2), 363\u2013376.","journal-title":"Management Science"},{"key":"2251_CR18","unstructured":"Danielsson, J. & Zhou, C. (2015). Why risk is so hard to measure. Technical report, Working Paper, SSRN: http:\/\/ssrn.com\/abstract=2597563 ."},{"key":"2251_CR19","unstructured":"Danielsson, J., Jorgensen, B.\u00a0N., Mandira, S., Samorodnitsky, G., & De\u00a0Vries, C.\u00a0G. (2005). Subadditivity re\u2013examined: The case for value-at-risk. Discussion paper, 549. Financial Markets Group, London School of Economics and Political Science, London."},{"key":"2251_CR20","unstructured":"Davis, M. (2015). Consistency of risk measure estimates. Technical report, Working Paper, SSRN: http:\/\/ssrn.com\/abstract=2342279 ."},{"key":"2251_CR21","doi-asserted-by":"crossref","unstructured":"de Farias, I. R. Jr., Zhao, H., & Zhao, M. (2010). A family of inequalities valid for the robust single machine scheduling polyhedron. Computers and Operations Research, 37(9), 1610\u20131614.","DOI":"10.1016\/j.cor.2009.12.001"},{"key":"2251_CR22","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1007\/1-84628-095-8_2","volume-title":"Probabilistic and randomized methods for design under uncertainty","author":"D Dentcheva","year":"2006","unstructured":"Dentcheva, D. (2006). Optimization models with probabilistic constraints. In G. Calafiore & F. Dabbene (Eds.), Probabilistic and randomized methods for design under uncertainty (pp. 49\u201397). London: Springer."},{"issue":"3","key":"2251_CR23","doi-asserted-by":"crossref","first-page":"483","DOI":"10.1287\/moor.15.3.483","volume":"15","author":"J Du","year":"1990","unstructured":"Du, J., & Leung, J. Y.-T. (1990). Minimizing total tardiness on one machine is NP-hard. Mathematics of Operations Research, 15(3), 483\u2013495.","journal-title":"Mathematics of Operations Research"},{"issue":"1","key":"2251_CR24","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1007\/s10479-005-3447-9","volume":"139","author":"A Frangioni","year":"2005","unstructured":"Frangioni, A. (2005). About Lagrangian methods in integer optimization. Annals of Operations Research, 139(1), 163\u2013193.","journal-title":"Annals of Operations Research"},{"issue":"2","key":"2251_CR25","doi-asserted-by":"crossref","first-page":"1","DOI":"10.21314\/JOR.2005.106","volume":"7","author":"AA Gaivoronski","year":"2005","unstructured":"Gaivoronski, A. A., & Pflug, G. C. (2005). Value-at-risk in portfolio optimization: Properties and computational approach. Journal of Risk, 7(2), 1\u201331.","journal-title":"Journal of Risk"},{"key":"2251_CR26","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1016\/S0167-5060(08)70356-X","volume":"5","author":"RL Graham","year":"1979","unstructured":"Graham, R. L., Lawler, E. L., Lenstra, J. K., & Rinnooy Kan, A. H. G. (1979). Optimization and approximation in deterministic sequencing and scheduling: A survey. Annals of Discrete Mathematics, 5, 287\u2013326.","journal-title":"Annals of Discrete Mathematics"},{"issue":"2","key":"2251_CR27","doi-asserted-by":"crossref","first-page":"396","DOI":"10.1016\/S0377-2217(98)00279-3","volume":"117","author":"WJ Gutjahr","year":"1999","unstructured":"Gutjahr, W. J., Hellmayr, A., & Pflug, G. C. (1999). Optimal stochastic single-machine-tardiness scheduling by stochastic branch-and-bound. European Journal of Operational Research, 117(2), 396\u2013413.","journal-title":"European Journal of Operational Research"},{"key":"2251_CR28","unstructured":"Helmberg, C. (2011). The ConicBundle library for convex optimization. Last viewed on August 16, 2013."},{"key":"2251_CR29","unstructured":"Heyde, C.\u00a0C., Kou, S.\u00a0G., & Peng, X.\u00a0H. (2006). What is a good risk measure: Bridging the gaps between data, coherent risk measures, and insurance risk measures. Technical report, Columbia University."},{"key":"2251_CR30","unstructured":"IBM ILOG CPLEX (2012). IBM ILOG CPLEX Optimization Studio 12.5 Information Center. http:\/\/pic.dhe.ibm.com\/infocenter\/cosinfoc\/v12r5\/index.jsp . Last viewed on April 8, 2014."},{"issue":"8","key":"2251_CR31","doi-asserted-by":"crossref","first-page":"2551","DOI":"10.1016\/j.jbankfin.2006.11.014","volume":"31","author":"R Ibragimov","year":"2007","unstructured":"Ibragimov, R., & Walden, J. (2007). The limits of diversification when losses may be large. Journal of Banking and Finance, 31(8), 2551\u20132569.","journal-title":"Journal of Banking and Finance"},{"key":"2251_CR32","volume-title":"Variable splitting: A new Lagrangean relaxation approach to some mathematical programming models","author":"KO J\u00f6rnsten","year":"1985","unstructured":"J\u00f6rnsten, K. O., N\u00e4sberg, M., & Smeds, P. A. (1985). Variable splitting: A new Lagrangean relaxation approach to some mathematical programming models. Sweden: Link\u00f6ping University, Department of Mathematics."},{"issue":"5","key":"2251_CR33","doi-asserted-by":"crossref","first-page":"1464","DOI":"10.1016\/j.cor.2004.11.002","volume":"33","author":"B Kallehauge","year":"2006","unstructured":"Kallehauge, B., Larsen, J., & Madsen, O. B. G. (2006). Lagrangian duality applied to the vehicle routing problem with time windows. Computers and Operations Research, 33(5), 1464\u20131487.","journal-title":"Computers and Operations Research"},{"issue":"1","key":"2251_CR34","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1287\/opre.48.1.99.12447","volume":"48","author":"J Kanet","year":"2000","unstructured":"Kanet, J., & Sridharan, V. (2000). Scheduling with inserted idle time: Problem taxonomy and literature review. Operations Research, 48(1), 99\u2013110.","journal-title":"Operations Research"},{"key":"2251_CR35","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1007\/978-1-4684-2001-2_9","volume-title":"Complexity of computer computations. The IBM research symposia series","author":"RM Karp","year":"1972","unstructured":"Karp, R. M. (1972). Reducibility among combinatorial problems. In R. E. Miller, J. W. Thatcher, & J. D. Bohlinger (Eds.), Complexity of computer computations. The IBM research symposia series (pp. 85\u2013103). New York: Springer."},{"issue":"4","key":"2251_CR36","doi-asserted-by":"crossref","first-page":"431","DOI":"10.1016\/j.orl.2004.07.004","volume":"33","author":"A Kasperski","year":"2005","unstructured":"Kasperski, A. (2005). Minimizing maximal regret in the single machine sequencing problem with maximum lateness criterion. Operations Research Letters, 33(4), 431\u2013436.","journal-title":"Operations Research Letters"},{"issue":"1","key":"2251_CR37","doi-asserted-by":"crossref","first-page":"36","DOI":"10.1016\/j.ejor.2011.08.029","volume":"217","author":"A Kasperski","year":"2012","unstructured":"Kasperski, A., Kurpisz, A., & Zieli\u0144ski, P. (2012). Approximating a two-machine flow shop scheduling under discrete scenario uncertainty. European Journal of Operational Research, 217(1), 36\u201343.","journal-title":"European Journal of Operational Research"},{"issue":"1\/2","key":"2251_CR38","doi-asserted-by":"crossref","first-page":"181","DOI":"10.2307\/1910956","volume":"31","author":"S Kataoka","year":"1963","unstructured":"Kataoka, S. (1963). A stochastic programming model. Econometrica, 31(1\/2), 181\u2013196.","journal-title":"Econometrica"},{"issue":"1","key":"2251_CR39","doi-asserted-by":"crossref","first-page":"357","DOI":"10.1016\/j.cie.2008.06.008","volume":"56","author":"AB Keha","year":"2009","unstructured":"Keha, A. B., Khowala, K., & Fowler, J. W. (2009). Mixed integer programming formulations for single machine scheduling problems. Computers and Industrial Engineering, 56(1), 357\u2013367.","journal-title":"Computers and Industrial Engineering"},{"key":"2251_CR40","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1023\/A:1018930113099","volume":"85","author":"WK Klein Haneveld","year":"1999","unstructured":"Klein Haneveld, W. K., & van der Vlerk, M. H. (1999). Stochastic integer programming: General models and algorithms. Annals of Operations Research, 85, 39\u201357.","journal-title":"Annals of Operations Research"},{"issue":"3","key":"2251_CR41","doi-asserted-by":"crossref","first-page":"393","DOI":"10.1287\/moor.1120.0577","volume":"38","author":"S Kou","year":"2013","unstructured":"Kou, S., Peng, X., & Heyde, C. C. (2013). External risk measures and Basel accords. Mathematics of Operations Research, 38(3), 393\u2013417.","journal-title":"Mathematics of Operations Research"},{"issue":"3","key":"2251_CR42","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1016\/0167-6377(93)90002-X","volume":"13","author":"G Laporte","year":"1993","unstructured":"Laporte, G., & Louveaux, F. (1993). The integer L-shaped method for stochastic integer programs with complete recourse. Operations Research Letters, 13(3), 133\u2013142.","journal-title":"Operations Research Letters"},{"key":"2251_CR43","doi-asserted-by":"crossref","unstructured":"Larsen, N., Mausser, H., & Uryasev, S. (2002). Algorithms for optimization of value-at-risk. In P. M. Pardalos & V. K. Tsitsiringos (Eds.), Financial engineering, E-commerce and supply chain, volume 70 of Applied optimization (Vol. 70, pp. 19\u201346). New York: Springer.","DOI":"10.1007\/978-1-4757-5226-7_2"},{"key":"2251_CR44","doi-asserted-by":"crossref","first-page":"343","DOI":"10.1016\/S0167-5060(08)70743-X","volume":"1","author":"JK Lenstra","year":"1977","unstructured":"Lenstra, J. K., Rinnooy Kan, A. H. G., & Brucker, P. (1977). Complexity of machine scheduling problems. Annals of Discrete Mathematics, 1, 343\u2013362.","journal-title":"Annals of Discrete Mathematics"},{"key":"2251_CR45","doi-asserted-by":"crossref","unstructured":"Louveaux, F. V., & Schultz, R. (2003). Stochastic integer programming. In A. Ruszczy\u0144ski & A. Shapiro (Eds.), Stochastic programming, volume 10 of Handbooks in operations research and management science (Vol. 10, pp. 213\u2013266). Amsterdam: Elsevier.","DOI":"10.1016\/S0927-0507(03)10004-7"},{"issue":"7","key":"2251_CR46","doi-asserted-by":"crossref","first-page":"1682","DOI":"10.1016\/j.cor.2011.10.003","volume":"39","author":"C-C Lu","year":"2012","unstructured":"Lu, C.-C., Lin, S.-W., & Ying, K.-C. (2012). Robust scheduling on a single machine to minimize total flow time. Computers and Operations Research, 39(7), 1682\u20131691.","journal-title":"Computers and Operations Research"},{"issue":"3","key":"2251_CR47","doi-asserted-by":"crossref","first-page":"389","DOI":"10.1287\/opre.23.3.389","volume":"23","author":"RE Marsten","year":"1975","unstructured":"Marsten, R. E., Hogan, W. W., & Blankenship, J. W. (1975). The BOXSTEP method for large-scale optimization. Operations Research, 23(3), 389\u2013405.","journal-title":"Operations Research"},{"issue":"3","key":"2251_CR48","doi-asserted-by":"crossref","first-page":"541","DOI":"10.1016\/j.cor.2011.03.017","volume":"39","author":"N Noyan","year":"2012","unstructured":"Noyan, N. (2012). Risk-averse two-stage stochastic programming with an application to disaster management. Computers and Operations Research, 39(3), 541\u2013559.","journal-title":"Computers and Operations Research"},{"issue":"2","key":"2251_CR49","doi-asserted-by":"crossref","first-page":"60","DOI":"10.1137\/S1052623400375075","volume":"13","author":"W Ogryczak","year":"2002","unstructured":"Ogryczak, W., & Ruszczy\u0144ski, A. (2002). Dual stochastic dominance and related mean-risks models. SIAM Journal on Optimization, 13(2), 60\u201378.","journal-title":"SIAM Journal on Optimization"},{"issue":"5","key":"2251_CR50","doi-asserted-by":"crossref","first-page":"611","DOI":"10.1080\/10556780410001704911","volume":"19","author":"J Pang","year":"2004","unstructured":"Pang, J., & Leyffer, S. (2004). On the global minimization of the value-at-risk. Optimization Methods and Software, 19(5), 611\u2013631.","journal-title":"Optimization Methods and Software"},{"issue":"1","key":"2251_CR51","first-page":"243","volume":"255","author":"M Pascoal","year":"2003","unstructured":"Pascoal, M., Captivo, M. E., & Cl\u00edmaco, J. (2003). A note on a new variant of Murty\u2019s ranking assignments algorithm. 4OR, 255(1), 243\u2013255.","journal-title":"4OR"},{"key":"2251_CR52","doi-asserted-by":"crossref","DOI":"10.1142\/6478","volume-title":"Modeling, managing and measuring risk","author":"GC Pflug","year":"2007","unstructured":"Pflug, G. C., & R\u00f6misch, W. (2007). Modeling, managing and measuring risk. Singapore: World Scientific Publishing."},{"key":"2251_CR53","volume-title":"Scheduling: Theory, algorithms, and systems","author":"M Pinedo","year":"2008","unstructured":"Pinedo, M. (2008). Scheduling: Theory, algorithms, and systems (3rd ed.). New York: Springer.","edition":"3"},{"issue":"1","key":"2251_CR54","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1002\/(SICI)1520-6750(199902)46:1<1::AID-NAV1>3.0.CO;2-#","volume":"46","author":"M Pinedo","year":"1999","unstructured":"Pinedo, M., & Singer, M. (1999). A shifting bottleneck heuristic for minimizing the total weighted tardiness in a job shop. Naval Research Logistics, 46(1), 1\u201317.","journal-title":"Naval Research Logistics"},{"issue":"5","key":"2251_CR55","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1016\/0167-6377(82)90035-9","volume":"1","author":"C Potts","year":"1982","unstructured":"Potts, C., & van Wassenhove, L. (1982). A decomposition algorithm for the single machine total tardiness problem. Operations Research Letters, 1(5), 177\u2013181.","journal-title":"Operations Research Letters"},{"key":"2251_CR56","doi-asserted-by":"crossref","DOI":"10.1007\/978-94-017-3087-7","volume-title":"Stochastic programming","author":"A Pr\u00e9kopa","year":"1995","unstructured":"Pr\u00e9kopa, A. (1995). Stochastic programming. Dordrecht, Boston: Kluwer Academic."},{"issue":"3","key":"2251_CR57","doi-asserted-by":"crossref","first-page":"21","DOI":"10.21314\/JOR.2000.038","volume":"2","author":"R Rockafellar","year":"2000","unstructured":"Rockafellar, R., & Uryasev, S. (2000). Optimization of conditional value at risk. The Journal of Risk, 2(3), 21\u201341.","journal-title":"The Journal of Risk"},{"issue":"1","key":"2251_CR58","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1287\/moor.16.1.119","volume":"16","author":"RT Rockafellar","year":"1991","unstructured":"Rockafellar, R. T., & Wets, R. J.-B. (1991). Scenarios and policy aggregation in optimization under uncertainty. Mathematics of Operations Research, 16(1), 119\u2013147.","journal-title":"Mathematics of Operations Research"},{"issue":"1","key":"2251_CR59","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1007\/s10951-013-0349-6","volume":"17","author":"SC Sarin","year":"2014","unstructured":"Sarin, S. C., Sherali, H. D., & Liao, L. (2014). Minimizing conditional-value-at-risk for stochastic scheduling problems. Journal of Scheduling, 17(1), 5\u201315.","journal-title":"Journal of Scheduling"},{"key":"2251_CR60","doi-asserted-by":"publisher","unstructured":"Sarykalin, S., Serraino, G., & Uryasev, S. (2008). Value-at-risk vs. conditional value-at-risk in risk management and optimization. In Tutorials in operations research: State-of-the-art decision-making tools in the information-intensive age (chap. 13, pp. 270\u2013294). Hanover, MD: INFORMS. doi: 10.1287\/educ.1080.0052 .","DOI":"10.1287\/educ.1080.0052"},{"issue":"1","key":"2251_CR61","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1137\/S1052623402410855","volume":"14","author":"R Schultz","year":"2003","unstructured":"Schultz, R., & Tiedemann, S. (2003). Risk aversion via excess probabilities in stochastic programs with mixed-integer recourse. SIAM Journal on Optimization, 14(1), 115\u2013138.","journal-title":"SIAM Journal on Optimization"},{"issue":"2","key":"2251_CR62","doi-asserted-by":"crossref","first-page":"365","DOI":"10.1007\/s10107-005-0658-4","volume":"105","author":"R Schultz","year":"2006","unstructured":"Schultz, R., & Tiedemann, S. (2006). Conditional value-at-risk in stochastic programs with mixed-integer recourse. Mathematical Programming, 105(2), 365\u2013386.","journal-title":"Mathematical Programming"},{"key":"2251_CR63","doi-asserted-by":"crossref","unstructured":"Sen, S. (2005). Algorithms for stochastic mixed-integer programming models. In K. Aardal, G.\u00a0L. Nemhauser, & R. Weismantel (Eds), Discrete optimization, volume\u00a012 of Handbooks in operations research and management science (pp. 515\u2013558). Elsevier.","DOI":"10.1016\/S0927-0507(05)12009-X"},{"key":"2251_CR64","doi-asserted-by":"crossref","DOI":"10.1137\/1.9780898718751","volume-title":"Lectures on stochastic programming: Modeling and theory","author":"A Shapiro","year":"2009","unstructured":"Shapiro, A., Dentcheva, D., & Ruszczy\u0144ski, A. (2009). Lectures on stochastic programming: Modeling and theory (Vol. 9). Philadelphia: SIAM."},{"issue":"3","key":"2251_CR65","doi-asserted-by":"crossref","first-page":"317","DOI":"10.1002\/nav.3800180304","volume":"18","author":"V Srinivasan","year":"1971","unstructured":"Srinivasan, V. (1971). A hybrid algorithm for the one machine sequencing problem to minimize total tardiness. Naval Research Logistics Quarterly, 18(3), 317\u2013327.","journal-title":"Naval Research Logistics Quarterly"},{"issue":"6","key":"2251_CR66","doi-asserted-by":"crossref","first-page":"575","DOI":"10.1007\/s10951-008-0093-5","volume":"12","author":"S Tanaka","year":"2009","unstructured":"Tanaka, S., Fujikuma, S., & Araki, M. (2009). An exact algorithm for single-machine scheduling without machine idle time. Journal of Scheduling, 12(6), 575\u2013593.","journal-title":"Journal of Scheduling"},{"issue":"3","key":"2251_CR67","doi-asserted-by":"crossref","first-page":"405","DOI":"10.1287\/mnsc.9.3.405","volume":"9","author":"C Panne van de","year":"1963","unstructured":"van de Panne, C., & Popp, W. (1963). Minimum cost cattle feed under probabilistic protein constraints. Management Science, 9(3), 405\u2013430.","journal-title":"Management Science"},{"key":"2251_CR68","unstructured":"van der Vlerk, M.\u00a0H. (1996\u20132007). Stochastic integer programming bibliography. World Wide Web. http:\/\/www.eco.rug.nl\/mally\/biblio\/sip.html ."},{"issue":"4","key":"2251_CR69","doi-asserted-by":"crossref","first-page":"638","DOI":"10.1137\/0117061","volume":"17","author":"RM Slyke Van","year":"1969","unstructured":"Van Slyke, R. M., & Wets, R. (1969). L-shaped linear programs with applications to optimal control and stochastic programming. SIAM Journal on Applied Mathematics, 17(4), 638\u2013663.","journal-title":"SIAM Journal on Applied Mathematics"},{"key":"2251_CR70","volume-title":"Integer programming","author":"LA Wolsey","year":"1998","unstructured":"Wolsey, L. A. (1998). Integer programming. New York: Wiley."},{"issue":"4","key":"2251_CR71","doi-asserted-by":"crossref","first-page":"861","DOI":"10.1007\/s00291-010-0225-0","volume":"34","author":"D Wozabal","year":"2012","unstructured":"Wozabal, D. (2012). Value-at-risk optimization using the difference of convex algorithm. OR Spectrum, 34(4), 861\u2013883.","journal-title":"OR Spectrum"},{"issue":"3","key":"2251_CR72","doi-asserted-by":"crossref","first-page":"377","DOI":"10.1080\/02331931003700731","volume":"59","author":"D Wozabal","year":"2010","unstructured":"Wozabal, D., Hochreiter, R., & Pflug, G. C. (2010). A difference of convex formulation of value-at-risk constrained optimization. Optimization, 59(3), 377\u2013400.","journal-title":"Optimization"},{"issue":"8","key":"2251_CR73","doi-asserted-by":"crossref","first-page":"2348","DOI":"10.1016\/j.cor.2008.08.008","volume":"36","author":"CW Wu","year":"2009","unstructured":"Wu, C. W., Brown, K. N., & Beck, J. C. (2009). Scheduling with uncertain durations: Modeling $$\\beta $$ \u03b2 -robust scheduling with constraints. Computers and Operations Research, 36(8), 2348\u20132356.","journal-title":"Computers and Operations Research"},{"issue":"1","key":"2251_CR74","first-page":"87","volume":"20","author":"Y Yamai","year":"2002","unstructured":"Yamai, Y., & Yoshiba, T. (2002a). Comparative analyses of expected shortfall and value-at-risk: Their estimation error, decomposition, and optimization. Monetary and Economic Studies, 20(1), 87\u2013121.","journal-title":"Monetary and Economic Studies"},{"issue":"3","key":"2251_CR75","first-page":"181","volume":"20","author":"Y Yamai","year":"2002","unstructured":"Yamai, Y., & Yoshiba, T. (2002b). Comparative analysis with expected shortfall (3): Their validity under market stress. Monetary and Economic Studies, 20(3), 181\u2013237.","journal-title":"Monetary and Economic Studies"},{"issue":"1","key":"2251_CR76","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1023\/A:1013333232691","volume":"6","author":"J Yang","year":"2002","unstructured":"Yang, J., & Yu, G. (2002). On the robust single machine scheduling problem. Journal of Combinatorial Optimization, 6(1), 17\u201333.","journal-title":"Journal of Combinatorial Optimization"}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-016-2251-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10479-016-2251-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-016-2251-z","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-016-2251-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,5,16]],"date-time":"2020-05-16T23:57:55Z","timestamp":1589673475000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10479-016-2251-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,6,22]]},"references-count":76,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2017,1]]}},"alternative-id":["2251"],"URL":"https:\/\/doi.org\/10.1007\/s10479-016-2251-z","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"value":"0254-5330","type":"print"},{"value":"1572-9338","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,6,22]]}}}