{"id":"https://openalex.org/W4378468969","doi":"https://doi.org/10.1080/00207543.2023.2217279","title":"A branch-and-bound approach to minimise the value-at-risk of the makespan in a stochastic two-machine flow shop","display_name":"A branch-and-bound approach to minimise the value-at-risk of the makespan in a stochastic two-machine flow shop","publication_year":2023,"publication_date":"2023-05-26","ids":{"openalex":"https://openalex.org/W4378468969","doi":"https://doi.org/10.1080/00207543.2023.2217279"},"language":"en","primary_location":{"id":"doi:10.1080/00207543.2023.2217279","is_oa":false,"landing_page_url":"https://doi.org/10.1080/00207543.2023.2217279","pdf_url":null,"source":{"id":"https://openalex.org/S65690446","display_name":"International Journal of Production Research","issn_l":"0020-7543","issn":["0020-7543","1366-588X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320547","host_organization_name":"Taylor & Francis","host_organization_lineage":["https://openalex.org/P4310320547"],"host_organization_lineage_names":["Taylor & Francis"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Production Research","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://hdl.handle.net/11311/1240297","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5036009936","display_name":"Lei Liu","orcid":"https://orcid.org/0000-0002-7132-3961"},"institutions":[{"id":"https://openalex.org/I93860229","display_name":"Politecnico di Milano","ror":"https://ror.org/01nffqt88","country_code":"IT","type":"education","lineage":["https://openalex.org/I93860229"]}],"countries":["IT"],"is_corresponding":true,"raw_author_name":"Lei Liu","raw_affiliation_strings":["Department of Mechanical Engineering, Politecnico di Milano, Milano, Italy"],"affiliations":[{"raw_affiliation_string":"Department of Mechanical Engineering, Politecnico di Milano, Milano, Italy","institution_ids":["https://openalex.org/I93860229"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5045196837","display_name":"Marcello Urgo","orcid":"https://orcid.org/0000-0002-0341-9208"},"institutions":[{"id":"https://openalex.org/I93860229","display_name":"Politecnico di Milano","ror":"https://ror.org/01nffqt88","country_code":"IT","type":"education","lineage":["https://openalex.org/I93860229"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Marcello Urgo","raw_affiliation_strings":["Department of Mechanical Engineering, Politecnico di Milano, Milano, Italy"],"affiliations":[{"raw_affiliation_string":"Department of Mechanical Engineering, Politecnico di Milano, Milano, Italy","institution_ids":["https://openalex.org/I93860229"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5036009936"],"corresponding_institution_ids":["https://openalex.org/I93860229"],"apc_list":null,"apc_paid":null,"fwci":2.6654,"has_fulltext":false,"cited_by_count":13,"citation_normalized_percentile":{"value":0.90261966,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":94,"max":99},"biblio":{"volume":"62","issue":"6","first_page":"2107","last_page":"2123"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9998999834060669,"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.9998999834060669,"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.9991999864578247,"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.9988999962806702,"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.8423386812210083},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6736287474632263},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.6490865349769592},{"id":"https://openalex.org/keywords/flow-shop-scheduling","display_name":"Flow shop scheduling","score":0.6356359720230103},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6056585311889648},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.47473201155662537},{"id":"https://openalex.org/keywords/exploit","display_name":"Exploit","score":0.4561362564563751},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2026394009590149},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.13499382138252258}],"concepts":[{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.8423386812210083},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6736287474632263},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.6490865349769592},{"id":"https://openalex.org/C158336966","wikidata":"https://www.wikidata.org/wiki/Q3074426","display_name":"Flow shop scheduling","level":4,"score":0.6356359720230103},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6056585311889648},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.47473201155662537},{"id":"https://openalex.org/C165696696","wikidata":"https://www.wikidata.org/wiki/Q11287","display_name":"Exploit","level":2,"score":0.4561362564563751},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2026394009590149},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.13499382138252258},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1080/00207543.2023.2217279","is_oa":false,"landing_page_url":"https://doi.org/10.1080/00207543.2023.2217279","pdf_url":null,"source":{"id":"https://openalex.org/S65690446","display_name":"International Journal of Production Research","issn_l":"0020-7543","issn":["0020-7543","1366-588X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320547","host_organization_name":"Taylor & Francis","host_organization_lineage":["https://openalex.org/P4310320547"],"host_organization_lineage_names":["Taylor & Francis"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Production Research","raw_type":"journal-article"},{"id":"pmh:oai:RePEc:taf:tprsxx:v:62:y:2024:i:6:p:2107-2123","is_oa":false,"landing_page_url":"http://hdl.handle.net/10.1080/00207543.2023.2217279","pdf_url":null,"source":{"id":"https://openalex.org/S4306401271","display_name":"RePEc: Research Papers in Economics","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I77793887","host_organization_name":"Federal Reserve Bank of St. Louis","host_organization_lineage":["https://openalex.org/I77793887"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"article"},{"id":"pmh:oai:re.public.polimi.it:11311/1240297","is_oa":true,"landing_page_url":"https://hdl.handle.net/11311/1240297","pdf_url":null,"source":{"id":"https://openalex.org/S4306400312","display_name":"Virtual Community of Pathological Anatomy (University of Castilla La Mancha)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I79189158","host_organization_name":"University of Castilla-La Mancha","host_organization_lineage":["https://openalex.org/I79189158"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":{"id":"pmh:oai:re.public.polimi.it:11311/1240297","is_oa":true,"landing_page_url":"https://hdl.handle.net/11311/1240297","pdf_url":null,"source":{"id":"https://openalex.org/S4306400312","display_name":"Virtual Community of Pathological Anatomy (University of Castilla La Mancha)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I79189158","host_organization_name":"University of Castilla-La Mancha","host_organization_lineage":["https://openalex.org/I79189158"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"info:eu-repo/semantics/article"},"sustainable_development_goals":[{"display_name":"Peace, Justice and strong institutions","score":0.4399999976158142,"id":"https://metadata.un.org/sdg/16"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":63,"referenced_works":["https://openalex.org/W564845055","https://openalex.org/W1944441789","https://openalex.org/W1977125704","https://openalex.org/W1994311762","https://openalex.org/W1999602996","https://openalex.org/W2002203564","https://openalex.org/W2006751452","https://openalex.org/W2007618467","https://openalex.org/W2011818350","https://openalex.org/W2013139860","https://openalex.org/W2015973701","https://openalex.org/W2016033395","https://openalex.org/W2018274124","https://openalex.org/W2026701266","https://openalex.org/W2028212620","https://openalex.org/W2030577492","https://openalex.org/W2037467932","https://openalex.org/W2040729500","https://openalex.org/W2055423534","https://openalex.org/W2065058618","https://openalex.org/W2082060556","https://openalex.org/W2082886370","https://openalex.org/W2086487628","https://openalex.org/W2093255138","https://openalex.org/W2100636584","https://openalex.org/W2118578357","https://openalex.org/W2125261720","https://openalex.org/W2130727150","https://openalex.org/W2137429851","https://openalex.org/W2154429979","https://openalex.org/W2154602821","https://openalex.org/W2158750015","https://openalex.org/W2160120336","https://openalex.org/W2168348515","https://openalex.org/W2168903052","https://openalex.org/W2171676698","https://openalex.org/W2429059420","https://openalex.org/W2486891914","https://openalex.org/W2610968684","https://openalex.org/W2732299378","https://openalex.org/W2771331339","https://openalex.org/W2811142689","https://openalex.org/W2883821791","https://openalex.org/W2908184501","https://openalex.org/W2944980307","https://openalex.org/W2946973100","https://openalex.org/W2963976466","https://openalex.org/W3001967193","https://openalex.org/W3006081034","https://openalex.org/W3083492408","https://openalex.org/W3124505284","https://openalex.org/W3166811342","https://openalex.org/W3173132877","https://openalex.org/W3200952508","https://openalex.org/W3205161453","https://openalex.org/W4221039127","https://openalex.org/W4235874873","https://openalex.org/W4246506621","https://openalex.org/W4254349202","https://openalex.org/W4255355362","https://openalex.org/W4255730472","https://openalex.org/W4300694379","https://openalex.org/W4310018789"],"related_works":["https://openalex.org/W2967782293","https://openalex.org/W2185192838","https://openalex.org/W2069961172","https://openalex.org/W2955323683","https://openalex.org/W1564838499","https://openalex.org/W2559484340","https://openalex.org/W26892725","https://openalex.org/W2165758382","https://openalex.org/W1971939018","https://openalex.org/W3155166764"],"abstract_inverted_index":{"Planning":[0],"and":[1,16,98,122,129,154],"scheduling":[2,24,71],"approaches":[3],"in":[4,53,91],"real":[5,23,54],"manufacturing":[6],"environments":[7],"entail":[8],"the":[9,20,32,43,66,80,83,86,92,95,99,102,117,120,124,145,157],"need":[10],"to":[11,18,42,64,88,115,136,147],"cope":[12],"with":[13,73],"random":[14],"attributes":[15],"variables":[17],"match":[19],"characteristics":[21],"of":[22,34,46,82,85,101,104,119,156,165],"problems":[25],"where":[26],"uncertain":[27],"events":[28],"are":[29,39,134,160],"frequent.":[30],"Moreover,":[31],"capability":[33,146],"devising":[35],"robust":[36],"schedules,":[37],"which":[38],"less":[40],"sensitive":[41],"disruptive":[44],"effects":[45],"unexpected":[47],"events,":[48],"is":[49,62,79,113],"a":[50,59,149,163],"major":[51],"request":[52],"applications.":[55],"In":[56],"this":[57],"paper,":[58],"branch-and-bound":[60],"approach":[61,159],"proposed":[63,158],"solve":[65],"two-machine":[67],"permutation":[68],"flow":[69],"shop":[70],"problem":[72],"stochastic":[74],"processing":[75,141],"times.":[76],"The":[77,152],"objective":[78],"minimisation":[81],"value-at-risk":[84,125],"makespan,":[87],"support":[89],"decision-makers":[90],"trade-off":[93],"between":[94],"expected":[96],"performance":[97,155],"mitigation":[100],"impact":[103],"extreme":[105],"scenarios.":[106],"A":[107],"Markovian":[108,150],"Activity":[109],"Network":[110],"(MAN)":[111],"model":[112],"adopted":[114],"estimate":[116],"distribution":[118],"makespan":[121],"assess":[123],"for":[126,140],"both":[127],"partial":[128],"complete":[130],"schedules.":[131],"Phase-type":[132],"distributions":[133,139],"used":[135],"enable":[137],"general":[138],"times":[142],"while":[143],"maintaining":[144],"exploit":[148],"approach.":[151],"effectiveness":[153],"demonstrated":[161],"through":[162],"set":[164],"computational":[166],"experiments.":[167]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":7},{"year":2024,"cited_by_count":3},{"year":2023,"cited_by_count":2}],"updated_date":"2026-03-20T23:20:44.827607","created_date":"2023-05-27T00:00:00"}