{"id":"https://openalex.org/W2041291033","doi":"https://doi.org/10.1109/bicta.2010.5645076","title":"Approximation for preemptive scheduling stochastic jobs on identical parallel machines","display_name":"Approximation for preemptive scheduling stochastic jobs on identical parallel machines","publication_year":2010,"publication_date":"2010-09-01","ids":{"openalex":"https://openalex.org/W2041291033","doi":"https://doi.org/10.1109/bicta.2010.5645076","mag":"2041291033"},"language":"en","primary_location":{"id":"doi:10.1109/bicta.2010.5645076","is_oa":false,"landing_page_url":"https://doi.org/10.1109/bicta.2010.5645076","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2010 IEEE Fifth International Conference on Bio-Inspired Computing: Theories and Applications (BIC-TA)","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/A5115589405","display_name":"Xiaoyong Tang","orcid":null},"institutions":[{"id":"https://openalex.org/I16609230","display_name":"Hunan University","ror":"https://ror.org/05htk5m33","country_code":"CN","type":"education","lineage":["https://openalex.org/I16609230"]}],"countries":["CN"],"is_corresponding":true,"raw_author_name":"Xiaoyong Tang","raw_affiliation_strings":["School of Computer and Communication, Hunan University, Changsha, China, 410082"],"affiliations":[{"raw_affiliation_string":"School of Computer and Communication, Hunan University, Changsha, China, 410082","institution_ids":["https://openalex.org/I16609230"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5078793726","display_name":"Kenli Li","orcid":"https://orcid.org/0000-0002-2635-7716"},"institutions":[{"id":"https://openalex.org/I16609230","display_name":"Hunan University","ror":"https://ror.org/05htk5m33","country_code":"CN","type":"education","lineage":["https://openalex.org/I16609230"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Kenli Li","raw_affiliation_strings":["School of Computer and Communication, Hunan University, Changsha, China, 410082"],"affiliations":[{"raw_affiliation_string":"School of Computer and Communication, Hunan University, Changsha, China, 410082","institution_ids":["https://openalex.org/I16609230"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5081439040","display_name":"Fan Wu","orcid":"https://orcid.org/0000-0001-9392-2597"},"institutions":[{"id":"https://openalex.org/I16609230","display_name":"Hunan University","ror":"https://ror.org/05htk5m33","country_code":"CN","type":"education","lineage":["https://openalex.org/I16609230"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Fan Wu","raw_affiliation_strings":["School of Computer and Communication, Hunan University, Changsha, China, 410082"],"affiliations":[{"raw_affiliation_string":"School of Computer and Communication, Hunan University, Changsha, China, 410082","institution_ids":["https://openalex.org/I16609230"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5115589405"],"corresponding_institution_ids":["https://openalex.org/I16609230"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.1705359,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"1287","last_page":"1290"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10551","display_name":"Scheduling and Optimization Algorithms","score":1.0,"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":1.0,"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.9984999895095825,"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.9812999963760376,"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/computer-science","display_name":"Computer science","score":0.6819553375244141},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.6616417169570923},{"id":"https://openalex.org/keywords/preemption","display_name":"Preemption","score":0.6558967232704163},{"id":"https://openalex.org/keywords/single-machine-scheduling","display_name":"Single-machine scheduling","score":0.4882645606994629},{"id":"https://openalex.org/keywords/random-variable","display_name":"Random variable","score":0.4790397882461548},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.47412824630737305},{"id":"https://openalex.org/keywords/dynamic-priority-scheduling","display_name":"Dynamic priority scheduling","score":0.4342747926712036},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.4303876757621765},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.3682905435562134},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.3320051431655884},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.21465876698493958},{"id":"https://openalex.org/keywords/operating-system","display_name":"Operating system","score":0.08198118209838867},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.08051267266273499}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6819553375244141},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.6616417169570923},{"id":"https://openalex.org/C206952183","wikidata":"https://www.wikidata.org/wiki/Q1193100","display_name":"Preemption","level":2,"score":0.6558967232704163},{"id":"https://openalex.org/C2780271269","wikidata":"https://www.wikidata.org/wiki/Q19295956","display_name":"Single-machine scheduling","level":4,"score":0.4882645606994629},{"id":"https://openalex.org/C122123141","wikidata":"https://www.wikidata.org/wiki/Q176623","display_name":"Random variable","level":2,"score":0.4790397882461548},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.47412824630737305},{"id":"https://openalex.org/C107568181","wikidata":"https://www.wikidata.org/wiki/Q5319000","display_name":"Dynamic priority scheduling","level":3,"score":0.4342747926712036},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.4303876757621765},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.3682905435562134},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.3320051431655884},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.21465876698493958},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.08198118209838867},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.08051267266273499},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/bicta.2010.5645076","is_oa":false,"landing_page_url":"https://doi.org/10.1109/bicta.2010.5645076","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2010 IEEE Fifth International Conference on Bio-Inspired Computing: Theories and Applications (BIC-TA)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":19,"referenced_works":["https://openalex.org/W1488422606","https://openalex.org/W1503391522","https://openalex.org/W1964085249","https://openalex.org/W1969292692","https://openalex.org/W1974114807","https://openalex.org/W1981046127","https://openalex.org/W1988328380","https://openalex.org/W2021987086","https://openalex.org/W2031612682","https://openalex.org/W2067297441","https://openalex.org/W2071104320","https://openalex.org/W2081848918","https://openalex.org/W2098959416","https://openalex.org/W2103559566","https://openalex.org/W2104709390","https://openalex.org/W2118328307","https://openalex.org/W2120583208","https://openalex.org/W2319913714","https://openalex.org/W2320338423"],"related_works":["https://openalex.org/W1977040436","https://openalex.org/W2529680039","https://openalex.org/W1974309933","https://openalex.org/W2092240563","https://openalex.org/W4380884924","https://openalex.org/W2046459844","https://openalex.org/W1996475154","https://openalex.org/W2094800167","https://openalex.org/W2898780166","https://openalex.org/W1529601040"],"abstract_inverted_index":{"In":[0],"this":[1],"paper,":[2],"the":[3,9,41,66],"stochastic":[4,42,71],"scheduling":[5,51,72],"problem":[6],"of":[7,69],"minimizing":[8],"total":[10],"weighted":[11],"completion":[12],"time":[13],"on":[14],"preemptive":[15,44,70],"identical":[16],"parallel":[17],"machines":[18],"is":[19,28],"investigated.":[20],"Each":[21],"job":[22],"has":[23],"a":[24,29,48],"processing":[25],"time,":[26],"which":[27,53],"random":[30],"variable":[31],"and":[32],"just":[33],"given":[34],"their":[35],"distribution":[36],"function.":[37],"First,":[38],"we":[39,54,59],"extend":[40],"single-machine":[43],"WSEPT":[45],"rule":[46],"to":[47,64],"multi-machine":[49],"list":[50],"policy,":[52],"call":[55],"P-WSEPT.":[56],"T":[57],"hen,":[58],"use":[60],"LP":[61],"based":[62],"policy":[63],"analysis":[65],"performance":[67],"guarantee":[68],"with":[73],"release":[74],"dates.":[75]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2020,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}