{"id":"https://openalex.org/W1981724043","doi":"https://doi.org/10.1109/iske.2010.5680781","title":"Semi-online scheduling on two parallel processors with combined partial information","display_name":"Semi-online scheduling on two parallel processors with combined partial information","publication_year":2010,"publication_date":"2010-11-01","ids":{"openalex":"https://openalex.org/W1981724043","doi":"https://doi.org/10.1109/iske.2010.5680781","mag":"1981724043"},"language":"en","primary_location":{"id":"doi:10.1109/iske.2010.5680781","is_oa":false,"landing_page_url":"https://doi.org/10.1109/iske.2010.5680781","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2010 IEEE International Conference on Intelligent Systems and Knowledge Engineering","raw_type":"proceedings-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/A5101832977","display_name":"Yong Wu","orcid":"https://orcid.org/0000-0001-8515-708X"},"institutions":[{"id":"https://openalex.org/I76130692","display_name":"Zhejiang University","ror":"https://ror.org/00a2xv884","country_code":"CN","type":"education","lineage":["https://openalex.org/I76130692"]},{"id":"https://openalex.org/I159389169","display_name":"Ningbo University of Technology","ror":"https://ror.org/037dym702","country_code":"CN","type":"education","lineage":["https://openalex.org/I159389169"]}],"countries":["CN"],"is_corresponding":true,"raw_author_name":"Yong Wu","raw_affiliation_strings":["Institute of Applied Mathematics, Ningbo Institute of Technology, University of Zhejiang, Ningbo, China","Institute of Applied Mathematics, Ningbo Institute of Technology, Zhejiang University, 315100, China"],"affiliations":[{"raw_affiliation_string":"Institute of Applied Mathematics, Ningbo Institute of Technology, University of Zhejiang, Ningbo, China","institution_ids":["https://openalex.org/I159389169"]},{"raw_affiliation_string":"Institute of Applied Mathematics, Ningbo Institute of Technology, Zhejiang University, 315100, China","institution_ids":["https://openalex.org/I159389169","https://openalex.org/I76130692"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5101728749","display_name":"Qifan Yang","orcid":"https://orcid.org/0000-0002-8178-8498"},"institutions":[{"id":"https://openalex.org/I76130692","display_name":"Zhejiang University","ror":"https://ror.org/00a2xv884","country_code":"CN","type":"education","lineage":["https://openalex.org/I76130692"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Qifan Yang","raw_affiliation_strings":["Department of Mathematics, University of Zhejiang, Hangzhou, China","Department of Mathematics, Zhejiang University, Hangzhou 310027, China"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics, University of Zhejiang, Hangzhou, China","institution_ids":["https://openalex.org/I76130692"]},{"raw_affiliation_string":"Department of Mathematics, Zhejiang University, Hangzhou 310027, China","institution_ids":["https://openalex.org/I76130692"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5101832977"],"corresponding_institution_ids":["https://openalex.org/I159389169","https://openalex.org/I76130692"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.12650528,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"9","issue":null,"first_page":"498","last_page":"503"},"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.9997000098228455,"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/T10715","display_name":"Distributed and Parallel Computing Systems","score":0.9970999956130981,"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/competitive-analysis","display_name":"Competitive analysis","score":0.7644579410552979},{"id":"https://openalex.org/keywords/multiprocessing","display_name":"Multiprocessing","score":0.7518528699874878},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6791757345199585},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.6526131629943848},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.5923599004745483},{"id":"https://openalex.org/keywords/online-algorithm","display_name":"Online algorithm","score":0.5894961953163147},{"id":"https://openalex.org/keywords/multiprocessor-scheduling","display_name":"Multiprocessor scheduling","score":0.4790862202644348},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.43809348344802856},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.4014105200767517},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.356439471244812},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.332452654838562},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3096696138381958},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.23395565152168274},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2253345549106598},{"id":"https://openalex.org/keywords/flow-shop-scheduling","display_name":"Flow shop scheduling","score":0.10092437267303467},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.09822720289230347}],"concepts":[{"id":"https://openalex.org/C102408133","wikidata":"https://www.wikidata.org/wiki/Q5156350","display_name":"Competitive analysis","level":3,"score":0.7644579410552979},{"id":"https://openalex.org/C4822641","wikidata":"https://www.wikidata.org/wiki/Q846651","display_name":"Multiprocessing","level":2,"score":0.7518528699874878},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6791757345199585},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.6526131629943848},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5923599004745483},{"id":"https://openalex.org/C196921405","wikidata":"https://www.wikidata.org/wiki/Q786431","display_name":"Online algorithm","level":2,"score":0.5894961953163147},{"id":"https://openalex.org/C85924588","wikidata":"https://www.wikidata.org/wiki/Q107419135","display_name":"Multiprocessor scheduling","level":5,"score":0.4790862202644348},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.43809348344802856},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.4014105200767517},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.356439471244812},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.332452654838562},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3096696138381958},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.23395565152168274},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2253345549106598},{"id":"https://openalex.org/C158336966","wikidata":"https://www.wikidata.org/wiki/Q3074426","display_name":"Flow shop scheduling","level":4,"score":0.10092437267303467},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.09822720289230347},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/iske.2010.5680781","is_oa":false,"landing_page_url":"https://doi.org/10.1109/iske.2010.5680781","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2010 IEEE International Conference on Intelligent Systems and Knowledge Engineering","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320321001","display_name":"National Natural Science Foundation of China","ror":"https://ror.org/01h0zpd94"},{"id":"https://openalex.org/F4320338464","display_name":"Natural Science Foundation of Zhejiang Province","ror":"https://ror.org/01h0zpd94"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":14,"referenced_works":["https://openalex.org/W55614575","https://openalex.org/W1574115616","https://openalex.org/W1973636105","https://openalex.org/W2013144881","https://openalex.org/W2021598206","https://openalex.org/W2039434112","https://openalex.org/W2041066538","https://openalex.org/W2053558677","https://openalex.org/W2054437184","https://openalex.org/W2058273615","https://openalex.org/W2068191609","https://openalex.org/W2089269509","https://openalex.org/W2089938457","https://openalex.org/W6660567975"],"related_works":["https://openalex.org/W2564742953","https://openalex.org/W4213299358","https://openalex.org/W2793095688","https://openalex.org/W1623410360","https://openalex.org/W3115340459","https://openalex.org/W4390203503","https://openalex.org/W2797898895","https://openalex.org/W2131569046","https://openalex.org/W2045215405","https://openalex.org/W212211351"],"abstract_inverted_index":{"The":[0,34,51,73,231],"classical":[1],"formulation":[2],"of":[3,13,37,78,88,103,114,130,194,207,221,228],"the":[4,20,38,76,79,85,89,99,104,128,131,139,166,179,195,215,222],"multiprocessor":[5,39,65],"scheduling":[6,40],"problem":[7,25,41],"requires":[8],"to":[9,15,29],"assign":[10],"a":[11],"set":[12],"tasks":[14,80,90],"m":[16],"processors":[17,58,69],"so":[18],"that":[19],"makespan":[21],"is":[22,26,54,82,96,107,169],"minimized.":[23],"This":[24],"well":[27],"known":[28,108],"be":[30],"NP":[31],"-":[32],"hard.":[33],"online":[35,132],"version":[36,141],"has":[42,123],"been":[43,71,110,124],"studied":[44],"widely":[45],"and":[46,147,218],"many":[47],"results":[48],"are":[49,224,233],"available.":[50],"LS":[52],"algorithm":[53,118,160,168],"optimal":[55,100,117,159,167,234],"for":[56],"two":[57,68],"with":[59,119,161,188],"competitive":[60,120,162,190,219],"ratio":[61,121,163,191],"3/2.":[62],"Various":[63],"semi-online":[64,140],"problems":[66,116],"on":[67,178],"have":[70,109],"studied.":[72,111],"cases":[74],"where":[75,142],"sum":[77],"(T)":[81],"known,":[83,97],"or":[84,98],"largest":[86],"size":[87],"(P":[91],"<sub":[92,149,200],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"":[93,150,201],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">max</sub>":[94,151,202],")":[95],"offline":[101],"value":[102],"instance":[105],"(C*)":[106],"For":[112,204],"each":[113],"those":[115],"4/3":[122],"proposed,":[125],"which":[126],"improved":[127],"3/2":[129],"version.":[133],"In":[134,182],"this":[135,183],"paper,":[136],"we":[137,143,185,209],"study":[138],"know":[144],"both":[145],"T":[146],"P":[148],"in":[152,192,235],"advance.":[153],"And":[154],"there":[155],"also":[156,210],"exists":[157],"an":[158],"6/5.":[164],"But":[165],"not":[170],"good,":[171],"because":[172],"it":[173],"was":[174],"designed":[175],"only":[176],"focus":[177],"worst":[180],"cases.":[181,237],"research,":[184],"propose":[186],"algorithms":[187,223,232],"better":[189],"terms":[193],"parameter":[196,229],"r":[197],"=":[198],"2p":[199],"/T.":[203],"different":[205],"values":[206],"r,":[208],"show":[211],"lower":[212,216],"bounds.":[213],"Both":[214],"bounds":[217],"ratios":[220],"given":[225],"as":[226],"functions":[227],"r.":[230],"some":[236]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}