{"id":"https://openalex.org/W2979872753","doi":"https://doi.org/10.1080/00207543.2019.1672900","title":"Minimising total tardiness for the identical parallel machine scheduling problem with splitting jobs and sequence-dependent setup times","display_name":"Minimising total tardiness for the identical parallel machine scheduling problem with splitting jobs and sequence-dependent setup times","publication_year":2019,"publication_date":"2019-10-11","ids":{"openalex":"https://openalex.org/W2979872753","doi":"https://doi.org/10.1080/00207543.2019.1672900","mag":"2979872753"},"language":"en","primary_location":{"id":"doi:10.1080/00207543.2019.1672900","is_oa":false,"landing_page_url":"https://doi.org/10.1080/00207543.2019.1672900","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/A5100638063","display_name":"Jae-Gon Kim","orcid":"https://orcid.org/0000-0002-4821-4441"},"institutions":[{"id":"https://openalex.org/I146429904","display_name":"Incheon National University","ror":"https://ror.org/02xf7p935","country_code":"KR","type":"education","lineage":["https://openalex.org/I146429904"]}],"countries":["KR"],"is_corresponding":false,"raw_author_name":"Jae-Gon Kim","raw_affiliation_strings":["Department of Industrial & Management Engineering, Incheon National University, Incheon, Korea"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Industrial & Management Engineering, Incheon National University, Incheon, Korea","institution_ids":["https://openalex.org/I146429904"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5078439692","display_name":"Seokwoo Song","orcid":"https://orcid.org/0000-0001-7918-0283"},"institutions":[{"id":"https://openalex.org/I119261591","display_name":"Weber State University","ror":"https://ror.org/01epn2q93","country_code":"US","type":"education","lineage":["https://openalex.org/I119261591"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Seokwoo Song","raw_affiliation_strings":["Department of Supply Chain & Management Information Systems, Weber State University, Ogden, UT, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Supply Chain & Management Information Systems, Weber State University, Ogden, UT, USA","institution_ids":["https://openalex.org/I119261591"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5041318191","display_name":"BongJoo Jeong","orcid":"https://orcid.org/0000-0002-2891-5718"},"institutions":[{"id":"https://openalex.org/I112728665","display_name":"Hannam University","ror":"https://ror.org/01cwbae71","country_code":"KR","type":"education","lineage":["https://openalex.org/I112728665"]}],"countries":["KR"],"is_corresponding":true,"raw_author_name":"BongJoo Jeong","raw_affiliation_strings":["Department of Industrial & Management Engineering, Hannam University, Daejeon, Korea"],"raw_orcid":"https://orcid.org/0000-0002-2891-5718","affiliations":[{"raw_affiliation_string":"Department of Industrial & Management Engineering, Hannam University, Daejeon, Korea","institution_ids":["https://openalex.org/I112728665"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5041318191"],"corresponding_institution_ids":["https://openalex.org/I112728665"],"apc_list":null,"apc_paid":null,"fwci":3.7279,"has_fulltext":false,"cited_by_count":52,"citation_normalized_percentile":{"value":0.93840202,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":94,"max":99},"biblio":{"volume":"58","issue":"6","first_page":"1628","last_page":"1643"},"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/T12176","display_name":"Optimization and Packing Problems","score":0.9926999807357788,"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.9912999868392944,"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/tardiness","display_name":"Tardiness","score":0.9640823602676392},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.6742033958435059},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6646232008934021},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.627025842666626},{"id":"https://openalex.org/keywords/simulated-annealing","display_name":"Simulated annealing","score":0.5947985649108887},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5895019769668579},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.5881951451301575},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.5544363260269165},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.522929310798645},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.5062300562858582},{"id":"https://openalex.org/keywords/encoding","display_name":"Encoding (memory)","score":0.4867517948150635},{"id":"https://openalex.org/keywords/due-date","display_name":"Due date","score":0.44461774826049805},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.42461538314819336},{"id":"https://openalex.org/keywords/sequence","display_name":"Sequence (biology)","score":0.42364686727523804},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.3607313632965088},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.20809027552604675},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.09856131672859192}],"concepts":[{"id":"https://openalex.org/C2778047078","wikidata":"https://www.wikidata.org/wiki/Q82299449","display_name":"Tardiness","level":4,"score":0.9640823602676392},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.6742033958435059},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6646232008934021},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.627025842666626},{"id":"https://openalex.org/C126980161","wikidata":"https://www.wikidata.org/wiki/Q863783","display_name":"Simulated annealing","level":2,"score":0.5947985649108887},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5895019769668579},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.5881951451301575},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.5544363260269165},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.522929310798645},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.5062300562858582},{"id":"https://openalex.org/C125411270","wikidata":"https://www.wikidata.org/wiki/Q18653","display_name":"Encoding (memory)","level":2,"score":0.4867517948150635},{"id":"https://openalex.org/C3019208289","wikidata":"https://www.wikidata.org/wiki/Q56612115","display_name":"Due date","level":3,"score":0.44461774826049805},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.42461538314819336},{"id":"https://openalex.org/C2778112365","wikidata":"https://www.wikidata.org/wiki/Q3511065","display_name":"Sequence (biology)","level":2,"score":0.42364686727523804},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.3607313632965088},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.20809027552604675},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.09856131672859192},{"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},{"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.2019.1672900","is_oa":false,"landing_page_url":"https://doi.org/10.1080/00207543.2019.1672900","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:58:y:2020:i:6:p:1628-1643","is_oa":false,"landing_page_url":"http://hdl.handle.net/10.1080/00207543.2019.1672900","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":[{"id":"https://metadata.un.org/sdg/8","display_name":"Decent work and economic growth","score":0.5799999833106995}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":40,"referenced_works":["https://openalex.org/W1964096047","https://openalex.org/W1979805465","https://openalex.org/W1982147649","https://openalex.org/W2007246612","https://openalex.org/W2009141775","https://openalex.org/W2013292956","https://openalex.org/W2015772023","https://openalex.org/W2022047536","https://openalex.org/W2024635476","https://openalex.org/W2024985738","https://openalex.org/W2026951037","https://openalex.org/W2030638987","https://openalex.org/W2039112427","https://openalex.org/W2041375306","https://openalex.org/W2044667276","https://openalex.org/W2045989495","https://openalex.org/W2047793127","https://openalex.org/W2052693123","https://openalex.org/W2059468126","https://openalex.org/W2063143176","https://openalex.org/W2065015112","https://openalex.org/W2070322591","https://openalex.org/W2071277483","https://openalex.org/W2078214107","https://openalex.org/W2082649910","https://openalex.org/W2085424933","https://openalex.org/W2087301741","https://openalex.org/W2089431723","https://openalex.org/W2103283316","https://openalex.org/W2255734301","https://openalex.org/W2260817482","https://openalex.org/W2360717914","https://openalex.org/W2512395380","https://openalex.org/W2577909561","https://openalex.org/W2591837641","https://openalex.org/W2613931388","https://openalex.org/W2756249750","https://openalex.org/W2803371904","https://openalex.org/W3151157462","https://openalex.org/W4247245376"],"related_works":["https://openalex.org/W3097192092","https://openalex.org/W3029619930","https://openalex.org/W2061005265","https://openalex.org/W1992259816","https://openalex.org/W2060337406","https://openalex.org/W180477571","https://openalex.org/W4381616416","https://openalex.org/W3157291475","https://openalex.org/W2044253754","https://openalex.org/W2153799489"],"abstract_inverted_index":{"This":[0],"paper":[1],"focuses":[2],"on":[3,38],"an":[4],"identical":[5],"parallel":[6,39],"machine":[7],"scheduling":[8,24],"problem":[9],"with":[10,50,60,98],"minimising":[11],"total":[12],"tardiness":[13],"of":[14,101],"jobs.":[15],"There":[16],"are":[17,96,111],"two":[18,69,102],"major":[19],"issues":[20],"involved":[21],"in":[22],"this":[23],"problem;":[25],"(1)":[26],"jobs":[27,49],"which":[28],"can":[29],"be":[30],"split":[31],"into":[32],"multiple":[33],"sub-jobs":[34],"for":[35,72,79],"being":[36],"processed":[37],"machines":[40],"independently":[41],"and":[42,75,92,105,122],"(2)":[43],"sequence-dependent":[44],"setup":[45],"times":[46],"between":[47],"the":[48,65,84,115,129,145],"different":[51,88],"part":[52],"types.":[53],"We":[54,67],"present":[55],"a":[56,81],"novel":[57],"mathematical":[58],"model":[59],"meta-heuristic":[61,73,85],"approaches":[62],"to":[63,113],"solve":[64],"problem.":[66],"propose":[68],"encoding":[70,103,120],"schemes":[71,104,121],"solutions":[74],"three":[76,106],"decoding":[77,107,123],"methods":[78],"obtaining":[80],"schedule":[82],"from":[83,118],"solutions.":[86],"Six":[87],"simulated":[89],"annealing":[90],"algorithms":[91],"genetic":[93],"algorithms,":[94],"respectively,":[95],"developed":[97],"six":[99],"combinations":[100],"methods.":[108,124],"Computational":[109],"experiments":[110],"performed":[112],"find":[114],"best":[116],"combination":[117],"those":[119],"Our":[125],"findings":[126],"show":[127],"that":[128],"suggested":[130],"algorithm":[131],"provides":[132],"not":[133],"only":[134],"better":[135],"solution":[136],"quality,":[137],"but":[138],"also":[139],"less":[140],"computation":[141],"time":[142],"required":[143],"than":[144],"commercial":[146],"optimisation":[147],"solvers.":[148]},"counts_by_year":[{"year":2026,"cited_by_count":5},{"year":2025,"cited_by_count":6},{"year":2024,"cited_by_count":7},{"year":2023,"cited_by_count":14},{"year":2022,"cited_by_count":8},{"year":2021,"cited_by_count":10},{"year":2020,"cited_by_count":2}],"updated_date":"2026-07-26T07:53:14.480251","created_date":"2025-10-10T00:00:00"}