{"id":"https://openalex.org/W2075492256","doi":"https://doi.org/10.1109/cec.2012.6252932","title":"A composite heuristic for the no-wait flow shop scheduling","display_name":"A composite heuristic for the no-wait flow shop scheduling","publication_year":2012,"publication_date":"2012-06-01","ids":{"openalex":"https://openalex.org/W2075492256","doi":"https://doi.org/10.1109/cec.2012.6252932","mag":"2075492256"},"language":"en","primary_location":{"id":"doi:10.1109/cec.2012.6252932","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cec.2012.6252932","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2012 IEEE Congress on Evolutionary Computation","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/A5082236615","display_name":"Kaizhou Gao","orcid":"https://orcid.org/0000-0002-9252-6928"},"institutions":[{"id":"https://openalex.org/I196934937","display_name":"Liaocheng University","ror":"https://ror.org/03yh0n709","country_code":"CN","type":"education","lineage":["https://openalex.org/I196934937"]}],"countries":["CN"],"is_corresponding":true,"raw_author_name":"Gao Kaizhou","raw_affiliation_strings":["College of computer science, Liaocheng University, Liaocheng, China","College of computer science, Liaocheng University, China"],"affiliations":[{"raw_affiliation_string":"College of computer science, Liaocheng University, Liaocheng, China","institution_ids":["https://openalex.org/I196934937"]},{"raw_affiliation_string":"College of computer science, Liaocheng University, China","institution_ids":["https://openalex.org/I196934937"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5025626208","display_name":"Ponnuthurai Nagaratnam Suganthan","orcid":"https://orcid.org/0000-0003-0901-5105"},"institutions":[{"id":"https://openalex.org/I172675005","display_name":"Nanyang Technological University","ror":"https://ror.org/02e7b5302","country_code":"SG","type":"education","lineage":["https://openalex.org/I172675005"]}],"countries":["SG"],"is_corresponding":false,"raw_author_name":"P.N. Suganthan","raw_affiliation_strings":["School of Electrical and Electronic Engineering, Nanyang Technological University, Singapore, Singapore","School of Electrical and Electronic Engineering Nanyang Technological University, Singapore 639798 Singapore"],"affiliations":[{"raw_affiliation_string":"School of Electrical and Electronic Engineering, Nanyang Technological University, Singapore, Singapore","institution_ids":["https://openalex.org/I172675005"]},{"raw_affiliation_string":"School of Electrical and Electronic Engineering Nanyang Technological University, Singapore 639798 Singapore","institution_ids":["https://openalex.org/I172675005"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5103652734","display_name":"Zhenqiang Bao","orcid":null},"institutions":[{"id":"https://openalex.org/I78978612","display_name":"Yangzhou University","ror":"https://ror.org/03tqb8s11","country_code":"CN","type":"education","lineage":["https://openalex.org/I78978612"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Bao Zhenqiang","raw_affiliation_strings":["College of Information Engineering, Yangzhou University, Yangzhou, China","[College of Information Engineering, Yangzhou University, China]"],"affiliations":[{"raw_affiliation_string":"College of Information Engineering, Yangzhou University, Yangzhou, China","institution_ids":["https://openalex.org/I78978612"]},{"raw_affiliation_string":"[College of Information Engineering, Yangzhou University, China]","institution_ids":["https://openalex.org/I78978612"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5082236615"],"corresponding_institution_ids":["https://openalex.org/I196934937"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.2032471,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"56","issue":null,"first_page":"1","last_page":"5"},"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/T11814","display_name":"Advanced Manufacturing and Logistics Optimization","score":0.9897000193595886,"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.9889000058174133,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/heuristics","display_name":"Heuristics","score":0.7852818965911865},{"id":"https://openalex.org/keywords/flow-shop-scheduling","display_name":"Flow shop scheduling","score":0.7818723917007446},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6462081670761108},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6457672119140625},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.6120914220809937},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.5471325516700745},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.5172446370124817},{"id":"https://openalex.org/keywords/constructive","display_name":"Constructive","score":0.47690486907958984},{"id":"https://openalex.org/keywords/benchmark","display_name":"Benchmark (surveying)","score":0.47205716371536255},{"id":"https://openalex.org/keywords/null-move-heuristic","display_name":"Null-move heuristic","score":0.44736337661743164},{"id":"https://openalex.org/keywords/operator","display_name":"Operator (biology)","score":0.4346330761909485},{"id":"https://openalex.org/keywords/consistent-heuristic","display_name":"Consistent heuristic","score":0.43276581168174744},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3121035695075989},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.280624657869339},{"id":"https://openalex.org/keywords/incremental-heuristic-search","display_name":"Incremental heuristic search","score":0.11443981528282166},{"id":"https://openalex.org/keywords/search-algorithm","display_name":"Search algorithm","score":0.06727635860443115},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.06654670834541321},{"id":"https://openalex.org/keywords/process","display_name":"Process (computing)","score":0.06106346845626831}],"concepts":[{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.7852818965911865},{"id":"https://openalex.org/C158336966","wikidata":"https://www.wikidata.org/wiki/Q3074426","display_name":"Flow shop scheduling","level":4,"score":0.7818723917007446},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6462081670761108},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6457672119140625},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.6120914220809937},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.5471325516700745},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5172446370124817},{"id":"https://openalex.org/C2778701210","wikidata":"https://www.wikidata.org/wiki/Q28130034","display_name":"Constructive","level":3,"score":0.47690486907958984},{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.47205716371536255},{"id":"https://openalex.org/C114290370","wikidata":"https://www.wikidata.org/wiki/Q1415915","display_name":"Null-move heuristic","level":3,"score":0.44736337661743164},{"id":"https://openalex.org/C17020691","wikidata":"https://www.wikidata.org/wiki/Q139677","display_name":"Operator (biology)","level":5,"score":0.4346330761909485},{"id":"https://openalex.org/C200246849","wikidata":"https://www.wikidata.org/wiki/Q5163226","display_name":"Consistent heuristic","level":5,"score":0.43276581168174744},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3121035695075989},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.280624657869339},{"id":"https://openalex.org/C139979381","wikidata":"https://www.wikidata.org/wiki/Q17056021","display_name":"Incremental heuristic search","level":4,"score":0.11443981528282166},{"id":"https://openalex.org/C125583679","wikidata":"https://www.wikidata.org/wiki/Q755673","display_name":"Search algorithm","level":2,"score":0.06727635860443115},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.06654670834541321},{"id":"https://openalex.org/C98045186","wikidata":"https://www.wikidata.org/wiki/Q205663","display_name":"Process (computing)","level":2,"score":0.06106346845626831},{"id":"https://openalex.org/C158448853","wikidata":"https://www.wikidata.org/wiki/Q425218","display_name":"Repressor","level":4,"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/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.0},{"id":"https://openalex.org/C19889080","wikidata":"https://www.wikidata.org/wiki/Q2835852","display_name":"Beam search","level":3,"score":0.0},{"id":"https://openalex.org/C104317684","wikidata":"https://www.wikidata.org/wiki/Q7187","display_name":"Gene","level":2,"score":0.0},{"id":"https://openalex.org/C185592680","wikidata":"https://www.wikidata.org/wiki/Q2329","display_name":"Chemistry","level":0,"score":0.0},{"id":"https://openalex.org/C55493867","wikidata":"https://www.wikidata.org/wiki/Q7094","display_name":"Biochemistry","level":1,"score":0.0},{"id":"https://openalex.org/C86339819","wikidata":"https://www.wikidata.org/wiki/Q407384","display_name":"Transcription factor","level":3,"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/C13280743","wikidata":"https://www.wikidata.org/wiki/Q131089","display_name":"Geodesy","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/cec.2012.6252932","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cec.2012.6252932","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2012 IEEE Congress on Evolutionary Computation","raw_type":"proceedings-article"},{"id":"pmh:oai:dr.ntu.edu.sg:10356/96842","is_oa":false,"landing_page_url":"http://hdl.handle.net/10220/11988","pdf_url":null,"source":{"id":"https://openalex.org/S4306402609","display_name":"DR-NTU (Nanyang Technological University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I172675005","host_organization_name":"Nanyang Technological University","host_organization_lineage":["https://openalex.org/I172675005"],"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":"Conference Paper"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/8","score":0.6000000238418579,"display_name":"Decent work and economic growth"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":24,"referenced_works":["https://openalex.org/W1967955864","https://openalex.org/W1984642568","https://openalex.org/W1988343920","https://openalex.org/W1989312204","https://openalex.org/W1997933997","https://openalex.org/W2012198775","https://openalex.org/W2018353230","https://openalex.org/W2022506544","https://openalex.org/W2034282101","https://openalex.org/W2039385547","https://openalex.org/W2042007290","https://openalex.org/W2049258233","https://openalex.org/W2050942141","https://openalex.org/W2052272326","https://openalex.org/W2056630065","https://openalex.org/W2056987382","https://openalex.org/W2066531342","https://openalex.org/W2071156267","https://openalex.org/W2090069860","https://openalex.org/W2149884725","https://openalex.org/W2156391157","https://openalex.org/W2170716909","https://openalex.org/W4233159355","https://openalex.org/W4235332010"],"related_works":["https://openalex.org/W2185192838","https://openalex.org/W2967782293","https://openalex.org/W2955323683","https://openalex.org/W1564838499","https://openalex.org/W2069961172","https://openalex.org/W2559484340","https://openalex.org/W26892725","https://openalex.org/W1971939018","https://openalex.org/W1965402973","https://openalex.org/W2752773177"],"abstract_inverted_index":{"Heuristics":[0],"that":[1,88,102],"explore":[2],"specific":[3],"characteristics":[4],"of":[5,45,69,82],"the":[6,37,43,62,67,70,103,109,113,118],"problem":[7,127],"are":[8,75,89],"essential":[9],"to":[10,65],"find":[11],"good":[12],"solutions":[13,68],"in":[14],"limited":[15],"computational":[16,73],"time":[17,131],"for":[18,122],"many":[19],"practical":[20],"systems.":[21],"This":[22],"paper":[23],"first":[24],"presents":[25],"a":[26,49,80],"constructive":[27,120],"heuristic,":[28,51],"namely":[29],"improved":[30,52],"standard":[31,38,53],"deviation":[32,39,54],"heuristic":[33,40,55,115],"(ISDH),":[34],"by":[35],"combining":[36],"(SDH)":[41],"with":[42,56,128],"procedure":[44],"effective":[46],"double-job-insert-operator.":[47],"Then,":[48],"composite":[50],"iteration":[57,63],"(ISDHI),":[58],"is":[59],"proposed":[60,119],"using":[61],"operator":[64],"improve":[66],"ISDH.":[71],"Extensive":[72],"experiments":[74],"carried":[76],"out":[77],"based":[78],"on":[79],"set":[81],"well-known":[83],"flow":[84,93,124,130],"shop":[85,94,125],"benchmark":[86],"instances":[87],"considered":[90],"as":[91],"no-wait":[92,123],"scheduling":[95,126],"instances.":[96],"Computational":[97],"results":[98],"and":[99,112],"comparisons":[100],"show":[101],"ISDHI":[104,114],"performs":[105],"significantly":[106],"better":[107],"than":[108],"existing":[110],"ones,":[111],"further":[116],"improves":[117],"heuristics":[121],"total":[129],"criterion.":[132]},"counts_by_year":[{"year":2019,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2016-06-24T00:00:00"}