{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,7]],"date-time":"2025-10-07T14:33:44Z","timestamp":1759847624163,"version":"3.37.3"},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2018,10,19]],"date-time":"2018-10-19T00:00:00Z","timestamp":1539907200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Sched"],"published-print":{"date-parts":[[2019,6]]},"DOI":"10.1007\/s10951-018-0588-7","type":"journal-article","created":{"date-parts":[[2018,10,19]],"date-time":"2018-10-19T11:55:01Z","timestamp":1539950101000},"page":"289-304","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["An approximation scheme for the bi-scenario sum of completion times trade-off problem"],"prefix":"10.1007","volume":"22","author":[{"given":"Miri","family":"Gilenson","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hussein","family":"Naseraldin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4747-142X","authenticated-orcid":false,"given":"Liron","family":"Yedidsion","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,10,19]]},"reference":[{"issue":"1","key":"588_CR1","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1016\/j.orl.2006.01.004","volume":"35","author":"E Angel","year":"2007","unstructured":"Angel, E., Bampis, E., & Fishkin, A. V. (2007). A note on scheduling to meet two min-sum objectives. Operations Research Letters, 35(1), 69\u201373.","journal-title":"Operations Research Letters"},{"issue":"1","key":"588_CR2","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1016\/j.ipl.2004.12.007","volume":"94","author":"E Angel","year":"2005","unstructured":"Angel, E., Bampis, E., & Gourves, L. (2005). Approximation results for a bicriteria job scheduling problem on a single machine without preemption. Information Processing Letters, 94(1), 19\u201327.","journal-title":"Information Processing Letters"},{"issue":"1","key":"588_CR3","doi-asserted-by":"publisher","first-page":"118","DOI":"10.1287\/opre.37.1.118","volume":"37","author":"U Bagchi","year":"1989","unstructured":"Bagchi, U. (1989). Simultaneous minimization of mean and variation of flow time and waiting time in single machine systems. Operations Research, 37(1), 118\u2013125.","journal-title":"Operations Research"},{"issue":"9","key":"588_CR4","doi-asserted-by":"publisher","first-page":"1610","DOI":"10.1016\/j.cor.2009.12.001","volume":"37","author":"IR Farias de","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"},{"issue":"4","key":"588_CR5","doi-asserted-by":"publisher","first-page":"425","DOI":"10.1007\/s002910000046","volume":"22","author":"M Ehrgott","year":"2000","unstructured":"Ehrgott, M., & Gandibleux, X. (2000). A survey and annotated bibliography of multiobjective combinatorial optimization. Or Spectrum, 22(4), 425\u2013460.","journal-title":"Or Spectrum"},{"key":"588_CR6","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":"588_CR7","first-page":"296","volume":"3","author":"YY Haimes","year":"1971","unstructured":"Haimes, Y. Y., Ladson, L. S., & Wismer, D. A. (1971). Bicriterion formulation of problems of integrated system identification and system optimization. IEEE Transactions on Systems Man and Cybernetics, 3, 296.","journal-title":"IEEE Transactions on Systems Man and Cybernetics"},{"issue":"3","key":"588_CR8","doi-asserted-by":"publisher","first-page":"513","DOI":"10.1287\/moor.22.3.513","volume":"22","author":"LA Hall","year":"1997","unstructured":"Hall, L. A., Schulz, A. S., Shmoys, D. B., & Wein, J. (1997). Scheduling to minimize average completion time: Off-line and on-line approximation algorithms. Mathematics of Operations Research, 22(3), 513\u2013544.","journal-title":"Mathematics of Operations Research"},{"key":"588_CR9","unstructured":"Hoogeveen, H. (1992). Single-machine bicriteria scheduling. Ph.D. thesis, Eindhoven University of Technology."},{"issue":"3","key":"588_CR10","doi-asserted-by":"publisher","first-page":"592","DOI":"10.1016\/j.ejor.2004.07.011","volume":"167","author":"H Hoogeveen","year":"2005","unstructured":"Hoogeveen, H. (2005). Multicriteria scheduling. European Journal of operational research, 167(3), 592\u2013623.","journal-title":"European Journal of operational research"},{"issue":"2","key":"588_CR11","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1007\/s10951-015-0444-y","volume":"19","author":"A Kasperski","year":"2016","unstructured":"Kasperski, A., & Zieli\u0144ski, P. (2016). Single machine scheduling problems with uncertain parameters and the OWA criterion. Journal of Scheduling, 19(2), 177\u2013190.","journal-title":"Journal of Scheduling"},{"issue":"2","key":"588_CR12","doi-asserted-by":"publisher","first-page":"411","DOI":"10.1287\/opre.1070.0413","volume":"56","author":"M Masin","year":"2008","unstructured":"Masin, M., & Bukchin, Y. (2008). Diversity maximization approach for multiobjective optimization. Operations Research, 56(2), 411\u20134.","journal-title":"Operations Research"},{"key":"588_CR13","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1016\/j.tcs.2012.12.006","volume":"477","author":"M Mastrolilli","year":"2013","unstructured":"Mastrolilli, M., Mutsanas, N., & Svensson, O. (2013). Single machine scheduling with scenarios. Theoretical Computer Science, 477, 57\u201366.","journal-title":"Theoretical Computer Science"},{"issue":"2","key":"588_CR14","doi-asserted-by":"publisher","first-page":"386","DOI":"10.1287\/opre.1120.1093","volume":"61","author":"S Mittal","year":"2013","unstructured":"Mittal, S., & Schulz, A. S. (2013). A general framework for designing approximation schemes for combinatorial optimization problems with many objectives combined into one. Operation Research, 61(2), 386\u2013397.","journal-title":"Operation Research"},{"key":"588_CR15","unstructured":"Papadimitriou, C. H., & Yannakakis, M. (2000). On the approximability of trade-offs and optimal access of web sources. In FOCS: IEEE Computer Society (pp. 86\u201392)."},{"issue":"1\u20132","key":"588_CR16","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(1\u20132), 59\u201366.","journal-title":"Naval Research Logistics Quarterly"},{"key":"588_CR17","volume-title":"Sequencing and scheduling with inaccurate data","author":"IN Sotskov","year":"2014","unstructured":"Sotskov, I. N., & Werner, F. (2014). Sequencing and scheduling with inaccurate data. Hauppauge, NY: Nova Science Publishers."},{"key":"588_CR18","volume-title":"Multicriteria scheduling: Theory, models and algorithms","author":"V T\u2019kindt","year":"2006","unstructured":"T\u2019kindt, V., & Billaut, J. C. (2006). Multicriteria scheduling: Theory, models and algorithms. Berlin: Springer."},{"issue":"1","key":"588_CR19","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":["Journal of Scheduling"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-018-0588-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10951-018-0588-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-018-0588-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,18]],"date-time":"2019-10-18T19:21:34Z","timestamp":1571426494000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10951-018-0588-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,10,19]]},"references-count":19,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2019,6]]}},"alternative-id":["588"],"URL":"https:\/\/doi.org\/10.1007\/s10951-018-0588-7","relation":{},"ISSN":["1094-6136","1099-1425"],"issn-type":[{"type":"print","value":"1094-6136"},{"type":"electronic","value":"1099-1425"}],"subject":[],"published":{"date-parts":[[2018,10,19]]},"assertion":[{"value":"19 October 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}