{"id":"https://openalex.org/W2043249970","doi":"https://doi.org/10.1109/cdc.2009.5399991","title":"A scatter search based heuristic for the balancing of parallel assembly lines","display_name":"A scatter search based heuristic for the balancing of parallel assembly lines","publication_year":2009,"publication_date":"2009-12-01","ids":{"openalex":"https://openalex.org/W2043249970","doi":"https://doi.org/10.1109/cdc.2009.5399991","mag":"2043249970"},"language":"en","primary_location":{"id":"doi:10.1109/cdc.2009.5399991","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cdc.2009.5399991","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 48h IEEE Conference on Decision and Control (CDC) held jointly with 2009 28th Chinese Control Conference","raw_type":"proceedings-article"},"type":"conference-paper","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/A5055652299","display_name":"Qingxin Guo","orcid":"https://orcid.org/0000-0002-3703-2394"},"institutions":[{"id":"https://openalex.org/I9224756","display_name":"Northeastern University","ror":"https://ror.org/03awzbc87","country_code":"CN","type":"education","lineage":["https://openalex.org/I9224756"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Qingxin Guo","raw_affiliation_strings":["Liaoning Key Laboratory of Manufacturing System and Logistics, The Logistics Institute, Northeastern University, Shenyang, China","Liaoning Key Laboratory of Manufacturing System and Logistics, The Logistics Institute, Northeastern University, Shenyang 110004, China#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Liaoning Key Laboratory of Manufacturing System and Logistics, The Logistics Institute, Northeastern University, Shenyang, China","institution_ids":["https://openalex.org/I9224756"]},{"raw_affiliation_string":"Liaoning Key Laboratory of Manufacturing System and Logistics, The Logistics Institute, Northeastern University, Shenyang 110004, China#TAB#","institution_ids":["https://openalex.org/I9224756"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5080304378","display_name":"Lixin Tang","orcid":"https://orcid.org/0000-0002-9950-5169"},"institutions":[{"id":"https://openalex.org/I9224756","display_name":"Northeastern University","ror":"https://ror.org/03awzbc87","country_code":"CN","type":"education","lineage":["https://openalex.org/I9224756"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Lixin Tang","raw_affiliation_strings":["Liaoning Key Laboratory of Manufacturing System and Logistics, The Logistics Institute, Northeastern University, Shenyang, China","Liaoning Key Laboratory of Manufacturing System and Logistics, The Logistics Institute, Northeastern University, Shenyang 110004, China#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Liaoning Key Laboratory of Manufacturing System and Logistics, The Logistics Institute, Northeastern University, Shenyang, China","institution_ids":["https://openalex.org/I9224756"]},{"raw_affiliation_string":"Liaoning Key Laboratory of Manufacturing System and Logistics, The Logistics Institute, Northeastern University, Shenyang 110004, China#TAB#","institution_ids":["https://openalex.org/I9224756"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I9224756"],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":"6","issue":null,"first_page":"6256","last_page":"6261"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12782","display_name":"Assembly Line Balancing Optimization","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/T12782","display_name":"Assembly Line Balancing Optimization","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/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9520000219345093,"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/T11159","display_name":"Manufacturing Process and Optimization","score":0.9276999831199646,"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/heuristics","display_name":"Heuristics","score":0.8049744367599487},{"id":"https://openalex.org/keywords/benchmark","display_name":"Benchmark (surveying)","score":0.7564556002616882},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6783067584037781},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.6675490736961365},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5334594249725342},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5060848593711853},{"id":"https://openalex.org/keywords/task","display_name":"Task (project management)","score":0.4996826648712158},{"id":"https://openalex.org/keywords/hyper-heuristic","display_name":"Hyper-heuristic","score":0.4935957193374634},{"id":"https://openalex.org/keywords/beam-search","display_name":"Beam search","score":0.45326775312423706},{"id":"https://openalex.org/keywords/process","display_name":"Process (computing)","score":0.4401397705078125},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4347917437553406},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.42641210556030273},{"id":"https://openalex.org/keywords/search-algorithm","display_name":"Search algorithm","score":0.28722649812698364},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.20639047026634216},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.20332664251327515}],"concepts":[{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.8049744367599487},{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.7564556002616882},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6783067584037781},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.6675490736961365},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5334594249725342},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5060848593711853},{"id":"https://openalex.org/C2780451532","wikidata":"https://www.wikidata.org/wiki/Q759676","display_name":"Task (project management)","level":2,"score":0.4996826648712158},{"id":"https://openalex.org/C117270229","wikidata":"https://www.wikidata.org/wiki/Q5957539","display_name":"Hyper-heuristic","level":5,"score":0.4935957193374634},{"id":"https://openalex.org/C19889080","wikidata":"https://www.wikidata.org/wiki/Q2835852","display_name":"Beam search","level":3,"score":0.45326775312423706},{"id":"https://openalex.org/C98045186","wikidata":"https://www.wikidata.org/wiki/Q205663","display_name":"Process (computing)","level":2,"score":0.4401397705078125},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4347917437553406},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.42641210556030273},{"id":"https://openalex.org/C125583679","wikidata":"https://www.wikidata.org/wiki/Q755673","display_name":"Search algorithm","level":2,"score":0.28722649812698364},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.20639047026634216},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.20332664251327515},{"id":"https://openalex.org/C187736073","wikidata":"https://www.wikidata.org/wiki/Q2920921","display_name":"Management","level":1,"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/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","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/C13280743","wikidata":"https://www.wikidata.org/wiki/Q131089","display_name":"Geodesy","level":1,"score":0.0},{"id":"https://openalex.org/C188888258","wikidata":"https://www.wikidata.org/wiki/Q7353390","display_name":"Robot learning","level":4,"score":0.0},{"id":"https://openalex.org/C19966478","wikidata":"https://www.wikidata.org/wiki/Q4810574","display_name":"Mobile robot","level":3,"score":0.0},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"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/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/cdc.2009.5399991","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cdc.2009.5399991","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 48h IEEE Conference on Decision and Control (CDC) held jointly with 2009 28th Chinese Control Conference","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":15,"referenced_works":["https://openalex.org/W1515244187","https://openalex.org/W1975257302","https://openalex.org/W1986836522","https://openalex.org/W1992218626","https://openalex.org/W2005784395","https://openalex.org/W2048819244","https://openalex.org/W2069855436","https://openalex.org/W2095703590","https://openalex.org/W2125509133","https://openalex.org/W2127823468","https://openalex.org/W2139824765","https://openalex.org/W2262606145","https://openalex.org/W4293760835","https://openalex.org/W6674269770","https://openalex.org/W6842704381"],"related_works":["https://openalex.org/W3177062893","https://openalex.org/W3125143773","https://openalex.org/W2007032764","https://openalex.org/W803550684","https://openalex.org/W2483226803","https://openalex.org/W4352977312","https://openalex.org/W4312926500","https://openalex.org/W2041180560","https://openalex.org/W2586529194","https://openalex.org/W1628567638"],"abstract_inverted_index":{"This":[0],"paper":[1],"proposes":[2],"a":[3,17,53],"scatter":[4,54,80],"search":[5,55,81],"based":[6,56],"heuristic":[7,57,140],"approach":[8],"to":[9,25,60],"the":[10,28,38,42,49,62,65,76,98,105,110,122,128,146,150,155],"parallel":[11],"assembly":[12],"lines":[13],"balancing":[14],"problem":[15,50],"where":[16],"given":[18],"set":[19],"of":[20,67,85,104],"tasks":[21],"must":[22],"be":[23,46,136],"assigned":[24],"stations":[26],"while":[27],"total":[29,123],"task":[30],"time":[31,40],"for":[32],"each":[33],"station":[34],"could":[35],"not":[36],"exceed":[37],"cycle":[39],"and":[41,91,115],"precedence":[43],"constraint":[44],"should":[45],"abided.":[47],"Since":[48],"is":[51,58,113],"NP-hard,":[52],"designed":[59],"solve":[61],"problem.":[63],"To":[64],"best":[66,130,151],"our":[68,139],"knowledge,":[69],"there":[70],"has":[71,141],"been":[72],"no":[73],"study":[74],"in":[75,97,154],"literature":[77],"that":[78,109,138],"use":[79],"solving":[82],"this":[83],"type":[84],"ALBP.":[86],"New":[87],"heuristics,":[88],"improvement":[89],"method":[90,94,112],"solution":[92],"combination":[93],"are":[95],"developed":[96],"algorithm":[99],"implementation":[100],"process.":[101],"Computational":[102],"results":[103,153],"benchmark":[106],"problems":[107,126],"indicate":[108],"proposed":[111],"stable":[114],"can":[116,134],"find":[117],"15":[118],"better":[119],"solutions":[120],"among":[121],"95":[124],"test":[125],"than":[127,149],"known":[129,152],"feasible":[131],"solutions.":[132],"It":[133],"also":[135],"seen":[137],"smaller":[142],"average":[143],"gap":[144],"from":[145],"lower":[147],"bound":[148],"literature.":[156]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2016,"cited_by_count":1}],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}