{"id":"https://openalex.org/W2904256673","doi":"https://doi.org/10.1109/ickii.2018.8569129","title":"A New Two-objective Single Machine Scheduling Problem Considers a Past-sequence-dependent Setup Time and Learning Effect","display_name":"A New Two-objective Single Machine Scheduling Problem Considers a Past-sequence-dependent Setup Time and Learning Effect","publication_year":2018,"publication_date":"2018-07-01","ids":{"openalex":"https://openalex.org/W2904256673","doi":"https://doi.org/10.1109/ickii.2018.8569129","mag":"2904256673"},"language":"en","primary_location":{"id":"doi:10.1109/ickii.2018.8569129","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ickii.2018.8569129","pdf_url":null,"source":{"id":"https://openalex.org/S4306498242","display_name":"2018 1st IEEE International Conference on Knowledge Innovation and Invention (ICKII)","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":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2018 1st IEEE International Conference on Knowledge Innovation and Invention (ICKII)","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/A5101725973","display_name":"Shih-Hsin Chen","orcid":"https://orcid.org/0000-0001-5635-536X"},"institutions":[{"id":"https://openalex.org/I91951123","display_name":"Cheng Shiu University","ror":"https://ror.org/011bdtx65","country_code":"TW","type":"education","lineage":["https://openalex.org/I91951123"]}],"countries":["TW"],"is_corresponding":true,"raw_author_name":"Shih-Hsin Chen","raw_affiliation_strings":["Department of Information Management, Cheng Shiu University Kaohsiung City, Taiwan R. O. C"],"affiliations":[{"raw_affiliation_string":"Department of Information Management, Cheng Shiu University Kaohsiung City, Taiwan R. O. C","institution_ids":["https://openalex.org/I91951123"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5100774971","display_name":"Yi-Hui Chen","orcid":"https://orcid.org/0000-0003-1146-4073"},"institutions":[{"id":"https://openalex.org/I143578492","display_name":"Asia University","ror":"https://ror.org/038a1tp19","country_code":"TW","type":"education","lineage":["https://openalex.org/I143578492"]}],"countries":["TW"],"is_corresponding":false,"raw_author_name":"Yi-Hui Chen","raw_affiliation_strings":["Department of M-Commerce and Multimedia Applications, Asia University Taichung City, Taiwan R. O. C"],"affiliations":[{"raw_affiliation_string":"Department of M-Commerce and Multimedia Applications, Asia University Taichung City, Taiwan R. O. C","institution_ids":["https://openalex.org/I143578492"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5101725973"],"corresponding_institution_ids":["https://openalex.org/I91951123"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.27204375,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"309","last_page":"312"},"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/T12288","display_name":"Optimization and Search Problems","score":0.9882000088691711,"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"}},{"id":"https://openalex.org/T11814","display_name":"Advanced Manufacturing and Logistics Optimization","score":0.9855999946594238,"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/benchmark","display_name":"Benchmark (surveying)","score":0.661880612373352},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6466125249862671},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6230604648590088},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.6001178622245789},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.5854518413543701},{"id":"https://openalex.org/keywords/pareto-principle","display_name":"Pareto principle","score":0.5654569268226624},{"id":"https://openalex.org/keywords/single-machine-scheduling","display_name":"Single-machine scheduling","score":0.5469635725021362},{"id":"https://openalex.org/keywords/sequence","display_name":"Sequence (biology)","score":0.4878535270690918},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.48414403200149536},{"id":"https://openalex.org/keywords/pareto-optimal","display_name":"Pareto optimal","score":0.47309306263923645},{"id":"https://openalex.org/keywords/multi-objective-optimization","display_name":"Multi-objective optimization","score":0.43981125950813293},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3423600196838379},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.21964532136917114},{"id":"https://openalex.org/keywords/machine-learning","display_name":"Machine learning","score":0.1989126205444336},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.08846050500869751}],"concepts":[{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.661880612373352},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6466125249862671},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6230604648590088},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.6001178622245789},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.5854518413543701},{"id":"https://openalex.org/C137635306","wikidata":"https://www.wikidata.org/wiki/Q182667","display_name":"Pareto principle","level":2,"score":0.5654569268226624},{"id":"https://openalex.org/C2780271269","wikidata":"https://www.wikidata.org/wiki/Q19295956","display_name":"Single-machine scheduling","level":4,"score":0.5469635725021362},{"id":"https://openalex.org/C2778112365","wikidata":"https://www.wikidata.org/wiki/Q3511065","display_name":"Sequence (biology)","level":2,"score":0.4878535270690918},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.48414403200149536},{"id":"https://openalex.org/C2986314615","wikidata":"https://www.wikidata.org/wiki/Q36829","display_name":"Pareto optimal","level":3,"score":0.47309306263923645},{"id":"https://openalex.org/C68781425","wikidata":"https://www.wikidata.org/wiki/Q2052203","display_name":"Multi-objective optimization","level":2,"score":0.43981125950813293},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3423600196838379},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.21964532136917114},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.1989126205444336},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.08846050500869751},{"id":"https://openalex.org/C13280743","wikidata":"https://www.wikidata.org/wiki/Q131089","display_name":"Geodesy","level":1,"score":0.0},{"id":"https://openalex.org/C205649164","wikidata":"https://www.wikidata.org/wiki/Q1071","display_name":"Geography","level":0,"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/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.1109/ickii.2018.8569129","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ickii.2018.8569129","pdf_url":null,"source":{"id":"https://openalex.org/S4306498242","display_name":"2018 1st IEEE International Conference on Knowledge Innovation and Invention (ICKII)","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":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2018 1st IEEE International Conference on Knowledge Innovation and Invention (ICKII)","raw_type":"proceedings-article"},{"id":"pmh:oai:tkuir.lib.tku.edu.tw:987654321/121532","is_oa":false,"landing_page_url":"https://tkuir.lib.tku.edu.tw/dspace/handle/987654321/121532","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":null}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Industry, innovation and infrastructure","score":0.44999998807907104,"id":"https://metadata.un.org/sdg/9"}],"awards":[],"funders":[{"id":"https://openalex.org/F4320322835","display_name":"Ministry of Economic Affairs","ror":"https://ror.org/042ge0913"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":17,"referenced_works":["https://openalex.org/W1529681250","https://openalex.org/W1576373160","https://openalex.org/W1978090048","https://openalex.org/W1981636247","https://openalex.org/W1985977197","https://openalex.org/W1994856874","https://openalex.org/W2005416609","https://openalex.org/W2010369523","https://openalex.org/W2028165888","https://openalex.org/W2028339362","https://openalex.org/W2060365099","https://openalex.org/W2072200639","https://openalex.org/W2090648144","https://openalex.org/W2096415085","https://openalex.org/W2151242950","https://openalex.org/W2248681274","https://openalex.org/W4256495360"],"related_works":["https://openalex.org/W2162001022","https://openalex.org/W1963790170","https://openalex.org/W2073298047","https://openalex.org/W2033790662","https://openalex.org/W2090178682","https://openalex.org/W2586328217","https://openalex.org/W2049264236","https://openalex.org/W2001591765","https://openalex.org/W4241467429","https://openalex.org/W2073147994"],"abstract_inverted_index":{"This":[0,227],"work":[1],"solved":[2],"a":[3,21,52,64,89,140,156,210,216],"new":[4,85,141,148,162],"two-objective":[5,236],"scheduling":[6,237],"problem":[7,48,55,238],"of":[8,107,120,158,177,212],"n":[9],"jobs":[10],"considering":[11],"past-sequence-dependent":[12],"setup":[13],"time":[14,119,220],"(PSD)":[15],"and":[16,29],"learning":[17],"effect":[18],"(LE)":[19],"on":[20,104,195],"single":[22,53],"machine.":[23],"Although":[24],"researchers":[25],"gradually":[26],"consider":[27],"PSD":[28],"LE,":[30],"there":[31],"is":[32,45,49,68],"none":[33],"who":[34,72],"deals":[35],"with":[36,83,116,189,225,234],"both":[37],"effects":[38],"in":[39,215,239],"the":[40,69,98,102,108,114,117,121,146,174,183,190,203,235],"bi-criteria":[41],"problems.":[42],"The":[43,150,198],"reason":[44],"that":[46,124],"multi-objective":[47,192],"harder":[50],"than":[51],"objective":[54,79],"because":[56],"we":[57,87,112,136,186],"need":[58],"to":[59,91,101,138,154,171,232],"acquire":[60],"Pareto":[61,142],"solutions.":[62,149],"As":[63],"result,":[65],"this":[66,74,84,131,240],"paper":[67],"first":[70,96],"one":[71],"solves":[73],"issue.":[75],"We":[76,95],"considered":[77],"two":[78,109,125,147],"functions.":[80],"To":[81,181],"tackle":[82],"problem,":[86],"proposed":[88,184,204,228],"method":[90],"solve":[92],"it":[93,188,222],"effectively.":[94],"analyzed":[97],"parameters":[99],"according":[100],"weights":[103,115],"each":[105],"position":[106],"objectives.":[110],"Then,":[111],"matched":[113],"processing":[118],"jobs.":[122],"So":[123],"optimal":[126,178],"sequences":[127,179],"were":[128,164],"obtained":[129],"by":[130],"matching":[132],"approach.":[133],"In":[134],"addition,":[135],"started":[137],"search":[139,155],"solution":[143],"located":[144],"between":[145],"process":[151],"was":[152,168,206,223,230],"repeated":[153],"pair":[157],"solutions":[159,163,214],"until":[160],"no":[161],"found.":[165],"Our":[166],"approach":[167],"very":[169,217],"efficient":[170],"find":[172],"out":[173],"minimum":[175],"set":[176,211],"(MSOS).":[180],"evaluate":[182],"method,":[185],"compared":[187,224],"benchmark":[191],"algorithm,":[193],"MOEA/D,":[194],"numerous":[196],"instances.":[197],"empirical":[199],"results":[200],"had":[201],"shown":[202],"algorithm":[205,229],"effective":[207],"when":[208,221],"searching":[209],"approximate":[213],"short":[218],"CPU":[219],"MOEA/D.":[226],"promising":[231],"deal":[233],"research.":[241]},"counts_by_year":[],"updated_date":"2026-03-18T14:38:29.013473","created_date":"2025-10-10T00:00:00"}