{"id":"https://openalex.org/W2974650822","doi":"https://doi.org/10.1109/coase.2019.8842936","title":"Minimizing total flow time in two-stage hybrid flowshop with parallel machines and a single batching machine","display_name":"Minimizing total flow time in two-stage hybrid flowshop with parallel machines and a single batching machine","publication_year":2019,"publication_date":"2019-08-01","ids":{"openalex":"https://openalex.org/W2974650822","doi":"https://doi.org/10.1109/coase.2019.8842936","mag":"2974650822"},"language":"en","primary_location":{"id":"doi:10.1109/coase.2019.8842936","is_oa":false,"landing_page_url":"https://doi.org/10.1109/coase.2019.8842936","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2019 IEEE 15th International Conference on Automation Science and Engineering (CASE)","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5001636273","display_name":"Hua Gong","orcid":"https://orcid.org/0000-0003-2260-4617"},"institutions":[{"id":"https://openalex.org/I116036724","display_name":"Shenyang Ligong University","ror":"https://ror.org/03m20nr07","country_code":"CN","type":"education","lineage":["https://openalex.org/I116036724"]}],"countries":["CN"],"is_corresponding":true,"raw_author_name":"Hua Gong","raw_affiliation_strings":["College of Science, Shenyang Ligong University, Shenyang, China"],"affiliations":[{"raw_affiliation_string":"College of Science, Shenyang Ligong University, Shenyang, China","institution_ids":["https://openalex.org/I116036724"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5036636366","display_name":"Xiaojuan Shu","orcid":null},"institutions":[{"id":"https://openalex.org/I116036724","display_name":"Shenyang Ligong University","ror":"https://ror.org/03m20nr07","country_code":"CN","type":"education","lineage":["https://openalex.org/I116036724"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Xiaojuan Shu","raw_affiliation_strings":["College of Science, Shenyang Ligong University, Shenyang, China"],"affiliations":[{"raw_affiliation_string":"College of Science, Shenyang Ligong University, Shenyang, China","institution_ids":["https://openalex.org/I116036724"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5100453010","display_name":"Fang Liu","orcid":"https://orcid.org/0000-0001-6157-7151"},"institutions":[{"id":"https://openalex.org/I116036724","display_name":"Shenyang Ligong University","ror":"https://ror.org/03m20nr07","country_code":"CN","type":"education","lineage":["https://openalex.org/I116036724"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Fang Liu","raw_affiliation_strings":["College of Science, Shenyang Ligong University, Shenyang, China"],"affiliations":[{"raw_affiliation_string":"College of Science, Shenyang Ligong University, Shenyang, China","institution_ids":["https://openalex.org/I116036724"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5101940716","display_name":"Ke Xu","orcid":"https://orcid.org/0000-0003-1809-7413"},"institutions":[{"id":"https://openalex.org/I116036724","display_name":"Shenyang Ligong University","ror":"https://ror.org/03m20nr07","country_code":"CN","type":"education","lineage":["https://openalex.org/I116036724"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Ke Xu","raw_affiliation_strings":["College of Science, Shenyang Ligong University, Shenyang, China"],"affiliations":[{"raw_affiliation_string":"College of Science, Shenyang Ligong University, Shenyang, China","institution_ids":["https://openalex.org/I116036724"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5001636273"],"corresponding_institution_ids":["https://openalex.org/I116036724"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.14284298,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"344","last_page":"349"},"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.9983999729156494,"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/T12288","display_name":"Optimization and Search Problems","score":0.9927999973297119,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7600201368331909},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5961445569992065},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.5853734016418457},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.5531121492385864},{"id":"https://openalex.org/keywords/flow-shop-scheduling","display_name":"Flow shop scheduling","score":0.5451059937477112},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.5097383856773376},{"id":"https://openalex.org/keywords/job-scheduler","display_name":"Job scheduler","score":0.5080149173736572},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.4533081650733948},{"id":"https://openalex.org/keywords/maximum-flow-problem","display_name":"Maximum flow problem","score":0.4522829055786133},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.4457806944847107},{"id":"https://openalex.org/keywords/batch-processing","display_name":"Batch processing","score":0.42133718729019165},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.421195387840271},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.3586401641368866},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3519894480705261},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.16266119480133057},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.11611825227737427}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7600201368331909},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5961445569992065},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.5853734016418457},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5531121492385864},{"id":"https://openalex.org/C158336966","wikidata":"https://www.wikidata.org/wiki/Q3074426","display_name":"Flow shop scheduling","level":4,"score":0.5451059937477112},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.5097383856773376},{"id":"https://openalex.org/C111873713","wikidata":"https://www.wikidata.org/wiki/Q1641413","display_name":"Job scheduler","level":3,"score":0.5080149173736572},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.4533081650733948},{"id":"https://openalex.org/C157469704","wikidata":"https://www.wikidata.org/wiki/Q2585642","display_name":"Maximum flow problem","level":2,"score":0.4522829055786133},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.4457806944847107},{"id":"https://openalex.org/C172658912","wikidata":"https://www.wikidata.org/wiki/Q661613","display_name":"Batch processing","level":2,"score":0.42133718729019165},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.421195387840271},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.3586401641368866},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3519894480705261},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.16266119480133057},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.11611825227737427},{"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/C160403385","wikidata":"https://www.wikidata.org/wiki/Q220543","display_name":"Queue","level":2,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","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}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/coase.2019.8842936","is_oa":false,"landing_page_url":"https://doi.org/10.1109/coase.2019.8842936","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2019 IEEE 15th International Conference on Automation Science and Engineering (CASE)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/8","display_name":"Decent work and economic growth","score":0.4000000059604645}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":22,"referenced_works":["https://openalex.org/W152978804","https://openalex.org/W1505402242","https://openalex.org/W1971258248","https://openalex.org/W1990215630","https://openalex.org/W1996628037","https://openalex.org/W1999035181","https://openalex.org/W2011039300","https://openalex.org/W2034451750","https://openalex.org/W2044439396","https://openalex.org/W2060749288","https://openalex.org/W2063264317","https://openalex.org/W2064116482","https://openalex.org/W2068727565","https://openalex.org/W2078148243","https://openalex.org/W2083184631","https://openalex.org/W2122967269","https://openalex.org/W2409994095","https://openalex.org/W2557368223","https://openalex.org/W2651978640","https://openalex.org/W2736936875","https://openalex.org/W2761748578","https://openalex.org/W2892539339"],"related_works":["https://openalex.org/W2967782293","https://openalex.org/W2185192838","https://openalex.org/W2955323683","https://openalex.org/W1564838499","https://openalex.org/W2069961172","https://openalex.org/W1956651153","https://openalex.org/W2139982839","https://openalex.org/W2347561926","https://openalex.org/W1984267569","https://openalex.org/W210339300"],"abstract_inverted_index":{"This":[0],"paper":[1],"studies":[2],"a":[3,18,55,62,83,107,111,117],"two-stage":[4],"hybrid":[5],"flowshop":[6],"scheduling":[7],"problem":[8,97,122,143],"with":[9,110,130],"identical":[10],"parallel":[11,33],"machines":[12],"in":[13,22],"the":[14,23,32,44,67,76,88,95,121,131,138,142],"first":[15,29],"stage":[16],"and":[17,41,101,123],"single":[19],"batching":[20,45,48],"machine":[21,49],"second":[24],"stage.":[25],"Each":[26],"job":[27],"is":[28,64,80,98],"processed":[30,42],"on":[31,43],"machines.":[34],"The":[35,47,58,78],"jobs":[36,53,73],"are":[37],"partitioned":[38],"into":[39,75],"batches":[40],"machine.":[46],"can":[50,144],"process":[51],"several":[52],"as":[54],"batch":[56,63],"simultaneously.":[57],"processing":[59,69],"time":[60,70],"of":[61],"equal":[65],"to":[66,81],"largest":[68],"among":[71],"all":[72],"assigned":[74],"batch.":[77],"objective":[79],"find":[82],"feasible":[84],"schedule":[85],"which":[86],"minimizes":[87],"total":[89],"flow":[90],"time.":[91],"We":[92],"prove":[93],"that":[94,137],"general":[96],"strongly":[99],"NP-hard":[100],"develop":[102],"an":[103],"optimal":[104,147],"algorithm":[105,119,140],"for":[106,120,141],"special":[108],"case":[109],"chain":[112],"constraint.":[113],"Then":[114],"we":[115],"propose":[116],"heuristic":[118],"analyze":[124],"its":[125],"worst-case":[126],"performance":[127],"ratio":[128],"compared":[129],"lower":[132],"bound.":[133],"Computational":[134],"results":[135],"show":[136],"proposed":[139],"generate":[145],"near":[146],"solutions.":[148]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}