{"id":"https://openalex.org/W3091776279","doi":"https://doi.org/10.15439/2020f33","title":"Multiprocessor Scheduling Problem with Release and Delivery Times","display_name":"Multiprocessor Scheduling Problem with Release and Delivery Times","publication_year":2020,"publication_date":"2020-09-26","ids":{"openalex":"https://openalex.org/W3091776279","doi":"https://doi.org/10.15439/2020f33","mag":"3091776279"},"language":"en","primary_location":{"id":"doi:10.15439/2020f33","is_oa":true,"landing_page_url":"https://doi.org/10.15439/2020f33","pdf_url":"https://annals-csis.org/proceedings/2020/drp/pdf/33.pdf","source":{"id":"https://openalex.org/S4220651875","display_name":"Annals of Computer Science and Information Systems","issn_l":"2300-5963","issn":["2300-5963"],"is_oa":true,"is_in_doaj":true,"is_core":false,"host_organization":"https://openalex.org/P4310317484","host_organization_name":"Polskie Towarzystwo Informatyczne","host_organization_lineage":["https://openalex.org/P4310317484"],"host_organization_lineage_names":["Polskie Towarzystwo Informatyczne"],"type":"conference"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Annals of Computer Science and Information Systems","raw_type":"proceedings-article"},"type":"conference-paper","indexed_in":["crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://annals-csis.org/proceedings/2020/drp/pdf/33.pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5079721400","display_name":"N. S. Grigor'eva","orcid":"https://orcid.org/0000-0002-6621-0911"},"institutions":[{"id":"https://openalex.org/I172901346","display_name":"St Petersburg University","ror":"https://ror.org/023znxa73","country_code":"RU","type":"education","lineage":["https://openalex.org/I172901346"]}],"countries":["RU"],"is_corresponding":true,"raw_author_name":"Natalia Grigoreva","raw_affiliation_strings":["St.Petersburg State University Universitetskay nab. 7/9, St.Petersburg, Russia"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"St.Petersburg State University Universitetskay nab. 7/9, St.Petersburg, Russia","institution_ids":["https://openalex.org/I172901346"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5079721400"],"corresponding_institution_ids":["https://openalex.org/I172901346"],"apc_list":null,"apc_paid":null,"fwci":0.7652,"has_fulltext":true,"cited_by_count":4,"citation_normalized_percentile":{"value":0.66861855,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"21","issue":null,"first_page":"263","last_page":"269"},"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/T11814","display_name":"Advanced Manufacturing and Logistics Optimization","score":0.9923999905586243,"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.9886999726295471,"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/multiprocessor-scheduling","display_name":"Multiprocessor scheduling","score":0.8308301568031311},{"id":"https://openalex.org/keywords/preemption","display_name":"Preemption","score":0.8198661804199219},{"id":"https://openalex.org/keywords/multiprocessing","display_name":"Multiprocessing","score":0.8068499565124512},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7904647588729858},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.6520470976829529},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.6159001588821411},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.6129361391067505},{"id":"https://openalex.org/keywords/idle","display_name":"Idle","score":0.5855733752250671},{"id":"https://openalex.org/keywords/least-slack-time-scheduling","display_name":"Least slack time scheduling","score":0.4483182430267334},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.44447410106658936},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.4291744530200958},{"id":"https://openalex.org/keywords/processor-scheduling","display_name":"Processor scheduling","score":0.42015761137008667},{"id":"https://openalex.org/keywords/real-time-computing","display_name":"Real-time computing","score":0.3294292092323303},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2767348289489746},{"id":"https://openalex.org/keywords/flow-shop-scheduling","display_name":"Flow shop scheduling","score":0.26437580585479736},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.23261168599128723},{"id":"https://openalex.org/keywords/operating-system","display_name":"Operating system","score":0.15126872062683105},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.11233305931091309}],"concepts":[{"id":"https://openalex.org/C85924588","wikidata":"https://www.wikidata.org/wiki/Q107419135","display_name":"Multiprocessor scheduling","level":5,"score":0.8308301568031311},{"id":"https://openalex.org/C206952183","wikidata":"https://www.wikidata.org/wiki/Q1193100","display_name":"Preemption","level":2,"score":0.8198661804199219},{"id":"https://openalex.org/C4822641","wikidata":"https://www.wikidata.org/wiki/Q846651","display_name":"Multiprocessing","level":2,"score":0.8068499565124512},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7904647588729858},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.6520470976829529},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.6159001588821411},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.6129361391067505},{"id":"https://openalex.org/C16320812","wikidata":"https://www.wikidata.org/wiki/Q1812200","display_name":"Idle","level":2,"score":0.5855733752250671},{"id":"https://openalex.org/C132439773","wikidata":"https://www.wikidata.org/wiki/Q1810747","display_name":"Least slack time scheduling","level":5,"score":0.4483182430267334},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.44447410106658936},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.4291744530200958},{"id":"https://openalex.org/C2984822820","wikidata":"https://www.wikidata.org/wiki/Q1123036","display_name":"Processor scheduling","level":3,"score":0.42015761137008667},{"id":"https://openalex.org/C79403827","wikidata":"https://www.wikidata.org/wiki/Q3988","display_name":"Real-time computing","level":1,"score":0.3294292092323303},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2767348289489746},{"id":"https://openalex.org/C158336966","wikidata":"https://www.wikidata.org/wiki/Q3074426","display_name":"Flow shop scheduling","level":4,"score":0.26437580585479736},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.23261168599128723},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.15126872062683105},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.11233305931091309}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.15439/2020f33","is_oa":true,"landing_page_url":"https://doi.org/10.15439/2020f33","pdf_url":"https://annals-csis.org/proceedings/2020/drp/pdf/33.pdf","source":{"id":"https://openalex.org/S4220651875","display_name":"Annals of Computer Science and Information Systems","issn_l":"2300-5963","issn":["2300-5963"],"is_oa":true,"is_in_doaj":true,"is_core":false,"host_organization":"https://openalex.org/P4310317484","host_organization_name":"Polskie Towarzystwo Informatyczne","host_organization_lineage":["https://openalex.org/P4310317484"],"host_organization_lineage_names":["Polskie Towarzystwo Informatyczne"],"type":"conference"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Annals of Computer Science and Information Systems","raw_type":"proceedings-article"},{"id":"pmh:oai:doaj.org/article:cbb4adb3a3f44634827f1f2ac2707891","is_oa":false,"landing_page_url":"https://doaj.org/article/cbb4adb3a3f44634827f1f2ac2707891","pdf_url":null,"source":{"id":"https://openalex.org/S4306401280","display_name":"DOAJ (DOAJ: Directory of Open Access Journals)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Annals of computer science and information systems, Vol 21, Pp 263-269 (2020)","raw_type":"article"}],"best_oa_location":{"id":"doi:10.15439/2020f33","is_oa":true,"landing_page_url":"https://doi.org/10.15439/2020f33","pdf_url":"https://annals-csis.org/proceedings/2020/drp/pdf/33.pdf","source":{"id":"https://openalex.org/S4220651875","display_name":"Annals of Computer Science and Information Systems","issn_l":"2300-5963","issn":["2300-5963"],"is_oa":true,"is_in_doaj":true,"is_core":false,"host_organization":"https://openalex.org/P4310317484","host_organization_name":"Polskie Towarzystwo Informatyczne","host_organization_lineage":["https://openalex.org/P4310317484"],"host_organization_lineage_names":["Polskie Towarzystwo Informatyczne"],"type":"conference"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Annals of Computer Science and Information Systems","raw_type":"proceedings-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W3091776279.pdf","grobid_xml":"https://content.openalex.org/works/W3091776279.grobid-xml"},"referenced_works_count":27,"referenced_works":["https://openalex.org/W81942118","https://openalex.org/W1488422606","https://openalex.org/W1968822565","https://openalex.org/W1976720470","https://openalex.org/W1981795232","https://openalex.org/W1989570164","https://openalex.org/W1993322546","https://openalex.org/W2013434529","https://openalex.org/W2028826326","https://openalex.org/W2042312329","https://openalex.org/W2057392949","https://openalex.org/W2065427999","https://openalex.org/W2068647239","https://openalex.org/W2076677764","https://openalex.org/W2078517877","https://openalex.org/W2080316412","https://openalex.org/W2107682017","https://openalex.org/W2118232729","https://openalex.org/W2163085705","https://openalex.org/W2187366078","https://openalex.org/W2574543845","https://openalex.org/W2743045177","https://openalex.org/W2796716881","https://openalex.org/W4254292280","https://openalex.org/W6657676618","https://openalex.org/W6664768869","https://openalex.org/W6742705900"],"related_works":["https://openalex.org/W142012776","https://openalex.org/W1640420690","https://openalex.org/W4239547604","https://openalex.org/W2158643246","https://openalex.org/W3116890492","https://openalex.org/W2245286458","https://openalex.org/W2155564881","https://openalex.org/W2166627447","https://openalex.org/W2533764636","https://openalex.org/W2140195356"],"abstract_inverted_index":{"The":[0,57,83,142],"multiprocessor":[1,153],"scheduling":[2],"problem":[3,78],"is":[4,54,59,75,88,165],"defined":[5],"as":[6,120],"follows:":[7],"set":[8],"of":[9,159],"jobs":[10,46],"have":[11],"to":[12,60],"be":[13,36,48,129],"executed":[14],"on":[15,38,52],"parallel":[16,73],"identical":[17],"processors.":[18],"For":[19],"each":[20],"job":[21,34,100],"we":[22],"know":[23],"release":[24],"time,":[25,43,63],"processing":[26,171],"time":[27,133,149],"and":[28],"delivery":[29,104],"time.":[30,105,172],"At":[31],"most":[32],"one":[33],"can":[35,128],"performed":[37],"every":[39],"processor":[40,127],"at":[41,131],"a":[42,76,121,126,132,139],"but":[44],"all":[45,66],"may":[47],"simultaneously":[49],"delivered.":[50,69],"Preemption":[51],"processors":[53,74],"not":[55],"allowed.":[56],"goal":[58],"minimize":[61],"the":[62,80,93,98,102,145,152,163,169],"by":[64,96],"which":[65,91,125],"tasks":[67,71],"are":[68],"Scheduling":[70],"among":[72],"NP-hard":[77],"in":[79,124],"strong":[81],"sense.":[82],"best":[84],"known":[85],"approximation":[86,146],"algorithm":[87,107,150,161],"Jackson's":[89],"algorithm,":[90],"generates":[92,108],"list":[94],"schedule":[95,119,123],"selecting":[97],"ready":[99,140],"with":[101],"largest":[103,170],"This":[106],"no":[109],"delay":[110],"schedules.":[111],"We":[112,155],"define":[113],"an":[114],"IIT":[115],"(inserted":[116],"idle":[117,130,148],"time)":[118],"feasible":[122],"when":[134],"it":[135],"could":[136],"begin":[137],"performing":[138],"job.":[141],"paper":[143],"proposes":[144],"inserted":[147],"for":[151],"scheduling.":[154],"proved":[156],"that":[157],"deviation":[158],"this":[160],"from":[162],"optimum":[164],"smaller":[166],"then":[167],"twice":[168]},"counts_by_year":[{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}