{"id":"https://openalex.org/W3096830763","doi":"https://doi.org/10.3390/a13110277","title":"Scheduling Algorithms for a Hybrid Flow Shop under Uncertainty","display_name":"Scheduling Algorithms for a Hybrid Flow Shop under Uncertainty","publication_year":2020,"publication_date":"2020-10-31","ids":{"openalex":"https://openalex.org/W3096830763","doi":"https://doi.org/10.3390/a13110277","mag":"3096830763"},"language":"en","primary_location":{"id":"doi:10.3390/a13110277","is_oa":true,"landing_page_url":"https://doi.org/10.3390/a13110277","pdf_url":"https://www.mdpi.com/1999-4893/13/11/277/pdf?version=1604465286","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/11/277/pdf?version=1604465286","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5026985844","display_name":"Christin Schumacher","orcid":"https://orcid.org/0000-0002-9847-0443"},"institutions":[{"id":"https://openalex.org/I200332995","display_name":"TU Dortmund University","ror":"https://ror.org/01k97gp34","country_code":"DE","type":"education","lineage":["https://openalex.org/I200332995"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Christin Schumacher","raw_affiliation_strings":["Informatik 4\u2014Modeling and Simulation, Department of Computer Science, TU Dortmund University, D-44221 Dortmund, Germany"],"affiliations":[{"raw_affiliation_string":"Informatik 4\u2014Modeling and Simulation, Department of Computer Science, TU Dortmund University, D-44221 Dortmund, Germany","institution_ids":["https://openalex.org/I200332995"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5022119933","display_name":"Peter Buchholz","orcid":"https://orcid.org/0000-0002-9966-7686"},"institutions":[{"id":"https://openalex.org/I200332995","display_name":"TU Dortmund University","ror":"https://ror.org/01k97gp34","country_code":"DE","type":"education","lineage":["https://openalex.org/I200332995"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Peter Buchholz","raw_affiliation_strings":["Informatik 4\u2014Modeling and Simulation, Department of Computer Science, TU Dortmund University, D-44221 Dortmund, Germany"],"affiliations":[{"raw_affiliation_string":"Informatik 4\u2014Modeling and Simulation, Department of Computer Science, TU Dortmund University, D-44221 Dortmund, Germany","institution_ids":["https://openalex.org/I200332995"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5026985844"],"corresponding_institution_ids":["https://openalex.org/I200332995"],"apc_list":{"value":1400,"currency":"CHF","value_usd":1515},"apc_paid":{"value":1400,"currency":"CHF","value_usd":1515},"fwci":0.5349,"has_fulltext":false,"cited_by_count":7,"citation_normalized_percentile":{"value":0.74294368,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":91,"max":97},"biblio":{"volume":"13","issue":"11","first_page":"277","last_page":"277"},"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/T11814","display_name":"Advanced Manufacturing and Logistics Optimization","score":0.9986000061035156,"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.9968000054359436,"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/tabu-search","display_name":"Tabu search","score":0.7521182298660278},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7199292778968811},{"id":"https://openalex.org/keywords/flow-shop-scheduling","display_name":"Flow shop scheduling","score":0.7154649496078491},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.7052783966064453},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.574504554271698},{"id":"https://openalex.org/keywords/heuristics","display_name":"Heuristics","score":0.5660436153411865},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.5311412215232849},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5061394572257996},{"id":"https://openalex.org/keywords/metaheuristic","display_name":"Metaheuristic","score":0.47072091698646545},{"id":"https://openalex.org/keywords/cluster-analysis","display_name":"Cluster analysis","score":0.4146025478839874},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.3846994936466217},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.16084903478622437},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.15590903162956238}],"concepts":[{"id":"https://openalex.org/C123370116","wikidata":"https://www.wikidata.org/wiki/Q1424540","display_name":"Tabu search","level":2,"score":0.7521182298660278},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7199292778968811},{"id":"https://openalex.org/C158336966","wikidata":"https://www.wikidata.org/wiki/Q3074426","display_name":"Flow shop scheduling","level":4,"score":0.7154649496078491},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.7052783966064453},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.574504554271698},{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.5660436153411865},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5311412215232849},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5061394572257996},{"id":"https://openalex.org/C109718341","wikidata":"https://www.wikidata.org/wiki/Q1385229","display_name":"Metaheuristic","level":2,"score":0.47072091698646545},{"id":"https://openalex.org/C73555534","wikidata":"https://www.wikidata.org/wiki/Q622825","display_name":"Cluster analysis","level":2,"score":0.4146025478839874},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.3846994936466217},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.16084903478622437},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.15590903162956238},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.3390/a13110277","is_oa":true,"landing_page_url":"https://doi.org/10.3390/a13110277","pdf_url":"https://www.mdpi.com/1999-4893/13/11/277/pdf?version=1604465286","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:doaj.org/article:055475380a7b4d139f79fddbb52ea38e","is_oa":true,"landing_page_url":"https://doaj.org/article/055475380a7b4d139f79fddbb52ea38e","pdf_url":null,"source":{"id":"https://openalex.org/S112646816","display_name":"SHILAP Revista de lepidopterolog\u00eda","issn_l":"0300-5267","issn":["0300-5267","2340-4078"],"is_oa":true,"is_in_doaj":true,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":"cc-by-sa","license_id":"https://openalex.org/licenses/cc-by-sa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Algorithms, Vol 13, Iss 11, p 277 (2020)","raw_type":"article"},{"id":"pmh:oai:mdpi.com:/1999-4893/13/11/277/","is_oa":true,"landing_page_url":"https://dx.doi.org/10.3390/a13110277","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; Volume 13; Issue 11; Pages: 277","raw_type":"Text"}],"best_oa_location":{"id":"doi:10.3390/a13110277","is_oa":true,"landing_page_url":"https://doi.org/10.3390/a13110277","pdf_url":"https://www.mdpi.com/1999-4893/13/11/277/pdf?version=1604465286","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":[{"display_name":"Industry, innovation and infrastructure","score":0.4699999988079071,"id":"https://metadata.un.org/sdg/9"}],"awards":[{"id":"https://openalex.org/G8029132351","display_name":null,"funder_award_id":"276879186/GRK2193","funder_id":"https://openalex.org/F4320320879","funder_display_name":"Deutsche Forschungsgemeinschaft"}],"funders":[{"id":"https://openalex.org/F4320320879","display_name":"Deutsche Forschungsgemeinschaft","ror":"https://ror.org/018mejw64"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W3096830763.pdf","grobid_xml":"https://content.openalex.org/works/W3096830763.grobid-xml"},"referenced_works_count":35,"referenced_works":["https://openalex.org/W1488422606","https://openalex.org/W1501627346","https://openalex.org/W1536296945","https://openalex.org/W1639875619","https://openalex.org/W1982360953","https://openalex.org/W1988634397","https://openalex.org/W1991194394","https://openalex.org/W2004676714","https://openalex.org/W2017220225","https://openalex.org/W2022369810","https://openalex.org/W2024085737","https://openalex.org/W2028473885","https://openalex.org/W2038651024","https://openalex.org/W2075965427","https://openalex.org/W2079624556","https://openalex.org/W2088101175","https://openalex.org/W2090069860","https://openalex.org/W2090509252","https://openalex.org/W2091937574","https://openalex.org/W2093118612","https://openalex.org/W2094198870","https://openalex.org/W2099899151","https://openalex.org/W2135123147","https://openalex.org/W2138913627","https://openalex.org/W2177895527","https://openalex.org/W2338758504","https://openalex.org/W2767177219","https://openalex.org/W2797226741","https://openalex.org/W2905418984","https://openalex.org/W3007856680","https://openalex.org/W3139733814","https://openalex.org/W4300601563","https://openalex.org/W6654747624","https://openalex.org/W6673467235","https://openalex.org/W6680153912"],"related_works":["https://openalex.org/W2052469048","https://openalex.org/W4321504838","https://openalex.org/W2081475278","https://openalex.org/W2794855054","https://openalex.org/W2005169299","https://openalex.org/W150166259","https://openalex.org/W2606087467","https://openalex.org/W1540477665","https://openalex.org/W2314520391","https://openalex.org/W2937685542"],"abstract_inverted_index":{"In":[0],"modern":[1],"production":[2,18,36,94,102,127,174],"systems,":[3],"scheduling":[4],"problems":[5],"have":[6],"to":[7,30,70,87,124,129],"be":[8],"solved":[9],"in":[10,65],"consideration":[11],"of":[12,80,110,118],"frequently":[13],"changing":[14],"demands":[15],"and":[16,27,35,41,63,101,115,144,150,159],"varying":[17],"parameters.":[19],"This":[20],"paper":[21],"presents":[22],"a":[23,52,162,172,183,191],"approach":[24,168],"combining":[25],"forecasting":[26],"classification":[28],"techniques":[29],"predict":[31],"uncertainty":[32,64],"from":[33,134],"demands,":[34],"data":[37,79],"with":[38,56,190],"heuristics,":[39],"metaheuristics,":[40],"discrete":[42],"event":[43],"simulation":[44,164],"for":[45,182],"obtaining":[46],"machine":[47,59],"schedules.":[48],"The":[49,67,166,176],"problem":[50],"is":[51,69,113,169],"hybrid":[53],"flow":[54],"shop":[55],"two":[57],"stages,":[58,62],"qualifications,":[60],"skipping":[61],"demands.":[66,136],"objective":[68],"minimize":[71],"the":[72,77,93,108,116,119,153,180,197],"makespan.":[73,198],"First,":[74],"based":[75],"on":[76,171],"available":[78],"past":[81],"orders,":[82],"jobs":[83],"that":[84,179,187],"are":[85,96,104,122,148,157],"prone":[86],"fluctuations":[88],"just":[89],"before":[90],"or":[91],"during":[92],"phase":[95],"identified":[97],"by":[98],"clustering":[99],"algorithms,":[100],"volumes":[103,128],"adjusted":[105],"accordingly.":[106],"Furthermore,":[107],"distribution":[109,121],"scrap":[111],"rates":[112],"estimated,":[114],"quantiles":[117],"resulting":[120,133],"used":[123],"increase":[125,196],"corresponding":[126],"prevent":[130],"costly":[131],"rescheduling":[132],"unfulfilled":[135],"Second,":[137],"Shortest":[138],"Processing":[139],"Time":[140],"(SPT),":[141],"tabu":[142],"search,":[143],"local":[145],"search":[146],"algorithms":[147],"developed":[149],"applied.":[151],"Third,":[152],"best":[154],"performing":[155],"schedules":[156],"evaluated":[158],"selected":[160],"using":[161],"detailed":[163],"model.":[165],"proposed":[167],"validated":[170],"real-world":[173],"case.":[175],"results":[177],"show":[178],"price":[181],"very":[184],"robust":[185],"schedule":[186],"avoids":[188],"underproduction":[189],"high":[192],"probability":[193],"can":[194],"significantly":[195]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":3},{"year":2022,"cited_by_count":3}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}
