{"id":"https://openalex.org/W3037221152","doi":"https://doi.org/10.1080/00207543.2020.1781278","title":"Parallel machine scheduling with multiple processing alternatives and sequence-dependent setup times","display_name":"Parallel machine scheduling with multiple processing alternatives and sequence-dependent setup times","publication_year":2020,"publication_date":"2020-06-25","ids":{"openalex":"https://openalex.org/W3037221152","doi":"https://doi.org/10.1080/00207543.2020.1781278","mag":"3037221152"},"language":"en","primary_location":{"id":"doi:10.1080/00207543.2020.1781278","is_oa":false,"landing_page_url":"https://doi.org/10.1080/00207543.2020.1781278","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":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5100708588","display_name":"Jun Kim","orcid":"https://orcid.org/0000-0003-2719-3984"},"institutions":[{"id":"https://openalex.org/I89004649","display_name":"Korea Institute of Industrial Technology","ror":"https://ror.org/04qfph657","country_code":"KR","type":"other","lineage":["https://openalex.org/I2801339556","https://openalex.org/I4210144908","https://openalex.org/I4387152098","https://openalex.org/I89004649"]}],"countries":["KR"],"is_corresponding":false,"raw_author_name":"Jun Kim","raw_affiliation_strings":["Process Platform Research Division, Korea Institute of Industrial Technology, Ansan, Republic of Korea"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Process Platform Research Division, Korea Institute of Industrial Technology, Ansan, Republic of Korea","institution_ids":["https://openalex.org/I89004649"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5100439521","display_name":"Hyun-Jung Kim","orcid":"https://orcid.org/0000-0002-5247-1395"},"institutions":[{"id":"https://openalex.org/I157485424","display_name":"Korea Advanced Institute of Science and Technology","ror":"https://ror.org/05apxxy63","country_code":"KR","type":"education","lineage":["https://openalex.org/I157485424"]}],"countries":["KR"],"is_corresponding":true,"raw_author_name":"Hyun-Jung Kim","raw_affiliation_strings":["Department of Industrial & Systems Engineering, Korea Advanced Institute of Science and Technology, Daejeon, Republic of Korea"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Industrial & Systems Engineering, Korea Advanced Institute of Science and Technology, Daejeon, Republic of Korea","institution_ids":["https://openalex.org/I157485424"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5100439521"],"corresponding_institution_ids":["https://openalex.org/I157485424"],"apc_list":null,"apc_paid":null,"fwci":3.9737,"has_fulltext":false,"cited_by_count":39,"citation_normalized_percentile":{"value":0.94068655,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":95,"max":99},"biblio":{"volume":"59","issue":"18","first_page":"5438","last_page":"5453"},"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/T12782","display_name":"Assembly Line Balancing 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/T11814","display_name":"Advanced Manufacturing and Logistics Optimization","score":0.9991000294685364,"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.7784464359283447},{"id":"https://openalex.org/keywords/travelling-salesman-problem","display_name":"Travelling salesman problem","score":0.6913723945617676},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.6393686532974243},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5954688787460327},{"id":"https://openalex.org/keywords/sequence","display_name":"Sequence (biology)","score":0.5715377330780029},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5560344457626343},{"id":"https://openalex.org/keywords/integer-programming","display_name":"Integer programming","score":0.5387564301490784},{"id":"https://openalex.org/keywords/genetic-algorithm","display_name":"Genetic algorithm","score":0.49399644136428833},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.4660286605358124},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3137073516845703},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.1827249825000763},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.17374229431152344},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.1209639310836792}],"concepts":[{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.7784464359283447},{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.6913723945617676},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.6393686532974243},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5954688787460327},{"id":"https://openalex.org/C2778112365","wikidata":"https://www.wikidata.org/wiki/Q3511065","display_name":"Sequence (biology)","level":2,"score":0.5715377330780029},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5560344457626343},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.5387564301490784},{"id":"https://openalex.org/C8880873","wikidata":"https://www.wikidata.org/wiki/Q187787","display_name":"Genetic algorithm","level":2,"score":0.49399644136428833},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.4660286605358124},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3137073516845703},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.1827249825000763},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.17374229431152344},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.1209639310836792},{"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/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C54355233","wikidata":"https://www.wikidata.org/wiki/Q7162","display_name":"Genetics","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1080/00207543.2020.1781278","is_oa":false,"landing_page_url":"https://doi.org/10.1080/00207543.2020.1781278","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:59:y:2021:i:18:p:5438-5453","is_oa":false,"landing_page_url":"http://hdl.handle.net/10.1080/00207543.2020.1781278","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"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Decent work and economic growth","id":"https://metadata.un.org/sdg/8","score":0.6399999856948853}],"awards":[{"id":"https://openalex.org/G3221261902","display_name":null,"funder_award_id":"No. 2019R1C1C1004667","funder_id":"https://openalex.org/F4320322120","funder_display_name":"National Research Foundation of Korea"}],"funders":[{"id":"https://openalex.org/F4320322120","display_name":"National Research Foundation of Korea","ror":"https://ror.org/013aysd81"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":37,"referenced_works":["https://openalex.org/W781042619","https://openalex.org/W1932181459","https://openalex.org/W1980973321","https://openalex.org/W1983613420","https://openalex.org/W2006539736","https://openalex.org/W2007246612","https://openalex.org/W2011266406","https://openalex.org/W2012062385","https://openalex.org/W2012624547","https://openalex.org/W2017026412","https://openalex.org/W2019732434","https://openalex.org/W2024985738","https://openalex.org/W2026951037","https://openalex.org/W2030498135","https://openalex.org/W2047793127","https://openalex.org/W2049418901","https://openalex.org/W2062583960","https://openalex.org/W2078214107","https://openalex.org/W2082649910","https://openalex.org/W2108661494","https://openalex.org/W2123241324","https://openalex.org/W2159580476","https://openalex.org/W2166745972","https://openalex.org/W2280123974","https://openalex.org/W2401610261","https://openalex.org/W2419490763","https://openalex.org/W2486389971","https://openalex.org/W2577909561","https://openalex.org/W2583167084","https://openalex.org/W2592300366","https://openalex.org/W2611323479","https://openalex.org/W2753109818","https://openalex.org/W2783136113","https://openalex.org/W2887704695","https://openalex.org/W2935342279","https://openalex.org/W4237594404","https://openalex.org/W4302374256"],"related_works":["https://openalex.org/W1525389557","https://openalex.org/W2361554335","https://openalex.org/W2359992618","https://openalex.org/W4297427155","https://openalex.org/W3025823153","https://openalex.org/W3136451934","https://openalex.org/W3200006077","https://openalex.org/W2975368677","https://openalex.org/W2170228269","https://openalex.org/W2011675579"],"abstract_inverted_index":{"This":[0,78],"paper":[1],"examines":[2],"a":[3,20,83,105,124,132,140,155,169,182],"parallel":[4],"machine":[5],"scheduling":[6],"problem":[7],"in":[8,15,19,110],"which":[9,136],"jobs":[10,32,44,187],"can":[11,107],"be":[12,108],"processed":[13],"either":[14],"multiple":[16,189],"parts":[17,64,74],"or":[18,94,168],"complete":[21],"form":[22],"and":[23,47,69,129,161],"the":[24,48,71,76,119,151,158],"number":[25],"of":[26,31,73,114],"possible":[27],"job":[28],"splitting":[29],"alternatives":[30],"is":[33,50,80,137,172,181],"more":[34],"than":[35],"one.":[36],"There":[37],"are":[38,100],"sequence-dependent":[39],"setup":[40],"times":[41],"between":[42,154],"different":[43,115],"(or":[45,65],"parts),":[46],"objective":[49],"to":[51,67],"minimise":[52],"makespan":[53],"by":[54],"choosing":[55],"an":[56,162],"appropriate":[57],"processing":[58,103,186],"alternative":[59],"for":[60,92,185],"each":[61],"job,":[62],"assigning":[63],"jobs)":[66],"machines,":[68,104],"determining":[70],"sequence":[72],"on":[75],"machines.":[77],"work":[79],"motivated":[81],"from":[82,157],"3D":[84,98],"printer-based":[85],"manufacturing":[86],"system":[87],"that":[88,150,179],"produces":[89],"customised":[90],"products":[91],"individuals":[93],"start-up":[95],"companies.":[96],"When":[97],"printers":[99],"used":[101],"as":[102],"product":[106],"printed":[109],"diverse":[111],"forms":[112],"composed":[113],"parts.":[116],"To":[117],"address":[118],"problem,":[120],"we":[121],"first":[122],"propose":[123],"mixed":[125],"integer":[126],"programming":[127],"model":[128],"then":[130],"develop":[131],"hybrid":[133],"genetic":[134],"algorithm":[135,160],"combined":[138],"with":[139,166,188],"travelling":[141],"salesman":[142],"problem-based":[143],"heuristic":[144],"algorithm.":[145],"The":[146,175],"experimental":[147],"results":[148],"show":[149],"average":[152],"gap":[153],"solution":[156],"proposed":[159],"optimal":[163],"one":[164],"solved":[165],"CPLEX":[167],"lower":[170],"bound":[171],"very":[173],"small.":[174],"paired":[176],"t-test":[177],"shows":[178],"there":[180],"significant":[183],"improvement":[184],"alternatives.":[190]},"counts_by_year":[{"year":2026,"cited_by_count":3},{"year":2025,"cited_by_count":8},{"year":2024,"cited_by_count":6},{"year":2023,"cited_by_count":9},{"year":2022,"cited_by_count":10},{"year":2021,"cited_by_count":3}],"updated_date":"2026-05-06T08:25:59.206177","created_date":"2025-10-10T00:00:00"}