{"id":"https://openalex.org/W4408924526","doi":"https://doi.org/10.17223/20710410/67/7","title":"CONSTRUCTIVE ALGORITHMS FOR THE SCHEDULING PROBLEM ON TWO PROCESSORS WITH THE MAXIMUM TIME OFFSET CRITERION TAKING INTO ACCOUNT PARALLELIZATION AND ENERGY CONSUMPTION","display_name":"CONSTRUCTIVE ALGORITHMS FOR THE SCHEDULING PROBLEM ON TWO PROCESSORS WITH THE MAXIMUM TIME OFFSET CRITERION TAKING INTO ACCOUNT PARALLELIZATION AND ENERGY CONSUMPTION","publication_year":2025,"publication_date":"2025-01-01","ids":{"openalex":"https://openalex.org/W4408924526","doi":"https://doi.org/10.17223/20710410/67/7"},"language":"en","primary_location":{"id":"doi:10.17223/20710410/67/7","doi":"https://doi.org/10.17223/20710410/67/7","is_oa":true,"landing_page_url":"https://doi.org/10.17223/20710410/67/7","pdf_url":"https://vital.lib.tsu.ru/vital/access/services/Download/koha:001153956/SOURCE1","source":{"id":"https://openalex.org/S4210210704","display_name":"PRIKLADNAYa DISKRETNAYa MATEMATIKA","issn_l":"2071-0410","issn":["2071-0410","2311-2263"],"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/P4310312658","host_organization_name":"Omsk State University","host_organization_lineage":["https://openalex.org/P4310312658"],"host_organization_lineage_names":["Omsk State University"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Prikladnaya Diskretnaya Matematika","raw_type":"journal-article"},"volume":null,"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://vital.lib.tsu.ru/vital/access/services/Download/koha:001153956/SOURCE1","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Y. V. Zakharova","orcid":null,"observed_orcids":[]},"institutions":[{"id":"https://openalex.org/I269199756","display_name":"Omsk State University","ror":"https://ror.org/01k6vxj52","country_code":"RU","type":"education","lineage":["https://openalex.org/I269199756"]},{"id":"https://openalex.org/I4210096862","display_name":"Sobolev Institute of Mathematics","ror":"https://ror.org/00shc0s02","country_code":"RU","type":"facility","lineage":["https://openalex.org/I1313323035","https://openalex.org/I4210096862","https://openalex.org/I4210124601","https://openalex.org/I4210127387"]}],"countries":["RU"],"is_corresponding":false,"raw_author_name":"Y. V. Zakharova","raw_affiliation_strings":["Dostoevsky Omsk State University , Omsk , Russia","Sobolev Institute of Mathematics , Omsk , Russia"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Dostoevsky Omsk State University , Omsk , Russia","institution_ids":["https://openalex.org/I269199756"]},{"raw_affiliation_string":"Sobolev Institute of Mathematics , Omsk , Russia","institution_ids":["https://openalex.org/I4210096862"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5116830445","display_name":"A. O. Evtina","orcid":null,"observed_orcids":[]},"institutions":[{"id":"https://openalex.org/I269199756","display_name":"Omsk State University","ror":"https://ror.org/01k6vxj52","country_code":"RU","type":"education","lineage":["https://openalex.org/I269199756"]},{"id":"https://openalex.org/I4210096862","display_name":"Sobolev Institute of Mathematics","ror":"https://ror.org/00shc0s02","country_code":"RU","type":"facility","lineage":["https://openalex.org/I1313323035","https://openalex.org/I4210096862","https://openalex.org/I4210124601","https://openalex.org/I4210127387"]}],"countries":["RU"],"is_corresponding":false,"raw_author_name":"A. O. Evtina","raw_affiliation_strings":["Dostoevsky Omsk State University , Omsk , Russia","Sobolev Institute of Mathematics , Omsk , Russia"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Dostoevsky Omsk State University , Omsk , Russia","institution_ids":["https://openalex.org/I269199756"]},{"raw_affiliation_string":"Sobolev Institute of Mathematics , Omsk , Russia","institution_ids":["https://openalex.org/I4210096862"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.04307903,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":"67","first_page":"118","last_page":"128"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9535999894142151,"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.9535999894142151,"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/T10933","display_name":"Real-Time Systems Scheduling","score":0.011099999770522118,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.009399999864399433,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/two-processor-scheduling","display_name":"two-processor scheduling","score":0.8709999918937683},{"id":"https://openalex.org/keywords/maximum-lateness","display_name":"maximum lateness","score":0.7269999980926514},{"id":"https://openalex.org/keywords/energy-consumption","display_name":"energy consumption","score":0.9010000228881836},{"id":"https://openalex.org/keywords/parallelization","display_name":"parallelization","score":0.722000002861023},{"id":"https://openalex.org/keywords/np-hardness","display_name":"NP-hardness","score":0.800000011920929},{"id":"https://openalex.org/keywords/polynomial-time-approximation","display_name":"polynomial-time approximation","score":0.6990000009536743},{"id":"https://openalex.org/keywords/convex-optimization","display_name":"convex optimization","score":0.8109999895095825},{"id":"https://openalex.org/keywords/energy-balance","display_name":"energy balance","score":0.414000004529953},{"id":"https://openalex.org/keywords/computational-complexity","display_name":"computational complexity","score":0.6290000081062317}],"concepts":[{"id":"https://openalex.org/C175291020","wikidata":"https://www.wikidata.org/wiki/Q1156822","display_name":"Offset (computer science)","level":2,"score":0.7758750915527344},{"id":"https://openalex.org/C2778701210","wikidata":"https://www.wikidata.org/wiki/Q28130034","display_name":"Constructive","level":3,"score":0.726157546043396},{"id":"https://openalex.org/C2780165032","wikidata":"https://www.wikidata.org/wiki/Q16869822","display_name":"Energy consumption","level":2,"score":0.6967200040817261},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6754468679428101},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.585391640663147},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.5341808795928955},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4355887174606323},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4296095371246338},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.18043333292007446},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.10044080018997192},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.07325568795204163},{"id":"https://openalex.org/C98045186","wikidata":"https://www.wikidata.org/wiki/Q205663","display_name":"Process (computing)","level":2,"score":0.053734660148620605},{"id":"https://openalex.org/C119599485","wikidata":"https://www.wikidata.org/wiki/Q43035","display_name":"Electrical engineering","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.17223/20710410/67/7","doi":"https://doi.org/10.17223/20710410/67/7","is_oa":true,"landing_page_url":"https://doi.org/10.17223/20710410/67/7","pdf_url":"https://vital.lib.tsu.ru/vital/access/services/Download/koha:001153956/SOURCE1","source":{"id":"https://openalex.org/S4210210704","display_name":"PRIKLADNAYa DISKRETNAYa MATEMATIKA","issn_l":"2071-0410","issn":["2071-0410","2311-2263"],"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/P4310312658","host_organization_name":"Omsk State University","host_organization_lineage":["https://openalex.org/P4310312658"],"host_organization_lineage_names":["Omsk State University"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Prikladnaya Diskretnaya Matematika","raw_type":"journal-article"},{"id":"pmh:koha:001153956","doi":null,"is_oa":true,"landing_page_url":"https://vital.lib.tsu.ru/vital/access/manager/Repository/koha:001153956","pdf_url":null,"source":{"id":"https://openalex.org/S7407055105","display_name":"Digital library (repository) of Tomsk State University","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"\u041f\u0440\u0438\u043a\u043b\u0430\u0434\u043d\u0430\u044f \u0434\u0438\u0441\u043a\u0440\u0435\u0442\u043d\u0430\u044f \u043c\u0430\u0442\u0435\u043c\u0430\u0442\u0438\u043a\u0430. 2025. \u2116 67. \u0421. 118-128","raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":{"id":"doi:10.17223/20710410/67/7","doi":"https://doi.org/10.17223/20710410/67/7","is_oa":true,"landing_page_url":"https://doi.org/10.17223/20710410/67/7","pdf_url":"https://vital.lib.tsu.ru/vital/access/services/Download/koha:001153956/SOURCE1","source":{"id":"https://openalex.org/S4210210704","display_name":"PRIKLADNAYa DISKRETNAYa MATEMATIKA","issn_l":"2071-0410","issn":["2071-0410","2311-2263"],"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/P4310312658","host_organization_name":"Omsk State University","host_organization_lineage":["https://openalex.org/P4310312658"],"host_organization_lineage_names":["Omsk State University"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Prikladnaya Diskretnaya Matematika","raw_type":"journal-article"},"sustainable_development_goals":[],"sustainable_development_goals_aurora":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4408924526.pdf","grobid_xml":"https://content.openalex.org/works/W4408924526.grobid-xml"},"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W2377770720","https://openalex.org/W94411513","https://openalex.org/W4311883357","https://openalex.org/W2113626999","https://openalex.org/W160889949","https://openalex.org/W2197168648","https://openalex.org/W2364696089","https://openalex.org/W4300816516","https://openalex.org/W309910862","https://openalex.org/W2369004811"],"abstract_inverted_index":{"We":[0,71,122,162,182],"provide":[1],"theoretical":[2,202],"and":[3,18,30,44,87,134],"experimental":[4,153],"analysis":[5,203],"of":[6,10,22,28,33,42,52,62,103,127,158,166,196],"the":[7,23,26,36,40,50,60,63,67,74,79,83,105,109,119,124,128,132,148,156,159,170,174,190,194,206],"computational":[8],"complexity":[9],"one":[11],"scheduling":[12],"problem":[13,75,86,107,207],"arising":[14],"in":[15,168,188],"computer":[16],"systems":[17],"applications.":[19],"The":[20,57,100,152,201],"feature":[21],"statement":[24],"is":[25,55,59,76,98,115,140,177,208],"parallelization":[27],"operations":[29,43,199,213],"resource-dependent":[31],"durations":[32],"operations.":[34],"Here":[35],"processor":[37],"speed":[38],"affects":[39],"duration":[41],"power":[45],"consumption.":[46],"For":[47],"each":[48],"operation":[49],"number":[51,195],"required":[53],"processors":[54],"given.":[56],"criterion":[58],"minimization":[61],"maximum":[64,145],"lateness":[65,146],"under":[66],"given":[68],"energy":[69],"budget.":[70],"prove":[72],"that":[73,136,205],"NP-hard":[77],"using":[78],"polynomial":[80,95],"reduction":[81],"from":[82,173],"well-known":[84],"3-Partition":[85],"constructing":[88],"non-idle":[89],"instances.":[90],"An":[91],"approximate":[92],"algorithm":[93,101,133],"with":[94],"running":[96],"time":[97],"proposed.":[99],"consists":[102],"reducing":[104],"two-processor":[106],"to":[108],"single-processor":[110,120],"one.":[111],"A":[112],"convex":[113],"program":[114],"proposed":[116,160],"for":[117],"solving":[118],"problem.":[121],"investigate":[123],"block":[125],"properties":[126],"solutions":[129],"generated":[130],"by":[131],"show":[135,155],"their":[137],"objective":[138],"value":[139],"at":[141],"most":[142],"doubled":[143],"optimum":[144],"plus":[147],"maximal":[149],"due":[150],"date.":[151],"results":[154],"applicability":[157],"algorithm.":[161],"construct":[163],"a":[164,186],"series":[165],"instances":[167],"which":[169],"relative":[171,191],"deviation":[172,192],"lower":[175],"bound":[176],"less":[178],"than":[179],"15":[180],"%.":[181],"also":[183],"experimentally":[184],"identify":[185],"tendency":[187],"decreasing":[189],"when":[193,211],"fully":[197,215],"parallelizable":[198],"increases.":[200],"guarantees":[204],"polynomially":[209],"solvable":[210],"all":[212],"are":[214],"parallelizable.":[216]},"counts_by_year":[],"updated_date":"2026-09-21T07:43:02.447757","created_date":"2025-03-28T00:00:00"}