{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T12:37:40Z","timestamp":1759667860008,"version":"3.37.3"},"reference-count":43,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2016,8,16]],"date-time":"2016-08-16T00:00:00Z","timestamp":1471305600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001824","name":"Czech Science Foundation","doi-asserted-by":"publisher","award":["P402\/12\/G097"],"award-info":[{"award-number":["P402\/12\/G097"]}],"id":[{"id":"10.13039\/501100001824","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Comput Manag Sci"],"published-print":{"date-parts":[[2017,1]]},"DOI":"10.1007\/s10287-016-0262-5","type":"journal-article","created":{"date-parts":[[2016,8,16]],"date-time":"2016-08-16T09:51:37Z","timestamp":1471341097000},"page":"161-177","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Flow-based formulations for operational fixed interval scheduling problems with random delays"],"prefix":"10.1007","volume":"14","author":[{"given":"Martin","family":"Branda","sequence":"first","affiliation":[]},{"given":"\u0160t\u011bp\u00e1n","family":"H\u00e1jek","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,8,16]]},"reference":[{"issue":"5","key":"262_CR1","doi-asserted-by":"publisher","first-page":"1263","DOI":"10.1080\/02331934.2013.855211","volume":"64","author":"W Ackooij van","year":"2015","unstructured":"van Ackooij W (2015) Eventual convexity of chance constrained feasible sets. Optimization 64(5):1263\u20131284. doi: 10.1080\/02331934.2013.855211","journal-title":"Optimization"},{"key":"262_CR2","doi-asserted-by":"publisher","unstructured":"van Ackooij W, de Oliveira W (2016) Convexity and optimization with copula structured probabilistic constraints. Optimization, to appear:1\u201328. doi: 10.1080\/02331934.2016.1179302","DOI":"10.1080\/02331934.2016.1179302"},{"issue":"29","key":"262_CR3","doi-asserted-by":"publisher","first-page":"3650","DOI":"10.1016\/j.tcs.2011.03.025","volume":"412","author":"E Angelelli","year":"2011","unstructured":"Angelelli E, Filippi C (2011) On the complexity of interval scheduling with a resource constraint. Theor Comput Sci 412(29):3650\u20133657. doi: 10.1016\/j.tcs.2011.03.025","journal-title":"Theor Comput Sci"},{"key":"262_CR4","doi-asserted-by":"publisher","first-page":"268","DOI":"10.1016\/j.cor.2014.06.002","volume":"51","author":"E Angelelli","year":"2014","unstructured":"Angelelli E, Bianchessi N, Filippi C (2014) Optimal interval scheduling with a resource constraint. Comput Oper Res 51:268\u2013281. doi: 10.1016\/j.cor.2014.06.002","journal-title":"Comput Oper Res"},{"issue":"1","key":"262_CR5","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1007\/s10479-009-0670-9","volume":"177","author":"P Beraldi","year":"2010","unstructured":"Beraldi P, Bruni M (2010) An exact approach for solving integer problems under probabilistic constraints with random technology matrix. Ann Oper Res 177(1):127\u2013137. doi: 10.1007\/s10479-009-0670-9","journal-title":"Ann Oper Res"},{"issue":"3","key":"262_CR6","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1016\/j.orl.2012.01.002","volume":"40","author":"M Branda","year":"2012","unstructured":"Branda M (2012) Sample approximation technique for mixed-integer stochastic programming problems with several chance constraints. Oper Res Lett 40(3):207\u2013211. doi: 10.1016\/j.orl.2012.01.002","journal-title":"Oper Res Lett"},{"key":"262_CR7","unstructured":"Branda M, Novotn\u00fd J, Olstad A, Popela P (2015) A note on fixed interval scheduling with stochastic elements. Inform Bull Czech Stat Soc 26(4):1\u20137. http:\/\/www.statspol.cz\/en"},{"key":"262_CR8","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1016\/j.cie.2015.12.021","volume":"93","author":"M Branda","year":"2016","unstructured":"Branda M, Novotn\u00fd J, Olstad A (2016) Fixed interval scheduling under uncertainty a tabu search algorithm for an extended robust coloring formulation. Comput Ind Eng 93:45\u201354. doi: 10.1016\/j.cie.2015.12.021","journal-title":"Comput Ind Eng"},{"issue":"3","key":"262_CR9","doi-asserted-by":"publisher","first-page":"435","DOI":"10.1007\/s10287-015-0228-z","volume":"12","author":"I Bremer","year":"2015","unstructured":"Bremer I, Henrion R, M\u00f6ller A (2015) Probabilistic constraints via SQP solver: application to a renewable energy management problem. Comput Manag Sci 12(3):435\u2013459. doi: 10.1007\/s10287-015-0228-z","journal-title":"Comput Manag Sci"},{"issue":"3","key":"262_CR10","doi-asserted-by":"publisher","first-page":"467","DOI":"10.1016\/j.ejor.2010.11.017","volume":"210","author":"P Brucker","year":"2011","unstructured":"Brucker P, Qu R, Burke E (2011) Personnel scheduling: models and complexity. Eur J Oper Res 210(3):467\u2013473. doi: 10.1016\/j.ejor.2010.11.017","journal-title":"Eur J Oper Res"},{"issue":"1","key":"262_CR11","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1007\/s10479-014-1687-2","volume":"239","author":"JA Castillo-Salazar","year":"2016","unstructured":"Castillo-Salazar JA, Landa-Silva D, Qu R (2016) Workforce scheduling and routing problems: literature survey and computational study. Ann Oper Res 239(1):39\u201367. doi: 10.1007\/s10479-014-1687-2","journal-title":"Ann Oper Res"},{"issue":"7","key":"262_CR12","doi-asserted-by":"publisher","first-page":"1283","DOI":"10.1007\/s11590-015-0854-y","volume":"9","author":"J Cheng","year":"2015","unstructured":"Cheng J, Houda M, Lisser A (2015) Chance constrained 0\u20131 quadratic programs using copulas. Optim Lett 9(7):1283\u20131295. doi: 10.1007\/s11590-015-0854-y","journal-title":"Optim Lett"},{"key":"262_CR13","unstructured":"CPLEX (version 12.1) IBM ILOG V12.1: user\u2019s manual for CPLEX. ftp:\/\/public.dhe.ibm.com\/software\/websphere\/ilog\/docs\/optimization\/cplex\/ps_usrmancplex.pdf . Accessed 12 Aug 2016"},{"issue":"1","key":"262_CR14","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1007\/s10479-011-0884-5","volume":"200","author":"D Dentcheva","year":"2012","unstructured":"Dentcheva D, Martinez G (2012) Augmented Lagrangian method for probabilistic optimization. Ann Oper Res 200(1):109\u2013130. doi: 10.1007\/s10479-011-0884-5","journal-title":"Ann Oper Res"},{"issue":"12","key":"262_CR15","doi-asserted-by":"publisher","first-page":"1449","DOI":"10.1080\/0305215X.2012.743532","volume":"45","author":"DT Eliiyi","year":"2013","unstructured":"Eliiyi DT (2013) Integrating tactical and operational decisions in fixed job scheduling. Eng Optim 45(12):1449\u20131467. doi: 10.1080\/0305215X.2012.743532","journal-title":"Eng Optim"},{"key":"262_CR16","unstructured":"GAMS (version 24.3.3) GAMS user\u2019s guide. http:\/\/www.gams.com\/help\/index.jsp"},{"key":"262_CR17","unstructured":"Henrion R, Strugarek C (2011) Stochastic optimization methods in finance and energy: new financial products and energy market strategies. In: Convexity of chance constraints with dependent random variables: the use of copulae. Springer, New York, pp 427\u2013439"},{"key":"262_CR18","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4419-7729-8","volume-title":"Stochastic linear programming: models, theory, and computation. International series in operations research & management science","author":"P Kall","year":"2011","unstructured":"Kall P, Mayer J (2011) Stochastic linear programming: models, theory, and computation. International series in operations research & management science. Springer, New York"},{"issue":"2","key":"262_CR19","doi-asserted-by":"publisher","first-page":"152","DOI":"10.1007\/BF01832852","volume":"10","author":"CH Kimberling","year":"1974","unstructured":"Kimberling CH (1974) A probabilistic interpretation of complete monotonicity. Aequ Math 10(2):152\u2013164. doi: 10.1007\/BF01832852","journal-title":"Aequ Math"},{"issue":"1","key":"262_CR20","doi-asserted-by":"publisher","first-page":"391","DOI":"10.1007\/s10107-013-0728-y","volume":"147","author":"A Kogan","year":"2014","unstructured":"Kogan A, Lejeune MA (2014) Threshold boolean form for joint probabilistic constraints with random technology matrix. Math Progr 147(1):391\u2013427. doi: 10.1007\/s10107-013-0728-y","journal-title":"Math Progr"},{"issue":"5","key":"262_CR21","doi-asserted-by":"crossref","first-page":"530","DOI":"10.1002\/nav.20231","volume":"54","author":"AW Kolen","year":"2007","unstructured":"Kolen AW, Lenstra JK, Papadimitriou CH, Spieksma FC (2007) Interval scheduling: a survey. Naval Res Logist 54(5):530\u2013543","journal-title":"Naval Res Logist"},{"issue":"2","key":"262_CR22","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1016\/j.ejor.2006.01.049","volume":"178","author":"MY Kovalyov","year":"2007","unstructured":"Kovalyov MY, Ng C, Cheng TE (2007) Fixed interval scheduling: models, applications, computational complexity and algorithms. Eur J Oper Res 178(2):331\u2013342. doi: 10.1016\/j.ejor.2006.01.049","journal-title":"Eur J Oper Res"},{"issue":"1","key":"262_CR23","doi-asserted-by":"publisher","first-page":"190","DOI":"10.1016\/0377-2217(93)E0335-U","volume":"82","author":"LG Kroon","year":"1995","unstructured":"Kroon LG, Salomon M, Wassenhove LNV (1995) Exact and approximation algorithms for the operational fixed interval scheduling problem. Eur J Oper Res 82(1):190\u2013205. doi: 10.1016\/0377-2217(93)E0335-U","journal-title":"Eur J Oper Res"},{"issue":"4","key":"262_CR24","doi-asserted-by":"crossref","first-page":"624","DOI":"10.1287\/opre.45.4.624","volume":"45","author":"LG Kroon","year":"1997","unstructured":"Kroon LG, Salomon M, Wassenhove LNV (1997) Exact and approximation algorithms for the tactical fixed interval scheduling problem. Oper Res 45(4):624\u2013638","journal-title":"Oper Res"},{"issue":"2","key":"262_CR25","doi-asserted-by":"publisher","first-page":"674","DOI":"10.1137\/070702928","volume":"19","author":"J Luedtke","year":"2008","unstructured":"Luedtke J, Ahmed S (2008) A sample approximation approach for optimization with probabilistic constraints. SIAM J Optim 19(2):674\u2013699. doi: 10.1137\/070702928","journal-title":"SIAM J Optim"},{"issue":"2","key":"262_CR26","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1007\/s10107-008-0247-4","volume":"122","author":"J Luedtke","year":"2010","unstructured":"Luedtke J, Ahmed S, Nemhauser G (2010) An integer programming approach for linear programs with probabilistic constraints. Math Progr 122(2):247\u2013272. doi: 10.1007\/s10107-008-0247-4","journal-title":"Math Progr"},{"key":"262_CR27","unstructured":"Mathematica (version 9) Wolfram documentation center. http:\/\/reference.wolfram.com\/language\/"},{"issue":"5B","key":"262_CR28","doi-asserted-by":"publisher","first-page":"3059","DOI":"10.1214\/07-AOS556","volume":"37","author":"AJ McNeil","year":"2009","unstructured":"McNeil AJ, Ne\u0161lehov\u00e1 J (2009) Multivariate archimedean copulas, d-monotone functions and $$l_1$$ l 1 -norm symmetric distributions. Ann Stat 37(5B):3059\u20133097. doi: 10.1214\/07-AOS556","journal-title":"Ann Stat"},{"key":"262_CR29","volume-title":"Quantitative risk management: concepts, techniques and tools. Princeton series in finance","author":"AJ McNeil","year":"2005","unstructured":"McNeil AJ, Frey R, Embrechts P (2005) Quantitative risk management: concepts, techniques and tools. Princeton series in finance. Princeton University Press, Princeton"},{"issue":"8","key":"262_CR30","doi-asserted-by":"publisher","first-page":"1477","DOI":"10.1007\/s11590-014-0829-4","volume":"9","author":"DP Michalopoulos","year":"2015","unstructured":"Michalopoulos DP, Barnes JW, Morton DP (2015) Prioritized interdiction of nuclear smuggling via tabu search. Optim Lett 9(8):1477\u20131494. doi: 10.1007\/s11590-014-0829-4","journal-title":"Optim Lett"},{"key":"262_CR31","doi-asserted-by":"publisher","first-page":"429","DOI":"10.1016\/j.cie.2015.10.002","volume":"90","author":"JM Molina-Pariente","year":"2015","unstructured":"Molina-Pariente JM, Hans EW, Framinan JM, Gomez-Cia T (2015) New heuristics for planning operating rooms. Comput Ind Eng 90:429\u2013443. doi: 10.1016\/j.cie.2015.10.002","journal-title":"Comput Ind Eng"},{"key":"262_CR32","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4757-3076-0","volume-title":"An introduction to copulas. Lecture notes in statistics","author":"R Nelsen","year":"1999","unstructured":"Nelsen R (1999) An introduction to copulas. Lecture notes in statistics. Springer, New York"},{"issue":"10","key":"262_CR33","doi-asserted-by":"publisher","first-page":"1571","DOI":"10.1057\/jors.2013.109","volume":"65","author":"CT Ng","year":"2014","unstructured":"Ng CT, Cheng TCE, Bandalouski AM, Kovalyov MY, Lam SS (2014) A graph-theoretic approach to interval scheduling. J Oper Res Soc 65(10):1571\u20131579. doi: 10.1057\/jors.2013.109","journal-title":"J Oper Res Soc"},{"key":"262_CR34","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1016\/j.omega.2015.01.003","volume":"53","author":"A Parisio","year":"2015","unstructured":"Parisio A, Jones CN (2015) A two-stage stochastic programming approach to employee scheduling in retail outlets with uncertain demand. Omega 53:97\u2013103. doi: 10.1016\/j.omega.2015.01.003","journal-title":"Omega"},{"key":"262_CR35","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. Kluwer, Acad\u00e9miai Kiad\u00f3, Dordrecht and Budapest"},{"key":"262_CR36","doi-asserted-by":"publisher","unstructured":"Pr\u00e9kopa A (2003) Probabilistic programming. In: Ruszczy\u0144ski A, Shapiro A (eds) Stochastic programming, handbooks in operations research and management science, vol 10. Elsevier, pp 267\u2013351. doi: 10.1016\/S0927-0507(03)10005-9","DOI":"10.1016\/S0927-0507(03)10005-9"},{"key":"262_CR37","volume-title":"Stochastic programming. Handbooks in operations research and management science","author":"A Ruszczy\u0144ski","year":"2003","unstructured":"Ruszczy\u0144ski A, Shapiro A (2003) Stochastic programming. Handbooks in operations research and management science. Elsevier, Amsterdam"},{"key":"262_CR38","volume-title":"Combinatorial optimization: polyhedra and efficiency. Algorithms and combinatorics","author":"A Schrijver","year":"2003","unstructured":"Schrijver A (2003) Combinatorial optimization: polyhedra and efficiency. Algorithms and combinatorics. Springer, New York"},{"issue":"1","key":"262_CR39","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1007\/s10957-013-0513-3","volume":"163","author":"F Shan","year":"2014","unstructured":"Shan F, Zhang L, Xiao X (2014) A smoothing function approach to joint chance-constrained programs. J Optim Theory Appl 163(1):181\u2013199. doi: 10.1007\/s10957-013-0513-3","journal-title":"J Optim Theory Appl"},{"key":"262_CR40","doi-asserted-by":"crossref","DOI":"10.1137\/1.9780898718751","volume-title":"Lectures on stochastic programming. MOS-SIAM series on optimization","author":"A Shapiro","year":"2009","unstructured":"Shapiro A, Dentcheva D, Ruszczy\u0144ski A (2009) Lectures on stochastic programming. MOS-SIAM series on optimization. SIAM Society for Industrial and Applied Mathematics, Philadelphia"},{"issue":"2","key":"262_CR41","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1007\/s10288-014-0279-y","volume":"13","author":"M Tahanan","year":"2015","unstructured":"Tahanan M, van Ackooij W, Frangioni A, Lacalandra F (2015) Large-scale unit commitment under uncertainty. 4OR 13(2):115\u2013171. doi: 10.1007\/s10288-014-0279-y","journal-title":"4OR"},{"key":"262_CR42","unstructured":"Toth P, Vigo D (2001) The vehicle routing problem. In: An overview of vehicle routing problems. Society for Industrial and Applied Mathematics, Philadelphia, PA, USA, pp 1\u201326"},{"issue":"3","key":"262_CR43","doi-asserted-by":"publisher","first-page":"546","DOI":"10.1016\/S0377-2217(02)00362-4","volume":"148","author":"J Y\u00e1nez","year":"2003","unstructured":"Y\u00e1nez J, Ram\u00edrez J (2003) The robust coloring problem. Eur J Oper Res 148(3):546\u2013558. doi: 10.1016\/S0377-2217(02)00362-4","journal-title":"Eur J Oper Res"}],"container-title":["Computational Management Science"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10287-016-0262-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10287-016-0262-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10287-016-0262-5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10287-016-0262-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,24]],"date-time":"2017-06-24T16:48:27Z","timestamp":1498322907000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10287-016-0262-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,8,16]]},"references-count":43,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2017,1]]}},"alternative-id":["262"],"URL":"https:\/\/doi.org\/10.1007\/s10287-016-0262-5","relation":{},"ISSN":["1619-697X","1619-6988"],"issn-type":[{"type":"print","value":"1619-697X"},{"type":"electronic","value":"1619-6988"}],"subject":[],"published":{"date-parts":[[2016,8,16]]}}}