{"id":"https://openalex.org/W1972430054","doi":"https://doi.org/10.1142/s1793830909000282","title":"POLYNOMIAL APPROXIMATION SCHEMES FOR THE MAX-MIN ALLOCATION PROBLEM UNDER A GRADE OF SERVICE PROVISION","display_name":"POLYNOMIAL APPROXIMATION SCHEMES FOR THE MAX-MIN ALLOCATION PROBLEM UNDER A GRADE OF SERVICE PROVISION","publication_year":2009,"publication_date":"2009-09-01","ids":{"openalex":"https://openalex.org/W1972430054","doi":"https://doi.org/10.1142/s1793830909000282","mag":"1972430054"},"language":"en","primary_location":{"id":"doi:10.1142/s1793830909000282","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s1793830909000282","pdf_url":null,"source":{"id":"https://openalex.org/S178434951","display_name":"Discrete Mathematics Algorithms and Applications","issn_l":"1793-8309","issn":["1793-8309","1793-8317"],"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":"Discrete Mathematics, Algorithms and Applications","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/A5018144399","display_name":"Jianping Li","orcid":"https://orcid.org/0000-0003-1508-1440"},"institutions":[{"id":"https://openalex.org/I10660446","display_name":"Kunming University of Science and Technology","ror":"https://ror.org/00xyeez13","country_code":"CN","type":"education","lineage":["https://openalex.org/I10660446"]},{"id":"https://openalex.org/I189210763","display_name":"Yunnan University","ror":"https://ror.org/0040axw97","country_code":"CN","type":"education","lineage":["https://openalex.org/I189210763"]}],"countries":["CN"],"is_corresponding":true,"raw_author_name":"JIANPING LI","raw_affiliation_strings":["Department of Mathematics, Yunnan University, Kunming 650091, P. R. China","School of Management and Economics, Kunming University of Science and Technology, Kunming 650031, P. R. China"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics, Yunnan University, Kunming 650091, P. R. China","institution_ids":["https://openalex.org/I189210763"]},{"raw_affiliation_string":"School of Management and Economics, Kunming University of Science and Technology, Kunming 650031, P. R. China","institution_ids":["https://openalex.org/I10660446"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5054712771","display_name":"Weidong Li","orcid":"https://orcid.org/0000-0003-3094-4347"},"institutions":[{"id":"https://openalex.org/I189210763","display_name":"Yunnan University","ror":"https://ror.org/0040axw97","country_code":"CN","type":"education","lineage":["https://openalex.org/I189210763"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"WEIDONG LI","raw_affiliation_strings":["Department of Mathematics, Yunnan University, Kunming 650091, P. R. China"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics, Yunnan University, Kunming 650091, P. R. China","institution_ids":["https://openalex.org/I189210763"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5100361574","display_name":"Jianbo Li","orcid":"https://orcid.org/0000-0001-8756-7007"},"institutions":[{"id":"https://openalex.org/I10660446","display_name":"Kunming University of Science and Technology","ror":"https://ror.org/00xyeez13","country_code":"CN","type":"education","lineage":["https://openalex.org/I10660446"]},{"id":"https://openalex.org/I189210763","display_name":"Yunnan University","ror":"https://ror.org/0040axw97","country_code":"CN","type":"education","lineage":["https://openalex.org/I189210763"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"JIANBO LI","raw_affiliation_strings":["Department of Mathematics, Yunnan University, Kunming 650091, P. R. China","School of Management and Economics, Kunming University of Science and Technology, Kunming 650031, P. R. China"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics, Yunnan University, Kunming 650091, P. R. China","institution_ids":["https://openalex.org/I189210763"]},{"raw_affiliation_string":"School of Management and Economics, Kunming University of Science and Technology, Kunming 650031, P. R. China","institution_ids":["https://openalex.org/I10660446"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5018144399"],"corresponding_institution_ids":["https://openalex.org/I10660446","https://openalex.org/I189210763"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":11,"citation_normalized_percentile":{"value":0.12166916,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"01","issue":"03","first_page":"355","last_page":"368"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9998000264167786,"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.9998000264167786,"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/T12288","display_name":"Optimization and Search Problems","score":0.9994999766349792,"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"}},{"id":"https://openalex.org/T12176","display_name":"Optimization and Packing Problems","score":0.9941999912261963,"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/polynomial-time-approximation-scheme","display_name":"Polynomial-time approximation scheme","score":0.8088294267654419},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.59645015001297},{"id":"https://openalex.org/keywords/running-time","display_name":"Running time","score":0.572573184967041},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.5565019845962524},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.5508775115013123},{"id":"https://openalex.org/keywords/polynomial","display_name":"Polynomial","score":0.5028533339500427},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.4820583760738373},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.475182443857193},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.46184319257736206},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.46109119057655334},{"id":"https://openalex.org/keywords/scheme","display_name":"Scheme (mathematics)","score":0.4556886851787567},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.38472703099250793},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3425668179988861},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.27387452125549316}],"concepts":[{"id":"https://openalex.org/C99140742","wikidata":"https://www.wikidata.org/wiki/Q843550","display_name":"Polynomial-time approximation scheme","level":3,"score":0.8088294267654419},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.59645015001297},{"id":"https://openalex.org/C3017489831","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Running time","level":2,"score":0.572573184967041},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5565019845962524},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.5508775115013123},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.5028533339500427},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.4820583760738373},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.475182443857193},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.46184319257736206},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.46109119057655334},{"id":"https://openalex.org/C77618280","wikidata":"https://www.wikidata.org/wiki/Q1155772","display_name":"Scheme (mathematics)","level":2,"score":0.4556886851787567},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.38472703099250793},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3425668179988861},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.27387452125549316},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1142/s1793830909000282","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s1793830909000282","pdf_url":null,"source":{"id":"https://openalex.org/S178434951","display_name":"Discrete Mathematics Algorithms and Applications","issn_l":"1793-8309","issn":["1793-8309","1793-8317"],"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":"Discrete Mathematics, Algorithms and Applications","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.5799999833106995,"id":"https://metadata.un.org/sdg/8","display_name":"Decent work and economic growth"}],"awards":[],"funders":[{"id":"https://openalex.org/F4320321001","display_name":"National Natural Science Foundation of China","ror":"https://ror.org/01h0zpd94"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":11,"referenced_works":["https://openalex.org/W1488422606","https://openalex.org/W1977276352","https://openalex.org/W2006905044","https://openalex.org/W2064294745","https://openalex.org/W2068859584","https://openalex.org/W2072712212","https://openalex.org/W2077500752","https://openalex.org/W2102201348","https://openalex.org/W2114616381","https://openalex.org/W2136658137","https://openalex.org/W2619122734"],"related_works":["https://openalex.org/W2167596143","https://openalex.org/W2949660560","https://openalex.org/W1694364829","https://openalex.org/W2168958045","https://openalex.org/W4385890265","https://openalex.org/W1903284337","https://openalex.org/W4299856409","https://openalex.org/W2498753647","https://openalex.org/W1972430054","https://openalex.org/W4292622033"],"abstract_inverted_index":{"The":[0,87,128],"max-min":[1],"allocation":[2,140],"problem":[3,137,176],"under":[4],"a":[5,17,27,68,183,190,205,208,232],"grade":[6,46],"of":[7,22,32,45,47,111,117,121,160,227,245],"service":[8,48],"provision":[9],"is":[10,75,89,114,148,229,248],"defined":[11],"in":[12,141],"the":[13,79,82,99,108,115,118,143,161,197,216,221,224,235,240,243],"following":[14],"model:":[15],"given":[16],"set":[18,28],"[Formula:":[19,29,52,193],"see":[20,30,53,194],"text]":[21,31,54,195],"m":[23,95,105,226],"parallel":[24],"machines":[25,36,96,228],"and":[26,37,61,177,207],"n":[33],"jobs,":[34],"where":[35,107,200,223,242],"jobs":[38,93,122],"are":[39],"all":[40,92],"entitled":[41],"to":[42,67,90,94,97,134,173],"different":[43],"levels":[44,247],"(GoS),":[49],"each":[50],"job":[51,83],"has":[55],"its":[56,178],"processing":[57,119],"time":[58,120,147,185,192,211,218,237],"p":[59],"j":[60,85],"it":[62],"can":[63],"only":[64],"be":[65],"allocated":[66],"machine":[69,101,109,145],"M":[70,112,125],"i":[71,113,126],"whose":[72],"GoS":[73,80,246],"level":[74,81],"no":[76],"more":[77],"than":[78],"J":[84],"has.":[86],"goal":[88],"allocate":[91],"maximize":[98],"minimum":[100,144],"load":[102,110],"among":[103],"these":[104],"machines,":[106],"sum":[116],"executed":[123],"on":[124],".":[127],"best":[129],"known":[130],"approximation":[131,171,186,212],"algorithm":[132],"[4]":[133],"solve":[135,174],"this":[136,165,175],"produces":[138],"an":[139],"which":[142],"completion":[146],"at":[149],"least":[150],"\u03a9":[151],"(":[152],"log":[153,154,155,157,158],"m/":[156],"m)":[159],"optimal":[162],"value.":[163],"In":[164],"paper,":[166],"we":[167],"respectively":[168],"present":[169],"four":[170],"schemes":[172],"two":[179],"special":[180],"versions:":[181],"(1)":[182],"polynomial":[184,210],"scheme":[187,213],"(PTAS)":[188],"with":[189,215,234],"running":[191,217,236],"for":[196,220,239],"general":[198],"version,":[199],"\u03f5":[201],">":[202],"0;":[203],"(2)":[204],"PTAS":[206,233],"fully":[209],"(FPTAS)":[214],"O(n)":[219,238],"version":[222,241],"number":[225,244],"fixed;":[230],"(3)":[231],"bounded":[249],"by":[250],"k.":[251]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":3},{"year":2016,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}