{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,18]],"date-time":"2025-12-18T09:23:23Z","timestamp":1766049803517,"version":"3.37.3"},"reference-count":20,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2021,10,23]],"date-time":"2021-10-23T00:00:00Z","timestamp":1634947200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,10,23]],"date-time":"2021-10-23T00:00:00Z","timestamp":1634947200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/100006221","name":"United States - Israel Binational Science Foundation","doi-asserted-by":"publisher","award":["2016049"],"award-info":[{"award-number":["2016049"]}],"id":[{"id":"10.13039\/100006221","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Ann Oper Res"],"published-print":{"date-parts":[[2021,12]]},"DOI":"10.1007\/s10479-021-04316-5","type":"journal-article","created":{"date-parts":[[2021,10,23]],"date-time":"2021-10-23T11:02:36Z","timestamp":1634986956000},"page":"153-173","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Scheduling in multi-scenario environment with an agreeable condition on job processing times"],"prefix":"10.1007","volume":"307","author":[{"given":"Miri","family":"Gilenson","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2709-599X","authenticated-orcid":false,"given":"Dvir","family":"Shabtay","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Liron","family":"Yedidsion","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rohit","family":"Malshe","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,10,23]]},"reference":[{"issue":"3","key":"4316_CR1","doi-asserted-by":"publisher","first-page":"338","DOI":"10.1016\/j.orl.2007.11.005","volume":"36","author":"MA Aloulou","year":"2008","unstructured":"Aloulou, M. A., & Della Croce, F. (2008). Complexity of single machine scheduling problems under scenario-based uncertainty. Operations Research Letters, 36(3), 338\u2013342.","journal-title":"Operations Research Letters"},{"issue":"2","key":"4316_CR2","doi-asserted-by":"publisher","first-page":"363","DOI":"10.1287\/mnsc.41.2.363","volume":"41","author":"RL Daniels","year":"1995","unstructured":"Daniels, R. L., & 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"},{"issue":"9","key":"4316_CR3","doi-asserted-by":"publisher","first-page":"1610","DOI":"10.1016\/j.cor.2009.12.001","volume":"37","author":"IR De Farias","year":"2010","unstructured":"De Farias, I. R., 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.","journal-title":"Computers and Operations Research"},{"key":"4316_CR4","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1016\/0377-2217(90)90088-S","volume":"47","author":"H Emmons","year":"1990","unstructured":"Emmons, H., & Pinedo, M. (1990). Scheduling stochastic jobs with due dates on parallel machines. European Journal of Operational Research, 47, 49\u201355.","journal-title":"European Journal of Operational Research"},{"issue":"3","key":"4316_CR5","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1007\/s10951-018-0588-7","volume":"22","author":"M Gilenson","year":"2018","unstructured":"Gilenson, M., Naseraldin, H., & Yedidsion, L. (2018). An approximation scheme for the bi-scenario sum of completion times trade-off problem. Journal of Scheduling, 22(3), 289\u2013304.","journal-title":"Journal of Scheduling"},{"issue":"8","key":"4316_CR6","first-page":"1","volume":"72","author":"M Gilenson","year":"2019","unstructured":"Gilenson, M., & Shabtay, D. (2019). Multi-scenario scheduling to maximize the weighted number of just-in-time jobs. Journal of the Operational Research Society, 72(8), 1\u201318.","journal-title":"Journal of the Operational Research Society"},{"key":"4316_CR7","doi-asserted-by":"publisher","first-page":"685","DOI":"10.2307\/3213099","volume":"16","author":"K Glazebrook","year":"1979","unstructured":"Glazebrook, K. (1979). Scheduling tasks with exponential service times on parallel processors. Journal of Applied Probability, 16, 685\u2013689.","journal-title":"Journal of Applied Probability"},{"key":"4316_CR8","doi-asserted-by":"publisher","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., & Kan, A. R. (1979). Optimization and approximation in deterministic sequencing and scheduling: A survey. Annals of Discrete Mathematics, 5, 287\u2013326.","journal-title":"Annals of Discrete Mathematics"},{"key":"4316_CR9","volume-title":"Inequalities","author":"GH Hardy","year":"1934","unstructured":"Hardy, G. H., Littlewood, J. E., & Polya, G. (1934). Inequalities. New York: Cambridge University Press."},{"issue":"9","key":"4316_CR10","doi-asserted-by":"publisher","first-page":"2644","DOI":"10.1007\/s00453-020-00702-w","volume":"82","author":"D Hermelin","year":"2020","unstructured":"Hermelin, D., Manoussakis, G., Pinedo, M., Shabtay, D., & Yedidsion, L. (2020). Parameterized multi-scenario single-machine scheduling problems. Algorithmica, 82(9), 2644\u20132667.","journal-title":"Algorithmica"},{"key":"4316_CR11","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1002\/nav.3800010110","volume":"1","author":"SM Johnson","year":"1954","unstructured":"Johnson, S. M. (1954). Optimal two-and-three-stage production schedules with set-up times included. Naval Research Logistics Quarterly, 1, 61\u201368.","journal-title":"Naval Research Logistics Quarterly"},{"key":"4316_CR12","doi-asserted-by":"publisher","first-page":"126","DOI":"10.1287\/opre.37.1.126","volume":"37","author":"T Kampke","year":"1989","unstructured":"Kampke, T. (1989). Optimal scheduling of jobs with exponential service times on identical parallel machines. Operations Research, 37, 126\u2013133.","journal-title":"Operations Research"},{"issue":"1","key":"4316_CR13","doi-asserted-by":"publisher","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":"5","key":"4316_CR14","first-page":"421","volume":"32","author":"P Kouvelis","year":"2000","unstructured":"Kouvelis, P., Daniels, R. L., & Vairaktarakis, G. (2000). Robust scheduling of a two-machine flow-shop with uncertain processing times. IIE Transactions, 32(5), 421\u2013432.","journal-title":"IIE Transactions"},{"issue":"7","key":"4316_CR15","doi-asserted-by":"publisher","first-page":"1682","DOI":"10.1016\/j.cor.2011.10.003","volume":"39","author":"CC 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":"7","key":"4316_CR16","first-page":"57","volume":"477","author":"M Mastrolilli","year":"2003","unstructured":"Mastrolilli, M., Mutsanas, N., & Svensson, O. (2003). Single machine flow-time scheduling with a single breakdown. Theoretical Computer Science, 477(7), 57\u201366.","journal-title":"Theoretical Computer Science"},{"issue":"1","key":"4316_CR17","doi-asserted-by":"publisher","first-page":"102","DOI":"10.1287\/mnsc.15.1.102","volume":"15","author":"JM Moore","year":"1968","unstructured":"Moore, J. M. (1968). An n job, one machine sequencing algorithm for minimizing the number of late jobs. Management Science, 15(1), 102\u2013109.","journal-title":"Management Science"},{"key":"4316_CR18","doi-asserted-by":"publisher","first-page":"851","DOI":"10.1287\/moor.2015.0757","volume":"41","author":"M Skutella","year":"2016","unstructured":"Skutella, M., Sviridenko, M., & Uetz, M. (2016). Unrelated machine scheduling with stochastic processing times. Mathematics of Operations Research, 41, 851\u2013864.","journal-title":"Mathematics of Operations Research"},{"key":"4316_CR19","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1002\/nav.3800030106","volume":"3","author":"WE Smith","year":"1956","unstructured":"Smith, W. E. (1956). Various optimizers for single-stage production. Naval Research Logistics Quarterly, 3, 59\u201366.","journal-title":"Naval Research Logistics Quarterly"},{"issue":"1","key":"4316_CR20","doi-asserted-by":"publisher","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":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-021-04316-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10479-021-04316-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-021-04316-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,11,15]],"date-time":"2021-11-15T16:32:27Z","timestamp":1636993947000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10479-021-04316-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,10,23]]},"references-count":20,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2021,12]]}},"alternative-id":["4316"],"URL":"https:\/\/doi.org\/10.1007\/s10479-021-04316-5","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"type":"print","value":"0254-5330"},{"type":"electronic","value":"1572-9338"}],"subject":[],"published":{"date-parts":[[2021,10,23]]},"assertion":[{"value":"13 September 2021","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"23 October 2021","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}