{"id":"https://openalex.org/W7166694891","doi":"https://doi.org/10.1007/s10878-026-01436-1","title":"Approximating multi-scenario efficient solutions for an uncertain bi-criteria parallel machine scheduling problem","display_name":"Approximating multi-scenario efficient solutions for an uncertain bi-criteria parallel machine scheduling problem","publication_year":2026,"publication_date":"2026-06-30","ids":{"openalex":"https://openalex.org/W7166694891","doi":"https://doi.org/10.1007/s10878-026-01436-1"},"language":"en","primary_location":{"id":"doi:10.1007/s10878-026-01436-1","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s10878-026-01436-1","pdf_url":null,"source":{"id":"https://openalex.org/S107925523","display_name":"Journal of Combinatorial Optimization","issn_l":"1382-6905","issn":["1382-6905","1573-2886"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Combinatorial Optimization","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5100430876","display_name":"Xi Zhang","orcid":"https://orcid.org/0000-0003-3415-5345"},"institutions":[{"id":"https://openalex.org/I277688954","display_name":"Universit\u00e9 Paris-Saclay","ror":"https://ror.org/03xjwb503","country_code":"FR","type":"education","lineage":["https://openalex.org/I277688954"]},{"id":"https://openalex.org/I4210107733","display_name":"Informatique, BioInformatique, Syst\u00e8mes Complexes","ror":"https://ror.org/01aqxgr98","country_code":"FR","type":"facility","lineage":["https://openalex.org/I277688954","https://openalex.org/I277688954","https://openalex.org/I4210107733","https://openalex.org/I88467170"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Xiechen Zhang","raw_affiliation_strings":["Universit\u00e9 Paris-Saclay, Univ Evry, IBISC, 91020, Evry-Courcouronnes, France"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Universit\u00e9 Paris-Saclay, Univ Evry, IBISC, 91020, Evry-Courcouronnes, France","institution_ids":["https://openalex.org/I277688954","https://openalex.org/I4210107733"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5137742707","display_name":"Angel Eric","orcid":"https://orcid.org/0000-0002-6759-809X"},"institutions":[{"id":"https://openalex.org/I277688954","display_name":"Universit\u00e9 Paris-Saclay","ror":"https://ror.org/03xjwb503","country_code":"FR","type":"education","lineage":["https://openalex.org/I277688954"]},{"id":"https://openalex.org/I4210107733","display_name":"Informatique, BioInformatique, Syst\u00e8mes Complexes","ror":"https://ror.org/01aqxgr98","country_code":"FR","type":"facility","lineage":["https://openalex.org/I277688954","https://openalex.org/I277688954","https://openalex.org/I4210107733","https://openalex.org/I88467170"]}],"countries":["FR"],"is_corresponding":true,"raw_author_name":"Eric Angel","raw_affiliation_strings":["Universit\u00e9 Paris-Saclay, Univ Evry, IBISC, 91020, Evry-Courcouronnes, France"],"raw_orcid":"https://orcid.org/0000-0002-6759-809X","affiliations":[{"raw_affiliation_string":"Universit\u00e9 Paris-Saclay, Univ Evry, IBISC, 91020, Evry-Courcouronnes, France","institution_ids":["https://openalex.org/I277688954","https://openalex.org/I4210107733"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5024748800","display_name":"Feng Chu","orcid":"https://orcid.org/0000-0003-1225-8319"},"institutions":[{"id":"https://openalex.org/I277688954","display_name":"Universit\u00e9 Paris-Saclay","ror":"https://ror.org/03xjwb503","country_code":"FR","type":"education","lineage":["https://openalex.org/I277688954"]},{"id":"https://openalex.org/I4210107733","display_name":"Informatique, BioInformatique, Syst\u00e8mes Complexes","ror":"https://ror.org/01aqxgr98","country_code":"FR","type":"facility","lineage":["https://openalex.org/I277688954","https://openalex.org/I277688954","https://openalex.org/I4210107733","https://openalex.org/I88467170"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Feng Chu","raw_affiliation_strings":["Universit\u00e9 Paris-Saclay, Univ Evry, IBISC, 91020, Evry-Courcouronnes, France"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Universit\u00e9 Paris-Saclay, Univ Evry, IBISC, 91020, Evry-Courcouronnes, France","institution_ids":["https://openalex.org/I277688954","https://openalex.org/I4210107733"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5047854195","display_name":"Damien Regnault","orcid":"https://orcid.org/0000-0001-9815-5606"},"institutions":[{"id":"https://openalex.org/I277688954","display_name":"Universit\u00e9 Paris-Saclay","ror":"https://ror.org/03xjwb503","country_code":"FR","type":"education","lineage":["https://openalex.org/I277688954"]},{"id":"https://openalex.org/I4210107733","display_name":"Informatique, BioInformatique, Syst\u00e8mes Complexes","ror":"https://ror.org/01aqxgr98","country_code":"FR","type":"facility","lineage":["https://openalex.org/I277688954","https://openalex.org/I277688954","https://openalex.org/I4210107733","https://openalex.org/I88467170"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Damien Regnault","raw_affiliation_strings":["Universit\u00e9 Paris-Saclay, Univ Evry, IBISC, 91020, Evry-Courcouronnes, France"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Universit\u00e9 Paris-Saclay, Univ Evry, IBISC, 91020, Evry-Courcouronnes, France","institution_ids":["https://openalex.org/I277688954","https://openalex.org/I4210107733"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5137742707"],"corresponding_institution_ids":["https://openalex.org/I277688954","https://openalex.org/I4210107733"],"apc_list":{"value":2990,"currency":"USD","value_usd":2990},"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.79049676,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"51","issue":"5","first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9352999925613403,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9352999925613403,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12177","display_name":"Resource-Constrained Project Scheduling","score":0.015699999406933784,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T12176","display_name":"Optimization and Packing Problems","score":0.004900000058114529,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.6825000047683716},{"id":"https://openalex.org/keywords/theory-of-computation","display_name":"Theory of computation","score":0.6739000082015991},{"id":"https://openalex.org/keywords/polynomial-time-approximation-scheme","display_name":"Polynomial-time approximation scheme","score":0.6158000230789185},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.5785999894142151},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.4993000030517578},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.4580000042915344},{"id":"https://openalex.org/keywords/dynamic-programming","display_name":"Dynamic programming","score":0.4494999945163727},{"id":"https://openalex.org/keywords/scheme","display_name":"Scheme (mathematics)","score":0.4260999858379364}],"concepts":[{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6987000107765198},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.6825000047683716},{"id":"https://openalex.org/C24858836","wikidata":"https://www.wikidata.org/wiki/Q844718","display_name":"Theory of computation","level":2,"score":0.6739000082015991},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6348999738693237},{"id":"https://openalex.org/C99140742","wikidata":"https://www.wikidata.org/wiki/Q843550","display_name":"Polynomial-time approximation scheme","level":3,"score":0.6158000230789185},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5785999894142151},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.4993000030517578},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.4580000042915344},{"id":"https://openalex.org/C37404715","wikidata":"https://www.wikidata.org/wiki/Q380679","display_name":"Dynamic programming","level":2,"score":0.4494999945163727},{"id":"https://openalex.org/C77618280","wikidata":"https://www.wikidata.org/wiki/Q1155772","display_name":"Scheme (mathematics)","level":2,"score":0.4260999858379364},{"id":"https://openalex.org/C2780271269","wikidata":"https://www.wikidata.org/wiki/Q19295956","display_name":"Single-machine scheduling","level":4,"score":0.384799987077713},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.335099995136261},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.3314000070095062},{"id":"https://openalex.org/C2776291640","wikidata":"https://www.wikidata.org/wiki/Q2912517","display_name":"Value (mathematics)","level":2,"score":0.3231000006198883},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.29409998655319214},{"id":"https://openalex.org/C107568181","wikidata":"https://www.wikidata.org/wiki/Q5319000","display_name":"Dynamic priority scheduling","level":3,"score":0.2849000096321106},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2752000093460083},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.26739999651908875},{"id":"https://openalex.org/C3018263672","wikidata":"https://www.wikidata.org/wiki/Q1296251","display_name":"Efficient algorithm","level":2,"score":0.2630000114440918},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.26190000772476196},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.2606000006198883},{"id":"https://openalex.org/C2777382242","wikidata":"https://www.wikidata.org/wiki/Q6017816","display_name":"Index (typography)","level":2,"score":0.25459998846054077}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1007/s10878-026-01436-1","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s10878-026-01436-1","pdf_url":null,"source":{"id":"https://openalex.org/S107925523","display_name":"Journal of Combinatorial Optimization","issn_l":"1382-6905","issn":["1382-6905","1573-2886"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Combinatorial Optimization","raw_type":"journal-article"},{"id":"pmh:oai:HAL:hal-05679958v1","is_oa":false,"landing_page_url":"https://univ-evry.hal.science/hal-05679958","pdf_url":null,"source":{"id":"https://openalex.org/S4306402512","display_name":"HAL (Le Centre pour la Communication Scientifique Directe)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1294671590","host_organization_name":"Centre National de la Recherche Scientifique","host_organization_lineage":["https://openalex.org/I1294671590"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Journal of Combinatorial Optimization, 2026, 51 (5), pp.59. ⟨10.1007/s10878-026-01436-1⟩","raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/8","score":0.6971156597137451,"display_name":"Decent work and economic growth"}],"awards":[{"id":"https://openalex.org/G6703872513","display_name":null,"funder_award_id":"202208070096","funder_id":"https://openalex.org/F4320322725","funder_display_name":"China Scholarship Council"}],"funders":[{"id":"https://openalex.org/F4320322725","display_name":"China Scholarship Council","ror":"https://ror.org/04atp4p48"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":19,"referenced_works":["https://openalex.org/W1488422606","https://openalex.org/W1531908439","https://openalex.org/W1789652828","https://openalex.org/W1842733265","https://openalex.org/W1928381443","https://openalex.org/W2026891055","https://openalex.org/W2033248211","https://openalex.org/W2039219233","https://openalex.org/W2067297441","https://openalex.org/W2087746279","https://openalex.org/W2089179186","https://openalex.org/W2136658137","https://openalex.org/W2168638012","https://openalex.org/W2888022926","https://openalex.org/W2974223901","https://openalex.org/W3099831561","https://openalex.org/W4283068302","https://openalex.org/W4402734784","https://openalex.org/W7136250757"],"related_works":[],"abstract_inverted_index":null,"counts_by_year":[],"updated_date":"2026-07-23T08:03:31.855105","created_date":"2026-07-01T00:00:00"}