乐胖代购免代理版

{"id":"https://openalex.org/W3195748975","doi":"https://doi.org/10.3390/a14080246","title":"Scheduling Multiprocessor Tasks with Equal Processing Times as a Mixed Graph Coloring Problem","display_name":"Scheduling Multiprocessor Tasks with Equal Processing Times as a Mixed Graph Coloring Problem","publication_year":2021,"publication_date":"2021-08-19","ids":{"openalex":"https://openalex.org/W3195748975","doi":"https://doi.org/10.3390/a14080246","mag":"3195748975"},"language":"en","primary_location":{"is_oa":true,"landing_page_url":"https://doi.org/10.3390/a14080246","pdf_url":"https://www.mdpi.com/1999-4893/14/8/246/pdf","source":{"id":"https://openalex.org/S190629608","display_name":"Algorithms","issn_l":"1999-4893","issn":["1999-4893"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310310987","host_organization_name":"Multidisciplinary Digital Publishing Institute","host_organization_lineage":["https://openalex.org/P4310310987"],"host_organization_lineage_names":["Multidisciplinary Digital Publishing Institute"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true},"type":"article","type_crossref":"journal-article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://www.mdpi.com/1999-4893/14/8/246/pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5062123009","display_name":"Yuri N. Sotskov","orcid":"https://orcid.org/0000-0002-9971-6169"},"institutions":[{"id":"https://openalex.org/I4210105192","display_name":"United Institute of Informatics Problems","ror":"https://ror.org/01ccbsb07","country_code":"BY","type":"facility","lineage":["https://openalex.org/I151823869","https://openalex.org/I4210105192","https://openalex.org/I4210116091"]},{"id":"https://openalex.org/I151823869","display_name":"National Academy of Sciences of Belarus","ror":"https://ror.org/02j8pe645","country_code":"BY","type":"government","lineage":["https://openalex.org/I151823869"]}],"countries":["BY"],"is_corresponding":true,"raw_author_name":"Yuri N. Sotskov","raw_affiliation_strings":["United Institute of Informatics Problems of the National Academy of Sciences of Belarus, 6 Surganov Street, 220012 Minsk, Belarus"],"affiliations":[{"raw_affiliation_string":"United Institute of Informatics Problems of the National Academy of Sciences of Belarus, 6 Surganov Street, 220012 Minsk, Belarus","institution_ids":["https://openalex.org/I4210105192","https://openalex.org/I151823869"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5062785984","display_name":"Evangelina I. Mihova","orcid":null},"institutions":[],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Evangelina I. Mihova","raw_affiliation_strings":["Oskar-Maria-Graf-Gymnasium, Keltenweg 5, 85375 Neufahrn bei Freising, Germany"],"affiliations":[{"raw_affiliation_string":"Oskar-Maria-Graf-Gymnasium, Keltenweg 5, 85375 Neufahrn bei Freising, Germany","institution_ids":[]}]}],"institution_assertions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5062123009"],"corresponding_institution_ids":["https://openalex.org/I4210105192","https://openalex.org/I151823869"],"apc_list":{"value":1400,"currency":"CHF","value_usd":1515,"provenance":"doaj"},"apc_paid":{"value":1400,"currency":"CHF","value_usd":1515,"provenance":"doaj"},"fwci":0.419,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.816089,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":72,"max":76},"biblio":{"volume":"14","issue":"8","first_page":"246","last_page":"246"},"is_retracted":false,"is_paratext":false,"primary_topic":{"id":"https://openalex.org/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9999,"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.9999,"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.9869,"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/T11814","display_name":"Advanced Manufacturing and Logistics Optimization","score":0.9777,"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/multiprocessor-scheduling","display_name":"Multiprocessor Scheduling","score":0.6056027},{"id":"https://openalex.org/keywords/fractional-coloring","display_name":"Fractional coloring","score":0.53988236},{"id":"https://openalex.org/keywords/graph-coloring","display_name":"Graph Coloring","score":0.514609},{"id":"https://openalex.org/keywords/complete-coloring","display_name":"Complete coloring","score":0.4902323},{"id":"https://openalex.org/keywords/edge-coloring","display_name":"Edge Coloring","score":0.47060925},{"id":"https://openalex.org/keywords/greedy-coloring","display_name":"Greedy coloring","score":0.43378493}],"concepts":[{"id":"https://openalex.org/C4822641","wikidata":"https://www.wikidata.org/wiki/Q846651","display_name":"Multiprocessing","level":2,"score":0.627221},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.62223834},{"id":"https://openalex.org/C85924588","wikidata":"https://www.wikidata.org/wiki/Q107419135","display_name":"Multiprocessor scheduling","level":5,"score":0.6056027},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.56408954},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.54139936},{"id":"https://openalex.org/C158319403","wikidata":"https://www.wikidata.org/wiki/Q5477527","display_name":"Fractional coloring","level":5,"score":0.53988236},{"id":"https://openalex.org/C76946457","wikidata":"https://www.wikidata.org/wiki/Q504843","display_name":"Graph coloring","level":3,"score":0.514609},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5037684},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.4958366},{"id":"https://openalex.org/C21642379","wikidata":"https://www.wikidata.org/wiki/Q3342988","display_name":"Complete coloring","level":5,"score":0.4902323},{"id":"https://openalex.org/C123809776","wikidata":"https://www.wikidata.org/wiki/Q1050972","display_name":"Edge coloring","level":5,"score":0.47060925},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.43443576},{"id":"https://openalex.org/C38767284","wikidata":"https://www.wikidata.org/wiki/Q5601715","display_name":"Greedy coloring","level":5,"score":0.43378493},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.40675795},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3972897},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.39292178},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.38572666},{"id":"https://openalex.org/C158336966","wikidata":"https://www.wikidata.org/wiki/Q3074426","display_name":"Flow shop scheduling","level":4,"score":0.25474286},{"id":"https://openalex.org/C149530733","wikidata":"https://www.wikidata.org/wiki/Q5597091","display_name":"Graph power","level":4,"score":0.218207},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.16802248},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.121860474},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"is_oa":true,"landing_page_url":"https://doi.org/10.3390/a14080246","pdf_url":"https://www.mdpi.com/1999-4893/14/8/246/pdf","source":{"id":"https://openalex.org/S190629608","display_name":"Algorithms","issn_l":"1999-4893","issn":["1999-4893"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310310987","host_organization_name":"Multidisciplinary Digital Publishing Institute","host_organization_lineage":["https://openalex.org/P4310310987"],"host_organization_lineage_names":["Multidisciplinary Digital Publishing Institute"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true},{"is_oa":true,"landing_page_url":"https://dx.doi.org/10.3390/a14080246","pdf_url":"https://www.mdpi.com/1999-4893/14/8/246/pdf?version=1629870518","source":{"id":"https://openalex.org/S4306400947","display_name":"MDPI (MDPI AG)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I4210097602","host_organization_name":"Multidisciplinary Digital Publishing Institute (Switzerland)","host_organization_lineage":["https://openalex.org/I4210097602"],"host_organization_lineage_names":["Multidisciplinary Digital Publishing Institute (Switzerland)"],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true}],"best_oa_location":{"is_oa":true,"landing_page_url":"https://doi.org/10.3390/a14080246","pdf_url":"https://www.mdpi.com/1999-4893/14/8/246/pdf","source":{"id":"https://openalex.org/S190629608","display_name":"Algorithms","issn_l":"1999-4893","issn":["1999-4893"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310310987","host_organization_name":"Multidisciplinary Digital Publishing Institute","host_organization_lineage":["https://openalex.org/P4310310987"],"host_organization_lineage_names":["Multidisciplinary Digital Publishing Institute"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true},"sustainable_development_goals":[{"display_name":"Decent work and economic growth","id":"https://metadata.un.org/sdg/8","score":0.43}],"grants":[],"datasets":[],"versions":[],"referenced_works_count":42,"referenced_works":["https://openalex.org/W1487374707","https://openalex.org/W1488422606","https://openalex.org/W1555410326","https://openalex.org/W1976079660","https://openalex.org/W1976357399","https://openalex.org/W1993315868","https://openalex.org/W1994012687","https://openalex.org/W1998948241","https://openalex.org/W2009015215","https://openalex.org/W2009097977","https://openalex.org/W2014334704","https://openalex.org/W2028687527","https://openalex.org/W2045154072","https://openalex.org/W2045159002","https://openalex.org/W2055222407","https://openalex.org/W2063077151","https://openalex.org/W2066356146","https://openalex.org/W2068615854","https://openalex.org/W2068646670","https://openalex.org/W2071300315","https://openalex.org/W2075753538","https://openalex.org/W2076508578","https://openalex.org/W2077674223","https://openalex.org/W2082853263","https://openalex.org/W2083664982","https://openalex.org/W2135507920","https://openalex.org/W2152454894","https://openalex.org/W2159506517","https://openalex.org/W2341350247","https://openalex.org/W2401610261","https://openalex.org/W2476899828","https://openalex.org/W2515639045","https://openalex.org/W2898918733","https://openalex.org/W2913961527","https://openalex.org/W3009788456","https://openalex.org/W3047691004","https://openalex.org/W3201148895","https://openalex.org/W4212875334","https://openalex.org/W4213214460","https://openalex.org/W4240119221","https://openalex.org/W4246938614","https://openalex.org/W613241997"],"related_works":["https://openalex.org/W4287598225","https://openalex.org/W4237246883","https://openalex.org/W3101541854","https://openalex.org/W3006791531","https://openalex.org/W2361216235","https://openalex.org/W2353563269","https://openalex.org/W2352676068","https://openalex.org/W2151059773","https://openalex.org/W2042876012","https://openalex.org/W1974068132"],"abstract_inverted_index":{"This":[0],"article":[1],"extends":[2],"the":[3,21,31,36,64,71,78,88,109,122,127,143,162,165,176,198,210,216],"scheduling":[4,22,80,212],"problem":[5,81,105],"with":[6,26,82],"dedicated":[7],"processors,":[8],"unit-time":[9],"tasks,":[10,38],"and":[11,138,157,222],"minimizing":[12],"maximal":[13,220],"lateness":[14],"Lmax":[15],"for":[16,194,209],"integer":[17,83],"due":[18],"dates":[19],"to":[20,48,91,121,149,171,214],"problem,":[23,52],"where":[24],"along":[25],"precedence":[27,65],"constraints":[28,66],"given":[29,69],"on":[30,70],"set":[32,73],"V={v1,v2,":[33],"\u2026,vn}":[34],"of":[35,41,63,87,108,111,115,126,167,178,197],"multiprocessor":[37,58],"a":[39,49,57,112],"subset":[40],"tasks":[42],"must":[43,55],"be":[44,68,97,150,172],"processed":[45],"simultaneously.":[46],"Contrary":[47],"classical":[50],"shop-scheduling":[51],"several":[53],"processors":[54],"fulfill":[56],"task.":[59],"Furthermore,":[60],"two":[61,135,154,183],"types":[62],"may":[67,96],"task":[72],"V.":[74],"We":[75,181],"prove":[76,182],"that":[77,106,187],"extended":[79,211],"release":[84],"times":[85],"ri\u22650":[86],"jobs":[89],"V":[90],"minimize":[92,215],"schedule":[93,217],"length":[94,218],"Cmax":[95],"solved":[98],"as":[99],"an":[100],"optimal":[101,195],"mixed":[102,128,199],"graph":[103,129],"coloring":[104],"consists":[107],"assignment":[110],"minimal":[113],"number":[114],"colors":[116,147],"(positive":[117],"integers)":[118],"{1,2,":[119],"\u2026,t}":[120],"vertices":[123,136,155],"{v1,v2,":[124],"\u2026,vn}=V":[125],"G=(V,A,":[130,201],"E)":[131],"such":[132],"that,":[133],"if":[134,153],"vp":[137],"vq":[139],"are":[140,159,207],"joined":[141,160],"by":[142,161],"edge":[144],"[vp,vq]\u2208E,":[145],"their":[146],"have":[148,203],"different.":[151],"Further,":[152],"vi":[156,169],"vj":[158],"arc":[163],"(vi,vj)\u2208A,":[164],"color":[166,177],"vertex":[168,179],"has":[170],"no":[173],"greater":[174],"than":[175],"vj.":[180],"theorems,":[184],"which":[185,206],"imply":[186],"most":[188],"analytical":[189],"results":[190],"proved":[191],"so":[192],"far":[193],"colorings":[196],"graphs":[200],"E),":[202],"analogous":[204],"results,":[205],"valid":[208],"problems":[213],"or":[219],"lateness,":[221],"vice":[223],"versa.":[224]},"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W3195748975","counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2021,"cited_by_count":1}],"updated_date":"2025-01-07T21:08:08.553837","created_date":"2021-08-30"}