{"id":"https://openalex.org/W2995892254","doi":"https://doi.org/10.3390/a13010004","title":"Two-Machine Job-Shop Scheduling Problem to Minimize the Makespan with Uncertain Job Durations","display_name":"Two-Machine Job-Shop Scheduling Problem to Minimize the Makespan with Uncertain Job Durations","publication_year":2019,"publication_date":"2019-12-20","ids":{"openalex":"https://openalex.org/W2995892254","doi":"https://doi.org/10.3390/a13010004","mag":"2995892254"},"language":"en","primary_location":{"id":"doi:10.3390/a13010004","is_oa":true,"landing_page_url":"https://doi.org/10.3390/a13010004","pdf_url":"https://www.mdpi.com/1999-4893/13/1/4/pdf?version=1577329670","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,"raw_source_name":"Algorithms","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://www.mdpi.com/1999-4893/13/1/4/pdf?version=1577329670","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/I151823869","display_name":"National Academy of Sciences of Belarus","ror":"https://ror.org/02j8pe645","country_code":"BY","type":"government","lineage":["https://openalex.org/I151823869"]},{"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 of Belarus, Surganova Street 6, 220012 Minsk, Belarus"],"affiliations":[{"raw_affiliation_string":"United Institute of Informatics Problems, National Academy of Sciences of Belarus, Surganova Street 6, 220012 Minsk, Belarus","institution_ids":["https://openalex.org/I4210105192","https://openalex.org/I151823869"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5058437763","display_name":"Natalja M. Matsveichuk","orcid":null},"institutions":[{"id":"https://openalex.org/I4210094077","display_name":"Belarusian State Agrarian Technical University","ror":"https://ror.org/00n1ygd32","country_code":"BY","type":"education","lineage":["https://openalex.org/I4210094077"]}],"countries":["BY"],"is_corresponding":false,"raw_author_name":"Natalja M. Matsveichuk","raw_affiliation_strings":["Department of Automated Production Management Systems, Belarusian State Agrarian Technical University, Nezavisimosti Avenue 99, 220023 Minsk, Belarus"],"affiliations":[{"raw_affiliation_string":"Department of Automated Production Management Systems, Belarusian State Agrarian Technical University, Nezavisimosti Avenue 99, 220023 Minsk, Belarus","institution_ids":["https://openalex.org/I4210094077"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5085312892","display_name":"Vadzim D. Hatsura","orcid":null},"institutions":[{"id":"https://openalex.org/I7452641","display_name":"Belarusian State University of Informatics and Radioelectronics","ror":"https://ror.org/02sehzp52","country_code":"BY","type":"education","lineage":["https://openalex.org/I7452641"]}],"countries":["BY"],"is_corresponding":false,"raw_author_name":"Vadzim D. Hatsura","raw_affiliation_strings":["Department of Electronic Computing Machines, Belarusian State University of Informatics and Radioelectronics, P. Brovki Street 6, 220013 Minsk, Belarus"],"affiliations":[{"raw_affiliation_string":"Department of Electronic Computing Machines, Belarusian State University of Informatics and Radioelectronics, P. Brovki Street 6, 220013 Minsk, Belarus","institution_ids":["https://openalex.org/I7452641"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5062123009"],"corresponding_institution_ids":["https://openalex.org/I151823869","https://openalex.org/I4210105192"],"apc_list":{"value":1400,"currency":"CHF","value_usd":1515},"apc_paid":{"value":1400,"currency":"CHF","value_usd":1515},"fwci":0.8702,"has_fulltext":false,"cited_by_count":10,"citation_normalized_percentile":{"value":0.80694215,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"13","issue":"1","first_page":"4","last_page":"4"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10551","display_name":"Scheduling and Optimization Algorithms","score":1.0,"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":1.0,"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/T12782","display_name":"Assembly Line Balancing Optimization","score":0.9973999857902527,"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.9965000152587891,"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/job-shop-scheduling","display_name":"Job shop scheduling","score":0.8166649341583252},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.67026686668396},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.6526864767074585},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.5307111144065857},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5050836205482483},{"id":"https://openalex.org/keywords/job-shop","display_name":"Job shop","score":0.4402986466884613},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.415946364402771},{"id":"https://openalex.org/keywords/flow-shop-scheduling","display_name":"Flow shop scheduling","score":0.34491950273513794},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.24543896317481995},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.24048584699630737}],"concepts":[{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.8166649341583252},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.67026686668396},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.6526864767074585},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5307111144065857},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5050836205482483},{"id":"https://openalex.org/C2777243215","wikidata":"https://www.wikidata.org/wiki/Q1493226","display_name":"Job shop","level":5,"score":0.4402986466884613},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.415946364402771},{"id":"https://openalex.org/C158336966","wikidata":"https://www.wikidata.org/wiki/Q3074426","display_name":"Flow shop scheduling","level":4,"score":0.34491950273513794},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.24543896317481995},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.24048584699630737},{"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":[{"id":"doi:10.3390/a13010004","is_oa":true,"landing_page_url":"https://doi.org/10.3390/a13010004","pdf_url":"https://www.mdpi.com/1999-4893/13/1/4/pdf?version=1577329670","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,"raw_source_name":"Algorithms","raw_type":"journal-article"},{"id":"pmh:oai:mdpi.com:/1999-4893/13/1/4/","is_oa":true,"landing_page_url":"http://dx.doi.org/10.3390/a13010004","pdf_url":null,"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":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Algorithms","raw_type":"Text"}],"best_oa_location":{"id":"doi:10.3390/a13010004","is_oa":true,"landing_page_url":"https://doi.org/10.3390/a13010004","pdf_url":"https://www.mdpi.com/1999-4893/13/1/4/pdf?version=1577329670","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,"raw_source_name":"Algorithms","raw_type":"journal-article"},"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/8","display_name":"Decent work and economic growth","score":0.4099999964237213}],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2995892254.pdf","grobid_xml":"https://content.openalex.org/works/W2995892254.grobid-xml"},"referenced_works_count":40,"referenced_works":["https://openalex.org/W613241997","https://openalex.org/W1445900351","https://openalex.org/W1488422606","https://openalex.org/W1965108072","https://openalex.org/W1965367276","https://openalex.org/W1966592923","https://openalex.org/W1978253676","https://openalex.org/W1981918980","https://openalex.org/W1983488432","https://openalex.org/W1983527457","https://openalex.org/W1984335678","https://openalex.org/W1996767184","https://openalex.org/W2001080175","https://openalex.org/W2008958187","https://openalex.org/W2011987617","https://openalex.org/W2022113174","https://openalex.org/W2022805676","https://openalex.org/W2023148871","https://openalex.org/W2023619718","https://openalex.org/W2024085737","https://openalex.org/W2030577492","https://openalex.org/W2037856370","https://openalex.org/W2042025920","https://openalex.org/W2066167010","https://openalex.org/W2076482935","https://openalex.org/W2085822348","https://openalex.org/W2088876013","https://openalex.org/W2090388220","https://openalex.org/W2100147010","https://openalex.org/W2113853416","https://openalex.org/W2118855194","https://openalex.org/W2161227823","https://openalex.org/W2166640960","https://openalex.org/W2341350247","https://openalex.org/W2767554057","https://openalex.org/W2800062122","https://openalex.org/W2953199672","https://openalex.org/W4240119221","https://openalex.org/W4253347690","https://openalex.org/W7011521041"],"related_works":["https://openalex.org/W2025157869","https://openalex.org/W2068762498","https://openalex.org/W2731069579","https://openalex.org/W2031613569","https://openalex.org/W2120115745","https://openalex.org/W2895904586","https://openalex.org/W2095303169","https://openalex.org/W2143793865","https://openalex.org/W4253091371","https://openalex.org/W2365611964"],"abstract_inverted_index":{"We":[0,42,182],"study":[1],"two-machine":[2],"shop-scheduling":[3],"problems":[4],"provided":[5],"that":[6],"lower":[7,84],"and":[8,76,85],"upper":[9,86],"bounds":[10,87],"on":[11,82,109,163,259],"durations":[12,127],"of":[13,23,46,70,105,123,189,202,222,276,292,313],"n":[14,212],"jobs":[15,165,253],"are":[16,197],"given":[17,64],"before":[18],"scheduling.":[19],"An":[20,249],"exact":[21],"value":[22,61],"the":[24,31,38,44,54,63,83,94,124,129,143,178,200,220,223,272,277,293,300,314,318],"job":[25,55,90,126,278],"duration":[26,56,91,279],"remains":[27],"unknown":[28],"until":[29],"completing":[30,164],"job.":[32],"The":[33,115,148,261],"objective":[34],"is":[35,146,166,175],"to":[36,48,153,306],"minimize":[37],"makespan":[39],"(schedule":[40],"length).":[41],"address":[43],"issue":[45],"how":[47],"best":[49],"execute":[50],"a":[51,97,101,151,172,187,192],"schedule":[52,113,141,173,193],"if":[53],"may":[57,68],"take":[58],"any":[59],"real":[60],"from":[62,264,317],"segment.":[65],"Scheduling":[66],"decisions":[67],"consist":[69],"two":[71],"phases:":[72],"an":[73,77,156],"off-line":[74,95],"phase":[75],"on-line":[78,157],"phase.":[79],"Using":[80],"information":[81,162],"for":[88,112,132,177,185,191],"each":[89,133,239],"available":[92],"at":[93,138,247],"phase,":[96],"scheduler":[98,152,169],"can":[99,170],"determine":[100],"minimal":[102],"dominant":[103],"set":[104,188],"schedules":[106],"(DS)":[107],"based":[108],"sufficient":[110],"conditions":[111,190],"domination.":[114],"DS":[116,144,149],"optimally":[117,269,297,322],"covers":[118],"all":[119,235],"possible":[120,134,180],"realizations":[121],"(scenarios)":[122],"uncertain":[125],"in":[128,142,199,238,244,256],"sense":[130],"that,":[131],"scenario,":[135],"there":[136,227],"exists":[137],"least":[139],"one":[140,245],"which":[145,174],"optimal.":[147],"enables":[150],"quickly":[154],"make":[155],"scheduling":[158],"decision":[159],"whenever":[160],"additional":[161],"available.":[167],"A":[168],"choose":[171],"optimal":[176],"most":[179,262],"scenarios.":[181],"developed":[183,224],"algorithms":[184,196],"testing":[186],"dominance.":[194],"These":[195],"polynomial":[198],"number":[201],"jobs.":[203],"Their":[204],"time":[205],"complexity":[206],"does":[207],"not":[208,281],"exceed":[209],"O":[210],"(":[211],"2":[213],")":[214],".":[215],"Computational":[216],"experiments":[217],"have":[218],"shown":[219],"effectiveness":[221],"algorithms.":[225],"If":[226,271,299],"were":[228,242,268,296,321],"no":[229],"more":[230,288],"than":[231,283,289],"600":[232],"jobs,":[233],"then":[234,287,310],"1000":[236],"instances":[237,263,295,316],"tested":[240,266,294,315],"series":[241],"solved":[243,255],"second":[246],"most.":[248],"instance":[250],"with":[251],"10,000":[252],"was":[254,280,304],"0.4":[257],"s":[258],"average.":[260],"nine":[265,319],"classes":[267,320],"solved.":[270,298,323],"maximum":[273,301],"relative":[274,302],"error":[275,303],"greater":[282],"20":[284],"%":[285,291,308,312],",":[286,309],"80":[290],"equal":[305],"50":[307],"45":[311]},"counts_by_year":[{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":4},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}