{"id":"https://openalex.org/W2043412715","doi":"https://doi.org/10.1137/s0097539702410697","title":"Parallel Processor Scheduling with Limited Number of Preemptions","display_name":"Parallel Processor Scheduling with Limited Number of Preemptions","publication_year":2003,"publication_date":"2003-01-01","ids":{"openalex":"https://openalex.org/W2043412715","doi":"https://doi.org/10.1137/s0097539702410697","mag":"2043412715"},"language":"en","primary_location":{"id":"doi:10.1137/s0097539702410697","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0097539702410697","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"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 Computing","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/A5017904021","display_name":"Oliver Braun","orcid":"https://orcid.org/0000-0001-5155-3033"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Oliver Braun","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5026890421","display_name":"G\u00fcnter Schmidt","orcid":"https://orcid.org/0000-0003-1944-0885"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"G\u00fcnter Schmidt","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5017904021"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":3.0655,"has_fulltext":false,"cited_by_count":31,"citation_normalized_percentile":{"value":0.90792415,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"32","issue":"3","first_page":"671","last_page":"680"},"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.9980000257492065,"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.9934999942779541,"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/schedule","display_name":"Schedule","score":0.7055491209030151},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.7008262276649475},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.654712975025177},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.5921530723571777},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.5689760446548462},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5548329949378967},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.49779820442199707},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.48086458444595337},{"id":"https://openalex.org/keywords/preemption","display_name":"Preemption","score":0.4165416955947876},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.366686075925827},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.24821016192436218},{"id":"https://openalex.org/keywords/operating-system","display_name":"Operating system","score":0.08190661668777466}],"concepts":[{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.7055491209030151},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.7008262276649475},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.654712975025177},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5921530723571777},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.5689760446548462},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5548329949378967},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.49779820442199707},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.48086458444595337},{"id":"https://openalex.org/C206952183","wikidata":"https://www.wikidata.org/wiki/Q1193100","display_name":"Preemption","level":2,"score":0.4165416955947876},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.366686075925827},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.24821016192436218},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.08190661668777466},{"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.1137/s0097539702410697","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0097539702410697","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"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 Computing","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.4699999988079071,"id":"https://metadata.un.org/sdg/8","display_name":"Decent work and economic growth"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":9,"referenced_works":["https://openalex.org/W634463279","https://openalex.org/W2001799934","https://openalex.org/W2002429769","https://openalex.org/W2011039300","https://openalex.org/W2058817479","https://openalex.org/W2066045289","https://openalex.org/W2104680817","https://openalex.org/W2532368074","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W3191866865","https://openalex.org/W840708677","https://openalex.org/W2361541374","https://openalex.org/W1439300391","https://openalex.org/W1970491116","https://openalex.org/W2888133284","https://openalex.org/W1570112753","https://openalex.org/W601696587","https://openalex.org/W3088661666","https://openalex.org/W2794663421"],"abstract_inverted_index":{"In":[0],"this":[1],"paper,":[2],"we":[3,92],"compare":[4],"the":[5,43,46,50,58,61,68,95,98,106,114,126],"makespan":[6],"of":[7,18,49,60,97,101],"preemptive":[8,70,116],"and":[9],"i-preemptive":[10,63],"schedules":[11],"where":[12],"only":[13],"a":[14,102],"limited":[15],"number":[16],"i":[17],"preemptions":[19],"is":[20,24,40,74,120],"allowed.":[21],"The":[22,38],"problem":[23],"to":[25,41],"schedule":[26,64,71,104,117],"n":[27],"independent":[28],"jobs":[29],"on":[30],"m":[31],"identical":[32],"processors":[33],"that":[34,53,57,94],"operate":[35],"in":[36],"parallel.":[37],"objective":[39],"minimize":[42],"makespan,":[44],"i.e.,":[45],"completion":[47],"time":[48,110],"last":[51],"job":[52],"finishes.":[54],"We":[55],"show":[56,93],"ratio":[59,96],"optimal":[62,69,115],"length":[65,72,99,118],"${C_{max}^{ip^*}}$":[66],"versus":[67,113],"${C_{max}^{p^*}}$":[73,119],"bounded":[75,121],"from":[76,122],"above":[77,123],"by":[78,124],"${C_{max}^{ip^*}}":[79],"\\le":[80],"{(":[81],"2":[82,84],"-":[83],"/":[85],"(m/(i+1)":[86],"+":[87],"1)":[88],")}":[89],"{C_{max}^{p^*}}$.":[90],"Furthermore,":[91],"${C_{max}^{LPT}}$":[100],"nonpreemptive":[103],"following":[105],"{\\it":[107],"longest":[108],"processing":[109],"(LPT)}":[111],"rule":[112],"exactly":[125],"same":[127],"bound":[128],"when":[129],"i=0.":[130]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2014,"cited_by_count":5},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":4}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}