{"id":"https://openalex.org/W4200242722","doi":"https://doi.org/10.1080/00207543.2021.2007426","title":"An exact algorithm for an identical parallel additive machine scheduling problem with multiple processing alternatives","display_name":"An exact algorithm for an identical parallel additive machine scheduling problem with multiple processing alternatives","publication_year":2021,"publication_date":"2021-12-06","ids":{"openalex":"https://openalex.org/W4200242722","doi":"https://doi.org/10.1080/00207543.2021.2007426"},"language":"en","primary_location":{"id":"doi:10.1080/00207543.2021.2007426","is_oa":false,"landing_page_url":"https://doi.org/10.1080/00207543.2021.2007426","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/A5100708586","display_name":"Jun Kim","orcid":"https://orcid.org/0000-0002-6114-2673"},"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":["Manufacturing Process Platform R&D Department, Korea Institute of Industrial Technology, Ansan, Republic of Korea"],"affiliations":[{"raw_affiliation_string":"Manufacturing Process Platform R&D Department, 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"],"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":0.593,"has_fulltext":false,"cited_by_count":8,"citation_normalized_percentile":{"value":0.74652241,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":94,"max":99},"biblio":{"volume":"60","issue":"13","first_page":"4070","last_page":"4089"},"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.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"}},{"id":"https://openalex.org/T12176","display_name":"Optimization and Packing Problems","score":0.9987000226974487,"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.772189736366272},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6263707876205444},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5879285335540771},{"id":"https://openalex.org/keywords/solver","display_name":"Solver","score":0.5791463851928711},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.5408151745796204},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5066633820533752},{"id":"https://openalex.org/keywords/flexibility","display_name":"Flexibility (engineering)","score":0.4464518129825592},{"id":"https://openalex.org/keywords/cutting-stock-problem","display_name":"Cutting stock problem","score":0.4344174861907959},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.30997103452682495},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2380003035068512},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.08775058388710022}],"concepts":[{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.772189736366272},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6263707876205444},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5879285335540771},{"id":"https://openalex.org/C2778770139","wikidata":"https://www.wikidata.org/wiki/Q1966904","display_name":"Solver","level":2,"score":0.5791463851928711},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5408151745796204},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5066633820533752},{"id":"https://openalex.org/C2780598303","wikidata":"https://www.wikidata.org/wiki/Q65921492","display_name":"Flexibility (engineering)","level":2,"score":0.4464518129825592},{"id":"https://openalex.org/C37307619","wikidata":"https://www.wikidata.org/wiki/Q1306230","display_name":"Cutting stock problem","level":3,"score":0.4344174861907959},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.30997103452682495},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2380003035068512},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.08775058388710022},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1080/00207543.2021.2007426","is_oa":false,"landing_page_url":"https://doi.org/10.1080/00207543.2021.2007426","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:60:y:2022:i:13:p:4070-4089","is_oa":false,"landing_page_url":"http://hdl.handle.net/10.1080/00207543.2021.2007426","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":[{"score":0.5,"id":"https://metadata.un.org/sdg/8","display_name":"Decent work and economic growth"}],"awards":[{"id":"https://openalex.org/G7513939568","display_name":null,"funder_award_id":"2019R1C1C1004667","funder_id":"https://openalex.org/F4320325392","funder_display_name":"Bilim, Sanayi ve Teknoloji Bakanli\u011fi"}],"funders":[{"id":"https://openalex.org/F4320322120","display_name":"National Research Foundation of Korea","ror":"https://ror.org/013aysd81"},{"id":"https://openalex.org/F4320325392","display_name":"Bilim, Sanayi ve Teknoloji Bakanli\u011fi","ror":"https://ror.org/01xspp494"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":36,"referenced_works":["https://openalex.org/W1465609241","https://openalex.org/W1746476868","https://openalex.org/W1932181459","https://openalex.org/W1966497004","https://openalex.org/W2024985738","https://openalex.org/W2026951037","https://openalex.org/W2032938251","https://openalex.org/W2040573638","https://openalex.org/W2052841853","https://openalex.org/W2058817479","https://openalex.org/W2066583564","https://openalex.org/W2069959731","https://openalex.org/W2079477591","https://openalex.org/W2087245794","https://openalex.org/W2120350145","https://openalex.org/W2159580476","https://openalex.org/W2272903275","https://openalex.org/W2282272624","https://openalex.org/W2401610261","https://openalex.org/W2549915099","https://openalex.org/W2604280268","https://openalex.org/W2748045170","https://openalex.org/W2753109818","https://openalex.org/W2783136113","https://openalex.org/W2801916413","https://openalex.org/W2887704695","https://openalex.org/W2898476076","https://openalex.org/W2971126969","https://openalex.org/W2979872753","https://openalex.org/W2999208346","https://openalex.org/W3005000543","https://openalex.org/W3007652200","https://openalex.org/W3037221152","https://openalex.org/W3093251515","https://openalex.org/W3155629222","https://openalex.org/W4302374256"],"related_works":["https://openalex.org/W3172150420","https://openalex.org/W2186864281","https://openalex.org/W2107725657","https://openalex.org/W4255427455","https://openalex.org/W2112121444","https://openalex.org/W3204654320","https://openalex.org/W4289540402","https://openalex.org/W2006067030","https://openalex.org/W2593238258","https://openalex.org/W2468275703"],"abstract_inverted_index":{"This":[0,23,69],"paper":[1],"develops":[2],"an":[3,28,139],"exact":[4,113],"algorithm":[5,155],"for":[6,91,180],"the":[7,21,102,109,118,143,150,154,164,169],"identical":[8],"parallel":[9],"additive":[10,39,110],"machine":[11],"scheduling":[12],"problem":[13,70,83,98],"by":[14,37],"considering":[15],"multiple":[16],"processing":[17,89,170,182],"alternatives":[18,171,183],"to":[19,48,85,100,108,137],"minimise":[20],"makespan.":[22],"research":[24],"is":[25,71,84,99,135],"motivated":[26],"from":[27],"idea":[29],"of":[30,33,117,122,142,153,184],"elevating":[31],"flexibility":[32],"a":[34,50,53,56,62,74,87,123,128,132,157],"manufacturing":[35],"system":[36],"using":[38],"machines,":[40],"such":[41],"as":[42,73],"3D":[43],"printers.":[44],"It":[45],"becomes":[46],"possible":[47],"produce":[49],"job":[51,57],"in":[52,61,66,78],"different":[54],"form;":[55],"can":[58],"be":[59,106],"printed":[60],"complete":[63],"form":[64],"or":[65],"separate":[67],"parts.":[68],"defined":[72],"bi-level":[75],"optimisation":[76],"model":[77],"which":[79,115],"its":[80,95],"upper":[81],"level":[82,97],"determine":[86],"proper":[88],"alternative":[90],"each":[92],"product,":[93],"and":[94,131],"lower":[96],"assign":[101],"parts":[103,165],"that":[104,149],"should":[105],"produced":[107],"machines.":[111],"An":[112],"algorithm,":[114,130,134],"consists":[116],"linear":[119],"programming":[120],"relaxation":[121],"one-dimensional":[124],"cutting":[125],"stock":[126],"problem,":[127],"branch-and-price":[129],"rescheduling":[133],"proposed":[136],"find":[138],"optimal":[140],"solution":[141],"problem.":[144],"The":[145],"experimental":[146],"results":[147],"show":[148],"computational":[151],"time":[152],"outperforms":[156],"commercial":[158],"solver":[159],"(CPLEX).":[160],"By":[161],"examining":[162],"how":[163],"are":[166,172,178],"comprised":[167],"when":[168],"optimally":[173],"selected,":[174],"some":[175],"useful":[176],"insights":[177],"derived":[179],"designing":[181],"products.":[185]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":3},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}