{"id":"https://openalex.org/W4317436880","doi":"https://doi.org/10.14736/kyb-2022-5-0816","title":"Minimizing maximum lateness in two-stage projects by tropical optimization","display_name":"Minimizing maximum lateness in two-stage projects by tropical optimization","publication_year":2023,"publication_date":"2023-01-19","ids":{"openalex":"https://openalex.org/W4317436880","doi":"https://doi.org/10.14736/kyb-2022-5-0816"},"language":"en","primary_location":{"id":"doi:10.14736/kyb-2022-5-0816","is_oa":true,"landing_page_url":"https://doi.org/10.14736/kyb-2022-5-0816","pdf_url":"https://www.kybernetika.cz/content/2022/5/816/paper.pdf","source":{"id":"https://openalex.org/S158577884","display_name":"Kybernetika","issn_l":"0023-5954","issn":["0023-5954","1805-949X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310314340","host_organization_name":"Institute of Information Theory and Automation of the Czech Academy of Sciences","host_organization_lineage":["https://openalex.org/P4310314340","https://openalex.org/P4310314171"],"host_organization_lineage_names":["Institute of Information Theory and Automation of the Czech Academy of Sciences","Czech Academy of Sciences"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Kybernetika","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"bronze","oa_url":"https://www.kybernetika.cz/content/2022/5/816/paper.pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5001254372","display_name":"Nikolai Krivulin","orcid":"https://orcid.org/0000-0003-3070-9355"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Nikolai Krivulin","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5043349960","display_name":"Serge\u012d Sergeev","orcid":"https://orcid.org/0000-0003-4261-7431"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Serge\u012d Sergeev","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.7081,"has_fulltext":true,"cited_by_count":3,"citation_normalized_percentile":{"value":0.7152768,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":91,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"816","last_page":"841"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12177","display_name":"Resource-Constrained Project Scheduling","score":0.9902999997138977,"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"}},"topics":[{"id":"https://openalex.org/T12177","display_name":"Resource-Constrained Project Scheduling","score":0.9902999997138977,"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/T10142","display_name":"Formal Methods in Verification","score":0.9657999873161316,"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"}},{"id":"https://openalex.org/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.953000009059906,"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/mathematical-optimization","display_name":"Mathematical optimization","score":0.722491443157196},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.5806084275245667},{"id":"https://openalex.org/keywords/stage","display_name":"Stage (stratigraphy)","score":0.5763859748840332},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5048769116401672},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.44766780734062195},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.44720518589019775},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.37564295530319214},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.1541702151298523}],"concepts":[{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.722491443157196},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5806084275245667},{"id":"https://openalex.org/C146357865","wikidata":"https://www.wikidata.org/wiki/Q1123245","display_name":"Stage (stratigraphy)","level":2,"score":0.5763859748840332},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5048769116401672},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.44766780734062195},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.44720518589019775},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.37564295530319214},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.1541702151298523},{"id":"https://openalex.org/C151730666","wikidata":"https://www.wikidata.org/wiki/Q7205","display_name":"Paleontology","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},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.14736/kyb-2022-5-0816","is_oa":true,"landing_page_url":"https://doi.org/10.14736/kyb-2022-5-0816","pdf_url":"https://www.kybernetika.cz/content/2022/5/816/paper.pdf","source":{"id":"https://openalex.org/S158577884","display_name":"Kybernetika","issn_l":"0023-5954","issn":["0023-5954","1805-949X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310314340","host_organization_name":"Institute of Information Theory and Automation of the Czech Academy of Sciences","host_organization_lineage":["https://openalex.org/P4310314340","https://openalex.org/P4310314171"],"host_organization_lineage_names":["Institute of Information Theory and Automation of the Czech Academy of Sciences","Czech Academy of Sciences"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Kybernetika","raw_type":"journal-article"},{"id":"pmh:oai:pure.atira.dk:publications/0f5af6ce-9820-4d9c-b68c-0d7b43b4f048","is_oa":false,"landing_page_url":"https://www.kybernetika.cz/home.html","pdf_url":null,"source":{"id":"https://openalex.org/S4306402634","display_name":"University of Birmingham Research Portal (University of Birmingham)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I79619799","host_organization_name":"University of Birmingham","host_organization_lineage":["https://openalex.org/I79619799"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":""}],"best_oa_location":{"id":"doi:10.14736/kyb-2022-5-0816","is_oa":true,"landing_page_url":"https://doi.org/10.14736/kyb-2022-5-0816","pdf_url":"https://www.kybernetika.cz/content/2022/5/816/paper.pdf","source":{"id":"https://openalex.org/S158577884","display_name":"Kybernetika","issn_l":"0023-5954","issn":["0023-5954","1805-949X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310314340","host_organization_name":"Institute of Information Theory and Automation of the Czech Academy of Sciences","host_organization_lineage":["https://openalex.org/P4310314340","https://openalex.org/P4310314171"],"host_organization_lineage_names":["Institute of Information Theory and Automation of the Czech Academy of Sciences","Czech Academy of Sciences"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Kybernetika","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G4432510824","display_name":null,"funder_award_id":"20-010-00145","funder_id":"https://openalex.org/F4320321079","funder_display_name":"Russian Foundation for Basic Research"}],"funders":[{"id":"https://openalex.org/F4320321079","display_name":"Russian Foundation for Basic Research","ror":"https://ror.org/02mh1ke95"}],"has_content":{"grobid_xml":false,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4317436880.pdf"},"referenced_works_count":31,"referenced_works":["https://openalex.org/W210350577","https://openalex.org/W341186930","https://openalex.org/W586948577","https://openalex.org/W616288317","https://openalex.org/W1580020823","https://openalex.org/W1588115473","https://openalex.org/W1604659615","https://openalex.org/W2001758413","https://openalex.org/W2014211132","https://openalex.org/W2020145866","https://openalex.org/W2037105355","https://openalex.org/W2081434394","https://openalex.org/W2088418904","https://openalex.org/W2158250109","https://openalex.org/W2212625624","https://openalex.org/W2746933270","https://openalex.org/W2913644159","https://openalex.org/W2950621749","https://openalex.org/W2963597910","https://openalex.org/W3101346314","https://openalex.org/W3102397333","https://openalex.org/W3102627269","https://openalex.org/W3104149403","https://openalex.org/W3105851017","https://openalex.org/W4210369281","https://openalex.org/W4239769296","https://openalex.org/W4242713802","https://openalex.org/W4243432816","https://openalex.org/W4247925782","https://openalex.org/W4250661196","https://openalex.org/W4302557773"],"related_works":["https://openalex.org/W3204654320","https://openalex.org/W3217415483","https://openalex.org/W4285677055","https://openalex.org/W3104770499","https://openalex.org/W1992731528","https://openalex.org/W2007843488","https://openalex.org/W1994436307","https://openalex.org/W1987021796","https://openalex.org/W2795565301","https://openalex.org/W4387886124"],"abstract_inverted_index":{"We":[0],"are":[1],"considering":[2],"a":[3,76,96],"two-stage":[4],"optimal":[5,40],"scheduling":[6],"problem,":[7],"which":[8,67],"involves":[9],"two":[10],"similar":[11],"projects":[12],"with":[13,56],"the":[14,21,29,42,51,59,85],"same":[15,22],"starting":[16,30],"times":[17,31],"for":[18,24,32,36,41,50,101],"workers":[19,33],"and":[20,34,82,91,98],"deadlines":[23,35],"tasks.It":[25],"is":[26,54],"required":[27],"that":[28],"tasks":[37],"should":[38],"be":[39,70],"first-stage":[43],"project":[44],"and,":[45],"under":[46],"this":[47,73,102],"condition,":[48],"also":[49],"second-stage":[52],"project.Optimality":[53],"measured":[55],"respect":[57],"to":[58,69],"maximal":[60,63],"lateness":[61],"(or":[62],"delay)":[64],"of":[65,78,88],"tasks,":[66],"has":[68],"minimized.We":[71],"represent":[72],"problem":[74,77],"as":[75],"tropical":[79,89,92],"pseudoquadratic":[80],"optimization":[81,90],"show":[83],"how":[84],"existing":[86],"methods":[87],"linear":[93],"algebra":[94],"yield":[95],"full":[97],"explicit":[99],"solution":[100],"problem.":[103]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":2}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}