{"id":"https://openalex.org/W2120193757","doi":"https://doi.org/10.1109/icmlc.2011.6016867","title":"An efficient metaheuristic for the blocking job shop problem with the makespan minimization","display_name":"An efficient metaheuristic for the blocking job shop problem with the makespan minimization","publication_year":2011,"publication_date":"2011-07-01","ids":{"openalex":"https://openalex.org/W2120193757","doi":"https://doi.org/10.1109/icmlc.2011.6016867","mag":"2120193757"},"language":"en","primary_location":{"id":"doi:10.1109/icmlc.2011.6016867","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icmlc.2011.6016867","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2011 International Conference on Machine Learning and Cybernetics","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/A5000539711","display_name":"Jie Zhu","orcid":"https://orcid.org/0000-0002-8568-037X"},"institutions":[{"id":"https://openalex.org/I76569877","display_name":"Southeast University","ror":"https://ror.org/04ct4d772","country_code":"CN","type":"education","lineage":["https://openalex.org/I76569877"]}],"countries":["CN"],"is_corresponding":true,"raw_author_name":"Jie Zhu","raw_affiliation_strings":["School of Computer Science &Engineering, South-East University, Nanjing, China","School of Computer Science &Engineering, Southeast University, 210096, Nanjing, P.R. China"],"affiliations":[{"raw_affiliation_string":"School of Computer Science &Engineering, South-East University, Nanjing, China","institution_ids":["https://openalex.org/I76569877"]},{"raw_affiliation_string":"School of Computer Science &Engineering, Southeast University, 210096, Nanjing, P.R. China","institution_ids":["https://openalex.org/I76569877"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5041611973","display_name":"Xiaoping Li","orcid":"https://orcid.org/0000-0003-3201-0038"},"institutions":[{"id":"https://openalex.org/I76569877","display_name":"Southeast University","ror":"https://ror.org/04ct4d772","country_code":"CN","type":"education","lineage":["https://openalex.org/I76569877"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Xiao-Ping Li","raw_affiliation_strings":["School of Computer Science &Engineering, South-East University, Nanjing, China","School of Computer Science &Engineering, Southeast University, 210096, Nanjing, P.R. China"],"affiliations":[{"raw_affiliation_string":"School of Computer Science &Engineering, South-East University, Nanjing, China","institution_ids":["https://openalex.org/I76569877"]},{"raw_affiliation_string":"School of Computer Science &Engineering, Southeast University, 210096, Nanjing, P.R. China","institution_ids":["https://openalex.org/I76569877"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5000539711"],"corresponding_institution_ids":["https://openalex.org/I76569877"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.21933786,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"4","issue":null,"first_page":"1352","last_page":"1357"},"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/T12782","display_name":"Assembly Line Balancing Optimization","score":0.9961000084877014,"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.992900013923645,"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/blocking","display_name":"Blocking (statistics)","score":0.8778975605964661},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.8535948395729065},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.7243432998657227},{"id":"https://openalex.org/keywords/sequence","display_name":"Sequence (biology)","score":0.6765468120574951},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6657536029815674},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6369774341583252},{"id":"https://openalex.org/keywords/minification","display_name":"Minification","score":0.6231023073196411},{"id":"https://openalex.org/keywords/job-shop","display_name":"Job shop","score":0.6089041233062744},{"id":"https://openalex.org/keywords/metaheuristic","display_name":"Metaheuristic","score":0.4672204256057739},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4171258807182312},{"id":"https://openalex.org/keywords/flow-shop-scheduling","display_name":"Flow shop scheduling","score":0.34481069445610046},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.20399680733680725},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.05379962921142578}],"concepts":[{"id":"https://openalex.org/C144745244","wikidata":"https://www.wikidata.org/wiki/Q4927286","display_name":"Blocking (statistics)","level":2,"score":0.8778975605964661},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.8535948395729065},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.7243432998657227},{"id":"https://openalex.org/C2778112365","wikidata":"https://www.wikidata.org/wiki/Q3511065","display_name":"Sequence (biology)","level":2,"score":0.6765468120574951},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6657536029815674},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6369774341583252},{"id":"https://openalex.org/C147764199","wikidata":"https://www.wikidata.org/wiki/Q6865248","display_name":"Minification","level":2,"score":0.6231023073196411},{"id":"https://openalex.org/C2777243215","wikidata":"https://www.wikidata.org/wiki/Q1493226","display_name":"Job shop","level":5,"score":0.6089041233062744},{"id":"https://openalex.org/C109718341","wikidata":"https://www.wikidata.org/wiki/Q1385229","display_name":"Metaheuristic","level":2,"score":0.4672204256057739},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4171258807182312},{"id":"https://openalex.org/C158336966","wikidata":"https://www.wikidata.org/wiki/Q3074426","display_name":"Flow shop scheduling","level":4,"score":0.34481069445610046},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.20399680733680725},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.05379962921142578},{"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/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":1,"locations":[{"id":"doi:10.1109/icmlc.2011.6016867","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icmlc.2011.6016867","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2011 International Conference on Machine Learning and Cybernetics","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Decent work and economic growth","id":"https://metadata.un.org/sdg/8","score":0.6100000143051147}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":12,"referenced_works":["https://openalex.org/W1507539267","https://openalex.org/W1555410326","https://openalex.org/W1967184557","https://openalex.org/W1974960304","https://openalex.org/W2028900733","https://openalex.org/W2067814550","https://openalex.org/W2076785727","https://openalex.org/W2104670598","https://openalex.org/W2114736096","https://openalex.org/W2145079270","https://openalex.org/W2162535720","https://openalex.org/W2168939712"],"related_works":["https://openalex.org/W2967782293","https://openalex.org/W2185192838","https://openalex.org/W2955323683","https://openalex.org/W1564838499","https://openalex.org/W2069961172","https://openalex.org/W2559484340","https://openalex.org/W26892725","https://openalex.org/W2165758382","https://openalex.org/W2146297781","https://openalex.org/W2612484291"],"abstract_inverted_index":{"In":[0],"this":[1],"paper,":[2],"the":[3,9,21,25,44,60,73,81,84,102,108,116],"blocking":[4,63,74,82],"job":[5],"shop":[6],"problem":[7],"with":[8,95],"makespan":[10],"minimization":[11],"is":[12,18,32,40,67,97],"considered,":[13],"in":[14,59],"which":[15,104],"each":[16],"operation":[17,31],"blocked":[19],"on":[20,76],"corresponding":[22],"machine":[23,26],"until":[24],"required":[27],"by":[28,51],"its":[29],"successive":[30],"available.":[33],"A":[34,62,91],"feasible":[35],"schedule":[36,46],"generation":[37],"method":[38],"(FSGM)":[39],"introduced":[41],"to":[42,71,99,107],"obtain":[43],"valid":[45],"of":[47,57],"a":[48,77],"given":[49],"sequence":[50,103],"resolving":[52],"conflicts":[53],"between":[54],"every":[55],"pair":[56],"jobs":[58],"sequence.":[61],"time":[64,75],"transfer":[65],"procedure":[66],"integrated":[68],"into":[69],"FSGM":[70],"reduce":[72],"job.":[78],"By":[79],"reducing":[80],"time,":[83],"solution":[85],"obtained":[86],"can":[87,105,119],"be":[88],"further":[89],"improved.":[90],"complete":[92],"local":[93],"search":[94],"memory":[96],"proposed":[98,117],"aim":[100],"for":[101],"lead":[106],"optimal":[109],"schedule.":[110],"The":[111],"computational":[112],"results":[113],"show":[114],"that":[115],"algorithm":[118],"perform":[120],"effectively":[121],"and":[122],"efficiently.":[123]},"counts_by_year":[{"year":2015,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}