{"id":"https://openalex.org/W2152257319","doi":"https://doi.org/10.1080/002077299292263","title":"An efficient configuration generation mechanism to solve job shop scheduling problems by the simulated annealing algorithm","display_name":"An efficient configuration generation mechanism to solve job shop scheduling problems by the simulated annealing algorithm","publication_year":1999,"publication_date":"1999-01-01","ids":{"openalex":"https://openalex.org/W2152257319","doi":"https://doi.org/10.1080/002077299292263","mag":"2152257319"},"language":"en","primary_location":{"id":"doi:10.1080/002077299292263","is_oa":false,"landing_page_url":"https://doi.org/10.1080/002077299292263","pdf_url":null,"source":{"id":"https://openalex.org/S129640837","display_name":"International Journal of Systems Science","issn_l":"0020-7721","issn":["0020-7721","1464-5319"],"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 Systems Science","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/A5008154736","display_name":"Kuei-Bin Wu","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Kuei-Bin Wu","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5008154736"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":8,"citation_normalized_percentile":{"value":0.27062001,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"30","issue":"5","first_page":"527","last_page":"532"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9735999703407288,"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.9735999703407288,"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.9735999703407288,"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/simulated-annealing","display_name":"Simulated annealing","score":0.6992315053939819},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5098182559013367},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.44665995240211487},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.43162208795547485},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.39076459407806396},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.1856115162372589}],"concepts":[{"id":"https://openalex.org/C126980161","wikidata":"https://www.wikidata.org/wiki/Q863783","display_name":"Simulated annealing","level":2,"score":0.6992315053939819},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5098182559013367},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.44665995240211487},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.43162208795547485},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.39076459407806396},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.1856115162372589}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1080/002077299292263","is_oa":false,"landing_page_url":"https://doi.org/10.1080/002077299292263","pdf_url":null,"source":{"id":"https://openalex.org/S129640837","display_name":"International Journal of Systems Science","issn_l":"0020-7721","issn":["0020-7721","1464-5319"],"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 Systems Science","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Decent work and economic growth","score":0.6700000166893005,"id":"https://metadata.un.org/sdg/8"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W2748952813","https://openalex.org/W2051487156","https://openalex.org/W2073681303","https://openalex.org/W2390279801","https://openalex.org/W2358668433","https://openalex.org/W2376932109","https://openalex.org/W2001405890","https://openalex.org/W2382290278","https://openalex.org/W2478288626","https://openalex.org/W4327850430"],"abstract_inverted_index":{"This":[0],"paper":[1],"uses":[2],"the":[3,15,31,41,44,49,64,68,72,75],"simulated":[4,50,76],"annealing":[5,45,51,77],"algorithm":[6,52,59],"to":[7,39],"solve":[8],"job":[9],"shop":[10],"scheduling":[11],"problems,":[12],"thereby":[13],"minimizing":[14],"total":[16],"tardiness.":[17],"Also":[18],"presented":[19],"here":[20],"is":[21,53],"a":[22,56,87],"configuration":[23],"generation":[24],"mechanism":[25],"capable":[26],"of":[27,30,43,67],"excluding":[28],"all":[29],"infeasible":[32],"configurations":[33],"beforehand.":[34],"Doing":[35],"so":[36],"allows":[37],"us":[38],"increase":[40],"efficiency":[42],"process.":[46],"In":[47],"addition,":[48],"compared":[54],"with":[55],"more":[57,81],"tailored":[58],"(MEHA)":[60],",":[61],"indicating":[62],"that":[63],"solution":[65,89],"quality":[66,90],"former":[69],"significantly":[70],"outperforms":[71],"latter.":[73],"Moreover,":[74],"algorithm,":[78],"although":[79],"using":[80],"computational":[82],"time":[83],"than":[84],"MEHA,":[85],"has":[86],"high":[88],"and":[91],"can":[92],"be":[93],"easily":[94],"implemented.":[95]},"counts_by_year":[{"year":2019,"cited_by_count":1},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":3}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}