{"id":"https://openalex.org/W4417277941","doi":"https://doi.org/10.3390/a18120788","title":"Optimization of Continuous Flow-Shop Scheduling Considering Due Dates","display_name":"Optimization of Continuous Flow-Shop Scheduling Considering Due Dates","publication_year":2025,"publication_date":"2025-12-12","ids":{"openalex":"https://openalex.org/W4417277941","doi":"https://doi.org/10.3390/a18120788"},"language":"en","primary_location":{"id":"doi:10.3390/a18120788","is_oa":true,"landing_page_url":"https://doi.org/10.3390/a18120788","pdf_url":"https://www.mdpi.com/1999-4893/18/12/788/pdf?version=1765548670","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/18/12/788/pdf?version=1765548670","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5034007743","display_name":"Feifeng Zheng","orcid":"https://orcid.org/0000-0002-1603-4163"},"institutions":[{"id":"https://openalex.org/I181326427","display_name":"Donghua University","ror":"https://ror.org/035psfh38","country_code":"CN","type":"education","lineage":["https://openalex.org/I181326427"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Feifeng Zheng","raw_affiliation_strings":["Glorious Sun School of Business and Management, Donghua University, Shanghai 200051, China"],"raw_orcid":"https://orcid.org/0000-0002-1603-4163","affiliations":[{"raw_affiliation_string":"Glorious Sun School of Business and Management, Donghua University, Shanghai 200051, China","institution_ids":["https://openalex.org/I181326427"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5027767038","display_name":"Chunyue ZHANG","orcid":"https://orcid.org/0009-0000-1515-8888"},"institutions":[{"id":"https://openalex.org/I181326427","display_name":"Donghua University","ror":"https://ror.org/035psfh38","country_code":"CN","type":"education","lineage":["https://openalex.org/I181326427"]}],"countries":["CN"],"is_corresponding":true,"raw_author_name":"Chunyao Zhang","raw_affiliation_strings":["Glorious Sun School of Business and Management, Donghua University, Shanghai 200051, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Glorious Sun School of Business and Management, Donghua University, Shanghai 200051, China","institution_ids":["https://openalex.org/I181326427"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5100347835","display_name":"Ming Liu","orcid":"https://orcid.org/0000-0003-3190-5008"},"institutions":[{"id":"https://openalex.org/I116953780","display_name":"Tongji University","ror":"https://ror.org/03rc6as71","country_code":"CN","type":"education","lineage":["https://openalex.org/I116953780"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Ming Liu","raw_affiliation_strings":["School of Economics & Management, Tongji University, Shanghai 200092, China"],"raw_orcid":"https://orcid.org/0000-0003-3190-5008","affiliations":[{"raw_affiliation_string":"School of Economics & Management, Tongji University, Shanghai 200092, China","institution_ids":["https://openalex.org/I116953780"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5027767038"],"corresponding_institution_ids":["https://openalex.org/I181326427"],"apc_list":{"value":1600,"currency":"CHF","value_usd":1782},"apc_paid":{"value":1600,"currency":"CHF","value_usd":1782},"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.3972274,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"18","issue":"12","first_page":"788","last_page":"788"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9864000082015991,"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.9864000082015991,"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/T12177","display_name":"Resource-Constrained Project Scheduling","score":0.002400000113993883,"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/T10974","display_name":"Advanced Queuing Theory Analysis","score":0.002199999988079071,"subfield":{"id":"https://openalex.org/subfields/1404","display_name":"Management Information Systems"},"field":{"id":"https://openalex.org/fields/14","display_name":"Business, Management and Accounting"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.4945000112056732},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.49390000104904175},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.46160000562667847},{"id":"https://openalex.org/keywords/maximum-flow-problem","display_name":"Maximum flow problem","score":0.43220001459121704},{"id":"https://openalex.org/keywords/focus","display_name":"Focus (optics)","score":0.42829999327659607},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.426800012588501},{"id":"https://openalex.org/keywords/sensitivity","display_name":"Sensitivity (control systems)","score":0.40400001406669617},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.39559999108314514},{"id":"https://openalex.org/keywords/nonlinear-system","display_name":"Nonlinear system","score":0.390500009059906}],"concepts":[{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6291999816894531},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6043000221252441},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.4945000112056732},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.49390000104904175},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.486299991607666},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.46160000562667847},{"id":"https://openalex.org/C157469704","wikidata":"https://www.wikidata.org/wiki/Q2585642","display_name":"Maximum flow problem","level":2,"score":0.43220001459121704},{"id":"https://openalex.org/C192209626","wikidata":"https://www.wikidata.org/wiki/Q190909","display_name":"Focus (optics)","level":2,"score":0.42829999327659607},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.426800012588501},{"id":"https://openalex.org/C21200559","wikidata":"https://www.wikidata.org/wiki/Q7451068","display_name":"Sensitivity (control systems)","level":2,"score":0.40400001406669617},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.39559999108314514},{"id":"https://openalex.org/C158622935","wikidata":"https://www.wikidata.org/wiki/Q660848","display_name":"Nonlinear system","level":2,"score":0.390500009059906},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.3709000051021576},{"id":"https://openalex.org/C2780271269","wikidata":"https://www.wikidata.org/wiki/Q19295956","display_name":"Single-machine scheduling","level":4,"score":0.36149999499320984},{"id":"https://openalex.org/C115527620","wikidata":"https://www.wikidata.org/wiki/Q769909","display_name":"Nonlinear programming","level":3,"score":0.35659998655319214},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3544999957084656},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.3416999876499176},{"id":"https://openalex.org/C158336966","wikidata":"https://www.wikidata.org/wiki/Q3074426","display_name":"Flow shop scheduling","level":4,"score":0.3384999930858612},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.3353999853134155},{"id":"https://openalex.org/C37404715","wikidata":"https://www.wikidata.org/wiki/Q380679","display_name":"Dynamic programming","level":2,"score":0.3325999975204468},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.32350000739097595},{"id":"https://openalex.org/C8880873","wikidata":"https://www.wikidata.org/wiki/Q187787","display_name":"Genetic algorithm","level":2,"score":0.30959999561309814},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.2962999939918518},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.2800999879837036},{"id":"https://openalex.org/C38349280","wikidata":"https://www.wikidata.org/wiki/Q1434290","display_name":"Flow (mathematics)","level":2,"score":0.26919999718666077},{"id":"https://openalex.org/C2987595161","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Optimization algorithm","level":2,"score":0.2651999890804291},{"id":"https://openalex.org/C197055811","wikidata":"https://www.wikidata.org/wiki/Q207522","display_name":"Probability density function","level":2,"score":0.25369998812675476}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.3390/a18120788","is_oa":true,"landing_page_url":"https://doi.org/10.3390/a18120788","pdf_url":"https://www.mdpi.com/1999-4893/18/12/788/pdf?version=1765548670","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:55d5403fba12428c98da6498155c0717","is_oa":true,"landing_page_url":"https://doaj.org/article/55d5403fba12428c98da6498155c0717","pdf_url":null,"source":{"id":"https://openalex.org/S4306401280","display_name":"DOAJ (DOAJ: Directory of Open Access Journals)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"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 18, Iss 12, p 788 (2025)","raw_type":"article"}],"best_oa_location":{"id":"doi:10.3390/a18120788","is_oa":true,"landing_page_url":"https://doi.org/10.3390/a18120788","pdf_url":"https://www.mdpi.com/1999-4893/18/12/788/pdf?version=1765548670","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":[],"awards":[{"id":"https://openalex.org/G2955367369","display_name":null,"funder_award_id":"72271051","funder_id":"https://openalex.org/F4320321001","funder_display_name":"National Natural Science Foundation of China"},{"id":"https://openalex.org/G6066917475","display_name":null,"funder_award_id":"2232018H-07","funder_id":"https://openalex.org/F4320321001","funder_display_name":"National Natural Science Foundation of China"},{"id":"https://openalex.org/G6452016375","display_name":null,"funder_award_id":"2232018H-07","funder_id":"https://openalex.org/F4320335787","funder_display_name":"Fundamental Research Funds for the Central Universities"},{"id":"https://openalex.org/G8989600079","display_name":null,"funder_award_id":"72271051","funder_id":"https://openalex.org/F4320335787","funder_display_name":"Fundamental Research Funds for the Central Universities"}],"funders":[{"id":"https://openalex.org/F4320321001","display_name":"National Natural Science Foundation of China","ror":"https://ror.org/01h0zpd94"},{"id":"https://openalex.org/F4320335787","display_name":"Fundamental Research Funds for the Central Universities","ror":null}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4417277941.pdf","grobid_xml":"https://content.openalex.org/works/W4417277941.grobid-xml"},"referenced_works_count":34,"referenced_works":["https://openalex.org/W2916997747","https://openalex.org/W3005899610","https://openalex.org/W3040075204","https://openalex.org/W3107910423","https://openalex.org/W3118990082","https://openalex.org/W3166618313","https://openalex.org/W3185029567","https://openalex.org/W3193438168","https://openalex.org/W3196493998","https://openalex.org/W3216729967","https://openalex.org/W4212807509","https://openalex.org/W4220976805","https://openalex.org/W4280618336","https://openalex.org/W4284881381","https://openalex.org/W4286377470","https://openalex.org/W4293879991","https://openalex.org/W4296226047","https://openalex.org/W4318455099","https://openalex.org/W4319264684","https://openalex.org/W4364374908","https://openalex.org/W4377089140","https://openalex.org/W4387375685","https://openalex.org/W4390990665","https://openalex.org/W4392827383","https://openalex.org/W4393990661","https://openalex.org/W4399082303","https://openalex.org/W4400450885","https://openalex.org/W4402527173","https://openalex.org/W4404317190","https://openalex.org/W4407511234","https://openalex.org/W4408978752","https://openalex.org/W4409656901","https://openalex.org/W4411162862","https://openalex.org/W4412505047"],"related_works":[],"abstract_inverted_index":{"For":[0],"a":[1,53,84,96,208,216,235,242],"no-wait":[2],"flow":[3],"shop":[4],"with":[5,87,146,241],"continuous-flow":[6,258],"characteristics,":[7],"this":[8],"study":[9],"simultaneously":[10],"considers":[11],"machine":[12,89,102],"setup":[13],"times":[14],"and":[15,30,45,63,91,95,150,181,194],"rated":[16],"processing":[17],"speed":[18],"constraints,":[19],"aiming":[20],"to":[21,73,156,225],"minimize":[22],"the":[23,26,31,38,42,46,61,74,78,125,128,133,137,147,152,161,177,185,198,204,226,231,246,250],"sum":[24],"of":[25,77,127,136,167,210,218,237,248],"maximum":[27,32,39,43,162],"completion":[28,40,163],"time":[29,70],"tardiness.":[33],"First,":[34],"lower":[35,179,227],"bounds":[36,180],"for":[37,60,105,119,257],"time,":[41],"tardiness,":[44],"total":[47],"objective":[48,138],"function":[49,139],"are":[50,66,82],"developed.":[51],"Second,":[52],"mixed-integer":[54],"programming":[55],"(MIP)":[56],"model":[57],"is":[58,115,170,182,222],"formulated":[59],"problem,":[62,79],"nonlinear":[64],"elements":[65],"subsequently":[67],"linearized":[68],"via":[69],"discretization.":[71],"Due":[72,111],"computational":[75],"complexity":[76],"two":[80,129,134],"algorithms":[81,169],"proposed:":[83],"heuristic":[85],"algorithm":[86,98,154,206],"fixed":[88],"links":[90],"greedy":[92],"rules":[93],"(HAFG)":[94],"genetic":[97],"based":[99],"on":[100,159,245],"altering":[101],"combinations":[103],"(GAAM)":[104],"solving":[106],"large-scale":[107,202],"instances.":[108],"The":[109,141,165],"Earliest":[110],"Date":[112],"(EDD)":[113],"rule":[114,149,233],"used":[116],"as":[117],"baselines":[118],"algorithmic":[120],"comparison.":[121],"To":[122],"better":[123],"understand":[124],"behaviors":[126],"algorithms,":[130],"we":[131],"observe":[132],"components":[135],"separately.":[140],"results":[142],"show":[143],"that,":[144],"compared":[145,183],"EDD":[148,186,199,232],"GAAM,":[151],"HAFG":[153,193,205],"tends":[155],"focus":[157],"more":[158],"optimizing":[160],"time.":[164],"performance":[166],"both":[168,192],"evaluated":[171],"using":[172],"their":[173],"relative":[174],"deviations":[175],"from":[176],"developed":[178],"against":[184],"rule.":[187,200],"Numerical":[188],"experiments":[189],"demonstrate":[190],"that":[191],"GAAM":[195,214],"significantly":[196],"outperform":[197],"In":[201,229],"instances,":[203],"achieves":[207],"gap":[209,217],"about":[211,219,238],"4%,":[212],"while":[213],"reaches":[215],"3%,":[220],"which":[221],"very":[223],"close":[224],"bound.":[228],"contrast,":[230],"shows":[234],"deviation":[236],"10%.":[239],"Combined":[240],"sensitivity":[243],"analysis":[244],"number":[247],"machines,":[249],"proposed":[251],"framework":[252],"provides":[253],"meaningful":[254],"managerial":[255],"insights":[256],"production":[259],"environments.":[260]},"counts_by_year":[],"updated_date":"2026-07-23T08:03:31.855105","created_date":"2025-12-12T00:00:00"}