{"id":"https://openalex.org/W4390891339","doi":"https://doi.org/10.1142/s0217595924500027","title":"The Minmax Regret Scheduling-Location Problem on Trees with Interval-Data Edge Lengths","display_name":"The Minmax Regret Scheduling-Location Problem on Trees with Interval-Data Edge Lengths","publication_year":2024,"publication_date":"2024-01-15","ids":{"openalex":"https://openalex.org/W4390891339","doi":"https://doi.org/10.1142/s0217595924500027"},"language":"en","primary_location":{"id":"doi:10.1142/s0217595924500027","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0217595924500027","pdf_url":null,"source":{"id":"https://openalex.org/S1254427","display_name":"Asia Pacific Journal of Operational Research","issn_l":"0217-5959","issn":["0217-5959","1793-7019"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Asia-Pacific Journal of Operational Research","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/A5035122431","display_name":"Huy Minh Le","orcid":"https://orcid.org/0000-0002-0068-7055"},"institutions":[{"id":"https://openalex.org/I4210123993","display_name":"Van Lang University","ror":"https://ror.org/02ryrf141","country_code":"VN","type":"education","lineage":["https://openalex.org/I4210123993"]}],"countries":["VN"],"is_corresponding":false,"raw_author_name":"Huy Minh Le","raw_affiliation_strings":["Faculty of Fundamental Sciences, Van Lang University, 69/68 Dang Thuy Tram Street, Ward 13, Binh Thanh District, Ho Chi Minh City, Vietnam"],"raw_orcid":"https://orcid.org/0000-0002-0068-7055","affiliations":[{"raw_affiliation_string":"Faculty of Fundamental Sciences, Van Lang University, 69/68 Dang Thuy Tram Street, Ward 13, Binh Thanh District, Ho Chi Minh City, Vietnam","institution_ids":["https://openalex.org/I4210123993"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5081592766","display_name":"Kien Trung Nguyen","orcid":"https://orcid.org/0000-0002-7522-4557"},"institutions":[{"id":"https://openalex.org/I177733328","display_name":"Can Tho University","ror":"https://ror.org/0071qz696","country_code":"VN","type":"education","lineage":["https://openalex.org/I177733328"]}],"countries":["VN"],"is_corresponding":false,"raw_author_name":"Kien Trung Nguyen","raw_affiliation_strings":["Department of Mathematics, Teacher College, Can Tho University, 3/2 Street, Can Tho City, Vietnam"],"raw_orcid":"https://orcid.org/0000-0002-7522-4557","affiliations":[{"raw_affiliation_string":"Department of Mathematics, Teacher College, Can Tho University, 3/2 Street, Can Tho City, Vietnam","institution_ids":["https://openalex.org/I177733328"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5092090247","display_name":"Liem Dinh Tien","orcid":"https://orcid.org/0009-0008-8528-3041"},"institutions":[{"id":"https://openalex.org/I4210123993","display_name":"Van Lang University","ror":"https://ror.org/02ryrf141","country_code":"VN","type":"education","lineage":["https://openalex.org/I4210123993"]}],"countries":["VN"],"is_corresponding":false,"raw_author_name":"Liem Dinh Tien","raw_affiliation_strings":["Faculty of Fundamental Sciences, Van Lang University, 69/68 Dang Thuy Tram Street, Ward 13, Binh Thanh District, Ho Chi Minh City, Vietnam"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Faculty of Fundamental Sciences, Van Lang University, 69/68 Dang Thuy Tram Street, Ward 13, Binh Thanh District, Ho Chi Minh City, Vietnam","institution_ids":["https://openalex.org/I4210123993"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.3205,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.54568472,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":91,"max":95},"biblio":{"volume":"41","issue":"06","first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.8672000169754028,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.8672000169754028,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.8622999787330627,"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/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.7990000247955322,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/regret","display_name":"Regret","score":0.8419438600540161},{"id":"https://openalex.org/keywords/interval-data","display_name":"Interval data","score":0.5957897901535034},{"id":"https://openalex.org/keywords/minimax","display_name":"Minimax","score":0.5793702006340027},{"id":"https://openalex.org/keywords/interval","display_name":"Interval (graph theory)","score":0.5767305493354797},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.54060959815979},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.5246798396110535},{"id":"https://openalex.org/keywords/enhanced-data-rates-for-gsm-evolution","display_name":"Enhanced Data Rates for GSM Evolution","score":0.47415465116500854},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.44940632581710815},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.32564663887023926},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.3079361319541931},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.13302305340766907},{"id":"https://openalex.org/keywords/machine-learning","display_name":"Machine learning","score":0.059771180152893066}],"concepts":[{"id":"https://openalex.org/C50817715","wikidata":"https://www.wikidata.org/wiki/Q79895177","display_name":"Regret","level":2,"score":0.8419438600540161},{"id":"https://openalex.org/C2983220686","wikidata":"https://www.wikidata.org/wiki/Q951437","display_name":"Interval data","level":3,"score":0.5957897901535034},{"id":"https://openalex.org/C149728462","wikidata":"https://www.wikidata.org/wiki/Q751319","display_name":"Minimax","level":2,"score":0.5793702006340027},{"id":"https://openalex.org/C2778067643","wikidata":"https://www.wikidata.org/wiki/Q166507","display_name":"Interval (graph theory)","level":2,"score":0.5767305493354797},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.54060959815979},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5246798396110535},{"id":"https://openalex.org/C162307627","wikidata":"https://www.wikidata.org/wiki/Q204833","display_name":"Enhanced Data Rates for GSM Evolution","level":2,"score":0.47415465116500854},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.44940632581710815},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.32564663887023926},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3079361319541931},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.13302305340766907},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.059771180152893066},{"id":"https://openalex.org/C22088475","wikidata":"https://www.wikidata.org/wiki/Q647974","display_name":"Data envelopment analysis","level":2,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1142/s0217595924500027","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0217595924500027","pdf_url":null,"source":{"id":"https://openalex.org/S1254427","display_name":"Asia Pacific Journal of Operational Research","issn_l":"0217-5959","issn":["0217-5959","1793-7019"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Asia-Pacific Journal of Operational Research","raw_type":"journal-article"},{"id":"pmh:oai:RePEc:wsi:apjorx:v:41:y:2024:i:06:n:s0217595924500027","is_oa":false,"landing_page_url":"http://www.worldscientific.com/doi/abs/10.1142/S0217595924500027","pdf_url":null,"source":{"id":"https://openalex.org/S4306401271","display_name":"RePEc: Research Papers in Economics","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I77793887","host_organization_name":"Federal Reserve Bank of St. Louis","host_organization_lineage":["https://openalex.org/I77793887"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":22,"referenced_works":["https://openalex.org/W804266806","https://openalex.org/W1970531677","https://openalex.org/W1990275757","https://openalex.org/W2008541173","https://openalex.org/W2015829049","https://openalex.org/W2061515285","https://openalex.org/W2063102956","https://openalex.org/W2102750402","https://openalex.org/W2131116400","https://openalex.org/W2743045177","https://openalex.org/W2987559581","https://openalex.org/W3045425047","https://openalex.org/W3127009681","https://openalex.org/W3135868442","https://openalex.org/W4207022321","https://openalex.org/W4212771885","https://openalex.org/W4225016526","https://openalex.org/W4238714550","https://openalex.org/W4251616545","https://openalex.org/W4253347690","https://openalex.org/W4293206982","https://openalex.org/W4300962971"],"related_works":["https://openalex.org/W115577841","https://openalex.org/W2032833645","https://openalex.org/W4256681807","https://openalex.org/W2338920004","https://openalex.org/W2232227265","https://openalex.org/W2045103335","https://openalex.org/W4232843823","https://openalex.org/W2205126926","https://openalex.org/W3139960064","https://openalex.org/W2624046717"],"abstract_inverted_index":{"We":[0,31],"address":[1],"in":[2,107],"this":[3],"paper":[4],"a":[5,29,65,76,97,112],"variant":[6],"of":[7,23,54,79],"the":[8,20,24,34,41,48,52,55,60,71,80,84,102],"scheduling-location":[9],"(ScheLoc)":[10],"problem":[11,106],"on":[12,111],"tree":[13,81],"networks":[14],"with":[15,40,89],"interval":[16],"edge":[17,78,86],"lengths":[18],"where":[19],"total":[21],"deviation":[22],"uncertain":[25],"data":[26],"cannot":[27],"exceed":[28],"threshold.":[30],"further":[32],"use":[33],"minmax":[35,103],"regret":[36,62,92,104],"concept":[37],"to":[38,46,59,75],"deal":[39],"corresponding":[42],"uncertainty.":[43],"In":[44],"order":[45],"solve":[47],"problem,":[49],"we":[50,69,95],"investigate":[51],"structure":[53],"schedule":[56],"which":[57],"leads":[58],"maximum":[61,91],"value":[63],"at":[64],"fixed":[66],"point.":[67],"Then":[68],"consider":[70],"machine":[72],"location":[73],"belonging":[74],"specific":[77],"and":[82],"partition":[83],"underlying":[85],"into":[87],"regions":[88],"linear":[90],"function.":[93],"Finally,":[94],"develop":[96],"combinatorial":[98],"algorithm":[99],"that":[100],"solves":[101],"ScheLoc":[105],"polynomial":[108],"time":[109],"based":[110],"finite":[113],"dominating":[114],"set":[115],"approach.":[116]},"counts_by_year":[{"year":2025,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}