{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,22]],"date-time":"2026-07-22T17:02:38Z","timestamp":1784739758813,"version":"3.55.0"},"reference-count":22,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2026,6,30]],"date-time":"2026-06-30T00:00:00Z","timestamp":1782777600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,6,30]],"date-time":"2026-06-30T00:00:00Z","timestamp":1782777600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100004543","name":"China Scholarship Council","doi-asserted-by":"publisher","award":["202208070096"],"award-info":[{"award-number":["202208070096"]}],"id":[{"id":"10.13039\/501100004543","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2026,7]]},"DOI":"10.1007\/s10878-026-01436-1","type":"journal-article","created":{"date-parts":[[2026,6,30]],"date-time":"2026-06-30T03:52:39Z","timestamp":1782791559000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Approximating multi-scenario efficient solutions for an uncertain bi-criteria parallel machine scheduling problem"],"prefix":"10.1007","volume":"51","author":[{"given":"Xiechen","family":"Zhang","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6759-809X","authenticated-orcid":false,"given":"Eric","family":"Angel","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Feng","family":"Chu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Damien","family":"Regnault","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2026,6,30]]},"reference":[{"issue":"1\u20133","key":"1436_CR1","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1016\/S0304-3975(03)00288-3","volume":"306","author":"E Angel","year":"2003","unstructured":"Angel E, Bampis E, Kononov A (2003) On the approximate tradeoff for bicriteria batching and parallel machine scheduling problems. Theoret Comput Sci 306(1\u20133):319\u2013338","journal-title":"Theoret Comput Sci"},{"issue":"4","key":"1436_CR2","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1007\/s10951-005-1637-6","volume":"8","author":"E Bampis","year":"2005","unstructured":"Bampis E, Kononov A (2005) Bicriteria approximation algorithms for scheduling problems with communications delays. J Sched 8(4):281\u2013294","journal-title":"J Sched"},{"key":"1436_CR3","doi-asserted-by":"publisher","first-page":"430","DOI":"10.1016\/j.ejor.2018.08.020","volume":"273","author":"M Botte","year":"2019","unstructured":"Botte M, Sch\u00f6bel A (2019) Dominance for multi-objective robust optimization concepts. Eur J Oper Res 273:430\u2013440","journal-title":"Eur J Oper Res"},{"key":"1436_CR4","doi-asserted-by":"crossref","unstructured":"Chakrabarti S, Phillips CA, Schulz AS, Shmoys DB, Stein C, Wein J (1996) Improved scheduling algorithms for minsum criteria. In: Automata, languages and programming: 23rd international colloquium, ICALP \u201996, Paderborn, Germany, July 8\u201312, 1996, Proceedings. pp 646\u2013657. Springer","DOI":"10.1007\/3-540-61440-0_166"},{"issue":"4","key":"1436_CR5","doi-asserted-by":"publisher","first-page":"1340","DOI":"10.1137\/080724514","volume":"39","author":"I Diakonikolas","year":"2010","unstructured":"Diakonikolas I, Yannakakis M (2010) Small approximate Pareto sets for biobjective shortest paths and other problems. SIAM J Comput 39(4):1340\u20131371","journal-title":"SIAM J Comput"},{"issue":"4","key":"1436_CR6","doi-asserted-by":"publisher","first-page":"797","DOI":"10.1287\/opre.41.4.797","volume":"41","author":"BT Eck","year":"1993","unstructured":"Eck BT, Pinedo M (1993) On the minimization of the makespan subject to flowtime optimality. Oper Res 41(4):797\u2013801","journal-title":"Oper Res"},{"key":"1436_CR7","unstructured":"Ehrgott M (2005) Multicriteria optimization, vol. 491. Springer Science & Business Media"},{"issue":"2","key":"1436_CR8","doi-asserted-by":"publisher","first-page":"357","DOI":"10.1016\/j.ejor.2019.08.040","volume":"281","author":"A Engau","year":"2020","unstructured":"Engau A, Sigler D (2020) Pareto solutions in multicriteria optimization under uncertainty. Eur J Oper Res 281(2):357\u2013368","journal-title":"Eur J Oper Res"},{"key":"1436_CR9","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1016\/S0167-5060(08)70356-X","volume":"5","author":"RL Graham","year":"1979","unstructured":"Graham RL, Lawler EL, Lenstra JK, Rinnooy Kan AHG (1979) Optimization and approximation in deterministic sequencing and scheduling: a survey. Ann Discrete Math 5:287\u2013326","journal-title":"Ann Discrete Math"},{"issue":"1","key":"1436_CR10","doi-asserted-by":"publisher","first-page":"409","DOI":"10.1137\/25M1739182","volume":"36","author":"C Guti\u00e9rrez","year":"2026","unstructured":"Guti\u00e9rrez C, Hern\u00e1ndez E (2026) Efficient solutions in uncertain multiobjective optimization with countably many scenarios. SIAM J Optim 36(1):409\u2013433","journal-title":"SIAM J Optim"},{"issue":"1","key":"1436_CR11","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1007\/s10898-020-00951-7","volume":"80","author":"A Herzel","year":"2021","unstructured":"Herzel A, Bazgan C, Ruzika S, Thielen C, Vanderpooten D (2021) One-exact approximate Pareto sets. J Global Optim 80(1):87\u2013115","journal-title":"J Global Optim"},{"issue":"4","key":"1436_CR12","first-page":"1284","volume":"33","author":"A Herzel","year":"2021","unstructured":"Herzel A, Ruzika S, Thielen C (2021) Approximation methods for multiobjective optimization problems: a survey. INFORMS J Comput 33(4):1284\u20131299","journal-title":"INFORMS J Comput"},{"issue":"4","key":"1436_CR13","doi-asserted-by":"publisher","first-page":"463","DOI":"10.1145\/321906.321909","volume":"22","author":"OH Ibarra","year":"1975","unstructured":"Ibarra OH, Kim CE (1975) Fast approximation algorithms for the knapsack and sum of subset problems. J ACM 22(4):463\u2013468","journal-title":"J ACM"},{"issue":"1","key":"1436_CR14","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1007\/s00291-015-0418-7","volume":"38","author":"J Ide","year":"2016","unstructured":"Ide J, Schobel A (2016) Robustness for uncertain multi-objective optimization: a survey and analysis of different concepts. OR Spectrum 38(1):235\u2013271","journal-title":"OR Spectrum"},{"issue":"2","key":"1436_CR15","doi-asserted-by":"publisher","first-page":"594","DOI":"10.1016\/j.ejor.2022.06.021","volume":"305","author":"X Jiang","year":"2023","unstructured":"Jiang X, Lee K, Pinedo ML (2023) Approximation algorithms for bicriteria scheduling problems on identical parallel machines for makespan and total completion time. Eur J Oper Res 305(2):594\u2013607","journal-title":"Eur J Oper Res"},{"key":"1436_CR16","doi-asserted-by":"crossref","unstructured":"Papadimitriou CH, Yannakakis M (2000) On the approximability of trade-offs and optimal access of web sources. In: Proceedings of the 41st annual symposium on foundations of computer science (FOCS), pp 86\u201392. IEEE","DOI":"10.1109\/SFCS.2000.892068"},{"issue":"1","key":"1436_CR17","doi-asserted-by":"publisher","first-page":"116","DOI":"10.1145\/321921.321934","volume":"23","author":"SK Sahni","year":"1976","unstructured":"Sahni SK (1976) Algorithms for scheduling independent tasks. J ACM 23(1):116\u2013127","journal-title":"J ACM"},{"key":"1436_CR18","unstructured":"Sharir M, Agarwal PK (2010) Davenport-Schinzel sequences and their geometric applications. Cambridge University Press"},{"key":"1436_CR19","doi-asserted-by":"crossref","unstructured":"Sharir M, Welzl E (1992) A combinatorial bound for linear programming and related problems. In: Annual symposium on theoretical aspects of computer science (STACS), pp 567\u2013579. Springer","DOI":"10.1007\/3-540-55210-3_213"},{"issue":"3","key":"1436_CR20","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1016\/S0167-6377(97)00025-4","volume":"21","author":"C Stein","year":"1997","unstructured":"Stein C, Wein J (1997) On the existence of schedules that are near-optimal for both makespan and total weighted completion time. Oper Res Lett 21(3):115\u2013122","journal-title":"Oper Res Lett"},{"issue":"1","key":"1436_CR21","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1287\/ijoc.12.1.57.11901","volume":"12","author":"GJ Woeginger","year":"2000","unstructured":"Woeginger GJ (2000) When does a dynamic programming formulation guarantee the existence of a fully polynomial time approximation scheme (FPTAS)? INFORMS J Comput 12(1):57\u201374","journal-title":"INFORMS J Comput"},{"issue":"2","key":"1436_CR22","doi-asserted-by":"publisher","first-page":"397","DOI":"10.1016\/j.ejor.2024.09.032","volume":"321","author":"X Zhang","year":"2025","unstructured":"Zhang X, Angel E, Chu F, Regnault D (2025) Minimizing total completion time and makespan for a multi-scenario bi-criteria parallel machine scheduling problem. Eur J Oper Res 321(2):397\u2013406","journal-title":"Eur J Oper Res"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-026-01436-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10878-026-01436-1","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-026-01436-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,7,22]],"date-time":"2026-07-22T16:17:18Z","timestamp":1784737038000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10878-026-01436-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,6,30]]},"references-count":22,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2026,7]]}},"alternative-id":["1436"],"URL":"https:\/\/doi.org\/10.1007\/s10878-026-01436-1","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,6,30]]},"assertion":[{"value":"13 November 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"6 June 2026","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"30 June 2026","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"The authors declare that they have no conflict of interest.","order":1,"name":"Ethics","label":"Conflict of Interest","group":{"name":"EthicsHeading","label":"Declarations"}}],"article-number":"59"}}