{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,11,19]],"date-time":"2023-11-19T00:32:06Z","timestamp":1700353926673},"reference-count":25,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2020,3,10]],"date-time":"2020-03-10T00:00:00Z","timestamp":1583798400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,3,10]],"date-time":"2020-03-10T00:00:00Z","timestamp":1583798400000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["4OR-Q J Oper Res"],"published-print":{"date-parts":[[2021,3]]},"DOI":"10.1007\/s10288-020-00434-1","type":"journal-article","created":{"date-parts":[[2020,3,10]],"date-time":"2020-03-10T14:02:55Z","timestamp":1583848975000},"page":"93-101","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Min-max controllable risk problems"],"prefix":"10.1007","volume":"19","author":[{"given":"Evgeny","family":"Gurevsky","sequence":"first","affiliation":[]},{"given":"Sergey","family":"Kovalev","sequence":"additional","affiliation":[]},{"given":"Mikhail Y.","family":"Kovalyov","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,3,10]]},"reference":[{"issue":"3","key":"434_CR1","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1016\/j.tcs.2009.08.019","volume":"412","author":"E \u00c1lvarez-Miranda","year":"2011","unstructured":"\u00c1lvarez-Miranda E, Chen X, Hu J, Hu X, Candia-V\u00e9jar A (2011) Deterministic risk control for cost-effective network connections. Theor Comput Sci 412(3):257\u2013264","journal-title":"Theor Comput Sci"},{"issue":"1","key":"434_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10255-014-0269-z","volume":"30","author":"E \u00c1lvarez-Miranda","year":"2014","unstructured":"\u00c1lvarez-Miranda E, Candia-V\u00e9jar A, Chen XJ, Hu XD, Li B (2014) Risk models for the prize collecting steiner tree problems with interval data. Acta Math Appl Sin Engl Ser 30(1):1\u201326","journal-title":"Acta Math Appl Sin Engl Ser"},{"issue":"3","key":"434_CR3","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1007\/s10288-011-0160-1","volume":"9","author":"FJ Arcelus","year":"2011","unstructured":"Arcelus FJ, Kumar S, Srinivasan G (2011) Channel coordination with manufacturer\u2019s return policies within a newsvendor framework. 4OR 9(3):279\u2013297","journal-title":"4OR"},{"issue":"3","key":"434_CR4","first-page":"37","volume":"3","author":"O Bor\u016fvka","year":"1926","unstructured":"Bor\u016fvka O (1926) O jist\u00e9m probl\u00e9mu minim\u00e1ln\u00edm. Pr\u00e1ce Moravsk\u00e9 Pr\u0306\u00edrodov\u0115deck\u00e9 Spolec\u0306nosti 3(3):37\u201353","journal-title":"Pr\u00e1ce Moravsk\u00e9 Pr\u0306\u00edrodov\u0115deck\u00e9 Spolec\u0306nosti"},{"issue":"6","key":"434_CR5","doi-asserted-by":"publisher","first-page":"1028","DOI":"10.1145\/355541.355562","volume":"47","author":"B Chazelle","year":"2000","unstructured":"Chazelle B (2000) A minimum spanning tree algorithm with inverse-Ackermann type complexity. J ACM 47(6):1028\u20131047","journal-title":"J ACM"},{"issue":"6","key":"434_CR6","doi-asserted-by":"publisher","first-page":"1893","DOI":"10.1016\/j.cor.2008.06.002","volume":"36","author":"X Chen","year":"2009","unstructured":"Chen X, Hu J, Hu X (2009a) A new model for path planning with interval data. Comput Oper Res 36(6):1893\u20131899","journal-title":"Comput Oper Res"},{"issue":"1","key":"434_CR7","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1016\/j.ejor.2008.06.039","volume":"198","author":"X Chen","year":"2009","unstructured":"Chen X, Hu J, Hu X (2009b) A polynomial solvable minimum risk spanning tree problem with interval data. Eur J Oper Res 198(1):43\u201346","journal-title":"Eur J Oper Res"},{"issue":"2","key":"434_CR8","doi-asserted-by":"publisher","first-page":"617","DOI":"10.1137\/S1052623495288192","volume":"8","author":"TCE Cheng","year":"1998","unstructured":"Cheng TCE, Janiak A, Kovalyov MY (1998) Bicriterion single machine scheduling with resource dependent processing times. SIAM J Optim 8(2):617\u2013630","journal-title":"SIAM J Optim"},{"issue":"2","key":"434_CR9","doi-asserted-by":"publisher","first-page":"751","DOI":"10.1016\/j.ejor.2005.06.021","volume":"175","author":"TCE Cheng","year":"2006","unstructured":"Cheng TCE, Kovalyov MY, Shakhlevich NV (2006) Scheduling with controllable release dates and processing times: Makespan minimization. Eur J Oper Res 175(2):751\u2013768","journal-title":"Eur J Oper Res"},{"issue":"4","key":"434_CR10","doi-asserted-by":"publisher","first-page":"375","DOI":"10.1007\/s10288-010-0129-5","volume":"8","author":"EG Coffman Jr","year":"2010","unstructured":"Coffman EG Jr, Matsypura D, Timkovsky VG (2010) Strategy vs risk in margining portfolios of options. 4OR 8(4):375\u2013386","journal-title":"4OR"},{"issue":"1","key":"434_CR11","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1007\/BF01386390","volume":"1","author":"EW Dijkstra","year":"1959","unstructured":"Dijkstra EW (1959) A note on two problems in connexion with graphs. Numer Math 1(1):269\u2013271","journal-title":"Numer Math"},{"key":"434_CR12","volume-title":"Multicriteria optimization","author":"M Ehrgott","year":"2005","unstructured":"Ehrgott M (2005) Multicriteria optimization, 2nd edn. Springer, Berlin","edition":"2"},{"issue":"3","key":"434_CR13","doi-asserted-by":"publisher","first-page":"596","DOI":"10.1145\/28869.28874","volume":"34","author":"ML Fredman","year":"1987","unstructured":"Fredman ML, Tarjan RE (1987) Fibonacci heaps and their uses in improved network optimization algorithms. J ACM 34(3):596\u2013615","journal-title":"J ACM"},{"issue":"1","key":"434_CR14","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1007\/s10107-006-0059-3","volume":"110","author":"A Grigoriev","year":"2007","unstructured":"Grigoriev A, Sviridenko M, Uetz M (2007) Machine scheduling with resource dependent processing times. Math Program Ser B 110(1):209\u2013228","journal-title":"Math Program Ser B"},{"issue":"1","key":"434_CR15","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1007\/s10255-008-8812-4","volume":"26","author":"J Hu","year":"2010","unstructured":"Hu J (2010) Minimizing maximum risk for fair network connection with interval data. Acta Math Appl Sin Engl Ser 26(1):33\u201340","journal-title":"Acta Math Appl Sin Engl Ser"},{"issue":"2","key":"434_CR16","doi-asserted-by":"publisher","first-page":"284","DOI":"10.1016\/0377-2217(96)00129-4","volume":"94","author":"A Janiak","year":"1996","unstructured":"Janiak A, Kovalyov MY (1996) Single machine scheduling subject to deadlines and resource dependent processing times. Eur J Oper Res 94(2):284\u2013291","journal-title":"Eur J Oper Res"},{"issue":"2","key":"434_CR17","doi-asserted-by":"publisher","first-page":"416","DOI":"10.1016\/j.ejor.2004.04.012","volume":"165","author":"A Janiak","year":"2005","unstructured":"Janiak A, Kovalyov MY, Kubiak W, Werner F (2005) Positive half-products and scheduling with controllable processing times. Eur J Oper Res 165(2):416\u2013422","journal-title":"Eur J Oper Res"},{"issue":"4","key":"434_CR18","doi-asserted-by":"publisher","first-page":"414","DOI":"10.1287\/moor.4.4.414","volume":"4","author":"N Megiddo","year":"1979","unstructured":"Megiddo N (1979) Combinatorial optimization with rational objective functions. Math Oper Res 4(4):414\u2013424","journal-title":"Math Oper Res"},{"issue":"5","key":"434_CR19","doi-asserted-by":"publisher","first-page":"499","DOI":"10.1057\/palgrave.jors.2601537","volume":"54","author":"CT Ng","year":"2003","unstructured":"Ng CT, Cheng TCE, Kovalyov MY (2003) Batch scheduling with controllable setup and processing times to minimize total completion time. J Oper Res Soc 54(5):499\u2013506","journal-title":"J Oper Res Soc"},{"key":"434_CR20","doi-asserted-by":"publisher","first-page":"429","DOI":"10.1007\/978-1-4613-0303-9_6","volume-title":"Handbook of combinatorial optimization","author":"T Radzik","year":"1998","unstructured":"Radzik T (1998) Fractional combinatorial optimization. In: Du DZ, Pardalos PM (eds) Handbook of combinatorial optimization, vol 3. Springer, New York, pp 429\u2013478"},{"issue":"2","key":"434_CR21","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1007\/s10288-010-0125-9","volume":"8","author":"MG Scutell\u00e0","year":"2010","unstructured":"Scutell\u00e0 MG, Recchia R (2010) Robust portfolio asset allocation and risk measures. 4OR 8(2):113\u2013139","journal-title":"4OR"},{"issue":"2","key":"434_CR22","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1007\/s10288-003-0028-0","volume":"2","author":"M Sevaux","year":"2004","unstructured":"Sevaux M, S\u00f6rensen K (2004) A genetic algorithm for robust schedules in a one-machine environment with ready times and due dates. 4OR 2(2):129\u2013147","journal-title":"4OR"},{"key":"434_CR23","doi-asserted-by":"publisher","first-page":"1643","DOI":"10.1016\/j.dam.2007.02.003","volume":"155","author":"D Shabtay","year":"2007","unstructured":"Shabtay D, Steiner G (2007) A survey of scheduling with controllable processing times. Discrete Appl Math 155:1643\u20131666","journal-title":"Discrete Appl Math"},{"issue":"2","key":"434_CR24","doi-asserted-by":"publisher","first-page":"495","DOI":"10.1007\/s10107-014-0814-9","volume":"153","author":"A Shioura","year":"2015","unstructured":"Shioura A, Shakhlevich NV, Strusevich VA (2015) Decomposition algorithms for submodular optimization with applications to parallel machine scheduling with controllable processing times. Math Program Ser A 153(2):495\u2013534","journal-title":"Math Program Ser A"},{"key":"434_CR25","volume-title":"Multicriteria scheduling: theory, models and algorithms","author":"V T\u2019kindt","year":"2006","unstructured":"T\u2019kindt V, Billaut JC (2006) Multicriteria scheduling: theory, models and algorithms, 2nd edn. Springer, Berlin","edition":"2"}],"container-title":["4OR"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10288-020-00434-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10288-020-00434-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10288-020-00434-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,3,24]],"date-time":"2021-03-24T10:04:43Z","timestamp":1616580283000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10288-020-00434-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,3,10]]},"references-count":25,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2021,3]]}},"alternative-id":["434"],"URL":"https:\/\/doi.org\/10.1007\/s10288-020-00434-1","relation":{},"ISSN":["1619-4500","1614-2411"],"issn-type":[{"value":"1619-4500","type":"print"},{"value":"1614-2411","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,3,10]]},"assertion":[{"value":"31 October 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 February 2020","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 March 2020","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Compliance with ethical standards"}},{"value":"The authors declare that they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}