乐胖代购免代理版

{"id":"https://openalex.org/W4400420516","doi":"https://doi.org/10.3390/a17070299","title":"Mixed Graph Colouring as Scheduling a Partially Ordered Set of Interruptible Multi-Processor Tasks with Integer Due Dates","display_name":"Mixed Graph Colouring as Scheduling a Partially Ordered Set of Interruptible Multi-Processor Tasks with Integer Due Dates","publication_year":2024,"publication_date":"2024-07-06","ids":{"openalex":"https://openalex.org/W4400420516","doi":"https://doi.org/10.3390/a17070299"},"language":"en","primary_location":{"is_oa":true,"landing_page_url":"https://doi.org/10.3390/a17070299","pdf_url":"https://www.mdpi.com/1999-4893/17/7/299/pdf?version=1721199980","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/17/7/299/pdf?version=1721199980","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5062785984","display_name":"Evangelina I. Mihova","orcid":null},"institutions":[{"id":"https://openalex.org/I8204097","display_name":"Ludwig-Maximilians-Universit\u00e4t M\u00fcnchen","ror":"https://ror.org/05591te55","country_code":"DE","type":"education","lineage":["https://openalex.org/I8204097"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Evangelina I. Mihova","raw_affiliation_strings":["Mathematical Institute, Faculty of Mathematics, Computer Science and Statistics, Ludwig-Maximilians-Universitat Munich, Geschwister-Scholl-Platz, 1, 80539 Munich, Germany"],"affiliations":[{"raw_affiliation_string":"Mathematical Institute, Faculty of Mathematics, Computer Science and Statistics, Ludwig-Maximilians-Universitat Munich, Geschwister-Scholl-Platz, 1, 80539 Munich, Germany","institution_ids":["https://openalex.org/I8204097"]}]},{"author_position":"last","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"]}],"countries":["BY"],"is_corresponding":true,"raw_author_name":"Yuri N. Sotskov","raw_affiliation_strings":["United Institute of Informatics Problems, National Academy of Sciences, 6 Surganov Street, 220012 Minsk, Belarus"],"affiliations":[{"raw_affiliation_string":"United Institute of Informatics Problems, National Academy of Sciences, 6 Surganov Street, 220012 Minsk, Belarus","institution_ids":["https://openalex.org/I4210105192"]}]}],"institution_assertions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5062123009"],"corresponding_institution_ids":["https://openalex.org/I4210105192"],"apc_list":{"value":1400,"currency":"CHF","value_usd":1515,"provenance":"doaj"},"apc_paid":{"value":1400,"currency":"CHF","value_usd":1515,"provenance":"doaj"},"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.0,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":0,"max":83},"biblio":{"volume":"17","issue":"7","first_page":"299","last_page":"299"},"is_retracted":false,"is_paratext":false,"primary_topic":{"id":"https://openalex.org/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9978,"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.9978,"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/T12401","display_name":"Scheduling and Timetabling Solutions","score":0.982,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T12177","display_name":"Resource-Constrained Project Scheduling","score":0.9684,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[],"concepts":[{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.6606027},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.6256164},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5931166},{"id":"https://openalex.org/C2780513914","wikidata":"https://www.wikidata.org/wiki/Q18210350","display_name":"Bottleneck","level":2,"score":0.58834827},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.55767804},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.48159978},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.3824615},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.34795874},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3449012},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.28453},{"id":"https://openalex.org/C149635348","wikidata":"https://www.wikidata.org/wiki/Q193040","display_name":"Embedded system","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}],"mesh":[],"locations_count":1,"locations":[{"is_oa":true,"landing_page_url":"https://doi.org/10.3390/a17070299","pdf_url":"https://www.mdpi.com/1999-4893/17/7/299/pdf?version=1721199980","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}],"best_oa_location":{"is_oa":true,"landing_page_url":"https://doi.org/10.3390/a17070299","pdf_url":"https://www.mdpi.com/1999-4893/17/7/299/pdf?version=1721199980","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":[{"id":"https://metadata.un.org/sdg/9","display_name":"Industry, innovation and infrastructure","score":0.49}],"grants":[{"funder":"https://openalex.org/F4320309920","funder_display_name":"Belarusian Republican Foundation for Fundamental Research","award_id":"\u03a623PH\u03a6-017"}],"datasets":[],"versions":[],"referenced_works_count":28,"referenced_works":["https://openalex.org/W1993315868","https://openalex.org/W1994012687","https://openalex.org/W2012929820","https://openalex.org/W2013943456","https://openalex.org/W2045159002","https://openalex.org/W2066356146","https://openalex.org/W2083664982","https://openalex.org/W2268385975","https://openalex.org/W2395453269","https://openalex.org/W2476899828","https://openalex.org/W2515639045","https://openalex.org/W2888986132","https://openalex.org/W2913961527","https://openalex.org/W2991534645","https://openalex.org/W3157924691","https://openalex.org/W3164085978","https://openalex.org/W3195748975","https://openalex.org/W3201148895","https://openalex.org/W4210288517","https://openalex.org/W4213214460","https://openalex.org/W4220934810","https://openalex.org/W4240119221","https://openalex.org/W4246938614","https://openalex.org/W4323657416","https://openalex.org/W4380189071","https://openalex.org/W4387385653","https://openalex.org/W4390629355","https://openalex.org/W4394627421"],"related_works":["https://openalex.org/W4281297310","https://openalex.org/W3204654320","https://openalex.org/W2895982276","https://openalex.org/W2595172197","https://openalex.org/W2350876336","https://openalex.org/W2146867217","https://openalex.org/W2127970246","https://openalex.org/W2084856301","https://openalex.org/W2039885954","https://openalex.org/W1981130628"],"abstract_inverted_index":{"We":[0],"investigate":[1],"relationships":[2],"between":[3],"scheduling":[4,27,51,94,110,139,177],"problems":[5,17,28,111,116],"with":[6],"the":[7,22,33,45,49,63,77,88,101,131,137,143,150,154,160,166],"bottleneck":[8],"objective":[9],"functions":[10],"(minimising":[11],"makespan":[12],"or":[13],"maximal":[14],"lateness)":[15],"and":[16,40,73,179],"of":[18,21,32,44,76,117,121,130,153,159,169],"optimal":[19,59,119,128,167],"colourings":[20,120,168],"mixed":[23,103,123,132,145,170],"graphs.":[24,124],"The":[25],"investigated":[26],"have":[29],"integer":[30,37,41],"durations":[31],"multi-processor":[34],"tasks":[35],"(operations),":[36],"release":[38],"dates":[39,43],"due":[42,148],"given":[46,67],"jobs.":[47],"In":[48],"studied":[50],"problems,":[52,157,178],"it":[53],"is":[54,134],"required":[55],"to":[56,115,136,149],"find":[57],"an":[58,127],"schedule":[60],"for":[61,91,165,175],"processing":[62],"partially":[64],"ordered":[65],"operations,":[66],"that":[68,87,108,162],"operation":[69],"interruptions":[70],"are":[71],"allowed":[72],"indicated":[74],"subsets":[75],"unit-time":[78],"operations":[79],"must":[80],"be":[81,97,113],"processed":[82],"simultaneously.":[83],"First,":[84],"we":[85,106],"show":[86],"input":[89],"data":[90],"any":[92],"considered":[93,138,155,176],"problem":[95,140],"can":[96,112],"completely":[98],"determined":[99,141],"by":[100,142],"corresponding":[102,122],"graph.":[104,146],"Second,":[105],"prove":[107],"solvable":[109],"reduced":[114],"finding":[118,126],"Third,":[125],"colouring":[129],"graph":[133],"equivalent":[135],"same":[144],"Finally,":[147],"proven":[151,164],"equivalence":[152],"optimisation":[156],"most":[158],"results":[161,174],"were":[163],"graphs":[171],"generate":[172],"similar":[173],"vice":[180],"versa.":[181]},"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W4400420516","counts_by_year":[],"updated_date":"2025-01-08T08:27:01.651802","created_date":"2024-07-09"}