{"id":"https://openalex.org/W2006538926","doi":"https://doi.org/10.1137/s0895480191221829","title":"An Approximation Algorithm for Preemptive Scheduling on Parallel-Task Systems","display_name":"An Approximation Algorithm for Preemptive Scheduling on Parallel-Task Systems","publication_year":1995,"publication_date":"1995-11-01","ids":{"openalex":"https://openalex.org/W2006538926","doi":"https://doi.org/10.1137/s0895480191221829","mag":"2006538926"},"language":"en","primary_location":{"id":"doi:10.1137/s0895480191221829","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0895480191221829","pdf_url":null,"source":{"id":"https://openalex.org/S117679221","display_name":"SIAM Journal on Discrete Mathematics","issn_l":"0895-4801","issn":["0895-4801","1095-7146"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Discrete Mathematics","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/A5014255932","display_name":"Ramesh Krishnamurti","orcid":"https://orcid.org/0000-0001-6327-8286"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Ramesh Krishnamurti","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5003176765","display_name":"Bhagirath Narahari","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Bhagirath Narahari","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.17234736,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"8","issue":"4","first_page":"661","last_page":"669"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9911999702453613,"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"}},"topics":[{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9911999702453613,"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.9860000014305115,"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/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9818999767303467,"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/computer-science","display_name":"Computer science","score":0.7061947584152222},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.628765881061554},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.6199290752410889},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.6034122705459595},{"id":"https://openalex.org/keywords/preemption","display_name":"Preemption","score":0.5771301984786987},{"id":"https://openalex.org/keywords/fixed-priority-pre-emptive-scheduling","display_name":"Fixed-priority pre-emptive scheduling","score":0.5645748972892761},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.4563894271850586},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.44247063994407654},{"id":"https://openalex.org/keywords/task","display_name":"Task (project management)","score":0.4349522590637207},{"id":"https://openalex.org/keywords/fair-share-scheduling","display_name":"Fair-share scheduling","score":0.35831886529922485},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3507249355316162},{"id":"https://openalex.org/keywords/rate-monotonic-scheduling","display_name":"Rate-monotonic scheduling","score":0.34663891792297363},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.32068896293640137},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.26289618015289307},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.23530036211013794}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7061947584152222},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.628765881061554},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.6199290752410889},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.6034122705459595},{"id":"https://openalex.org/C206952183","wikidata":"https://www.wikidata.org/wiki/Q1193100","display_name":"Preemption","level":2,"score":0.5771301984786987},{"id":"https://openalex.org/C122141398","wikidata":"https://www.wikidata.org/wiki/Q5456330","display_name":"Fixed-priority pre-emptive scheduling","level":5,"score":0.5645748972892761},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.4563894271850586},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.44247063994407654},{"id":"https://openalex.org/C2780451532","wikidata":"https://www.wikidata.org/wiki/Q759676","display_name":"Task (project management)","level":2,"score":0.4349522590637207},{"id":"https://openalex.org/C31689143","wikidata":"https://www.wikidata.org/wiki/Q733809","display_name":"Fair-share scheduling","level":3,"score":0.35831886529922485},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3507249355316162},{"id":"https://openalex.org/C127456818","wikidata":"https://www.wikidata.org/wiki/Q238879","display_name":"Rate-monotonic scheduling","level":4,"score":0.34663891792297363},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.32068896293640137},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.26289618015289307},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.23530036211013794},{"id":"https://openalex.org/C187736073","wikidata":"https://www.wikidata.org/wiki/Q2920921","display_name":"Management","level":1,"score":0.0},{"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/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/s0895480191221829","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0895480191221829","pdf_url":null,"source":{"id":"https://openalex.org/S117679221","display_name":"SIAM Journal on Discrete Mathematics","issn_l":"0895-4801","issn":["0895-4801","1095-7146"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Discrete Mathematics","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":8,"referenced_works":["https://openalex.org/W1996376059","https://openalex.org/W2057913648","https://openalex.org/W2058817479","https://openalex.org/W2095381673","https://openalex.org/W2101848567","https://openalex.org/W2132281350","https://openalex.org/W2154305205","https://openalex.org/W2581172100"],"related_works":["https://openalex.org/W3184267879","https://openalex.org/W1545991362","https://openalex.org/W2169142010","https://openalex.org/W2167574351","https://openalex.org/W2184166483","https://openalex.org/W2545511463","https://openalex.org/W1526709096","https://openalex.org/W4300092030","https://openalex.org/W2225350526","https://openalex.org/W2128426273"],"abstract_inverted_index":{"This":[0,60],"paper":[1,61],"addresses":[2],"the":[3,34,38,90,96,104,121],"problem":[4,35],"of":[5,15,20,36,57,70,87,106,142],"preemptive":[6,55,68],"scheduling":[7,56,69],"on":[8,25,108,138],"parallel-task":[9,12,42,72,129],"systems.":[10],"A":[11],"system":[13,73],"consists":[14],"several":[16],"independent":[17,58],"tasks,":[18],"each":[19],"which":[21,100,109,132],"can":[22,102,112,135],"be":[23,113,136],"executed":[24,137],"one":[26],"or":[27],"more":[28],"processors.":[29,143],"Du":[30,125],"and":[31,44,54,77,126],"Leung":[32,127],"introduced":[33],"minimizing":[37],"schedule":[39],"length":[40],"in":[41,120,131],"systems":[43,130],"showed":[45],"that":[46],"it":[47],"is":[48,95],"strongly":[49],"NP-hard":[50],"for":[51,67,89,128],"both":[52],"nonpreemptive":[53],"tasks.":[59,79],"presents":[62],"a":[63,71,82,110,133],"polynomial-time":[64],"approximation":[65,91],"algorithm":[66],"with":[74],"n":[75],"processors":[76,107],"w":[78],"We":[80],"derive":[81],"tight":[83],"worst-case":[84],"performance":[85],"bound":[86],"r":[88,94],"algorithm,":[92],"where":[93],"maximum":[97],"factor":[98],"by":[99,124],"we":[101],"increase":[103],"number":[105,141],"task":[111,134],"executed.":[114],"For":[115],"example,":[116],"$r":[117],"=":[118],"2$":[119],"model":[122],"defined":[123],"any":[139],"integral":[140]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}