{"id":"https://openalex.org/W2786992477","doi":"https://doi.org/10.1109/ssci.2017.8280877","title":"Parallel reactive tabu search for job-shop scheduling problems considering energy management","display_name":"Parallel reactive tabu search for job-shop scheduling problems considering energy management","publication_year":2017,"publication_date":"2017-11-01","ids":{"openalex":"https://openalex.org/W2786992477","doi":"https://doi.org/10.1109/ssci.2017.8280877","mag":"2786992477"},"language":"en","primary_location":{"id":"doi:10.1109/ssci.2017.8280877","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ssci.2017.8280877","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2017 IEEE Symposium Series on Computational Intelligence (SSCI)","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/A5043570940","display_name":"Shuhei Kawaguchi","orcid":null},"institutions":[{"id":"https://openalex.org/I16656306","display_name":"Meiji University","ror":"https://ror.org/02rqvrp93","country_code":"JP","type":"education","lineage":["https://openalex.org/I16656306"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"Shuhei Kawaguchi","raw_affiliation_strings":["Graduate School of Advanced Mathematical Sciences, Meiji University, Tokyo, Japan"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Graduate School of Advanced Mathematical Sciences, Meiji University, Tokyo, Japan","institution_ids":["https://openalex.org/I16656306"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5089417989","display_name":"Tatsuya Kokubo","orcid":null},"institutions":[{"id":"https://openalex.org/I16656306","display_name":"Meiji University","ror":"https://ror.org/02rqvrp93","country_code":"JP","type":"education","lineage":["https://openalex.org/I16656306"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"Tatsuya Kokubo","raw_affiliation_strings":["Graduate School of Advanced Mathematical Sciences, Meiji University, Tokyo, Japan"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Graduate School of Advanced Mathematical Sciences, Meiji University, Tokyo, Japan","institution_ids":["https://openalex.org/I16656306"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5022209091","display_name":"Yoshikazu Fukuyama","orcid":"https://orcid.org/0000-0002-6115-1676"},"institutions":[{"id":"https://openalex.org/I16656306","display_name":"Meiji University","ror":"https://ror.org/02rqvrp93","country_code":"JP","type":"education","lineage":["https://openalex.org/I16656306"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"Yoshikazu Fukuyama","raw_affiliation_strings":["Graduate School of Advanced Mathematical Sciences, Meiji University, Tokyo, Japan"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Graduate School of Advanced Mathematical Sciences, Meiji University, Tokyo, Japan","institution_ids":["https://openalex.org/I16656306"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I16656306"],"apc_list":null,"apc_paid":null,"fwci":2.1813,"has_fulltext":false,"cited_by_count":9,"citation_normalized_percentile":{"value":0.88239851,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"8"},"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.9993000030517578,"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/T12176","display_name":"Optimization and Packing Problems","score":0.9952999949455261,"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/tabu-search","display_name":"Tabu search","score":0.874786376953125},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.7218657732009888},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6026111841201782},{"id":"https://openalex.org/keywords/dynamic-priority-scheduling","display_name":"Dynamic priority scheduling","score":0.5519131422042847},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.54655921459198},{"id":"https://openalex.org/keywords/fair-share-scheduling","display_name":"Fair-share scheduling","score":0.5065490007400513},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.5044268369674683},{"id":"https://openalex.org/keywords/flow-shop-scheduling","display_name":"Flow shop scheduling","score":0.495395302772522},{"id":"https://openalex.org/keywords/rate-monotonic-scheduling","display_name":"Rate-monotonic scheduling","score":0.41638684272766113},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.28396326303482056},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.11074405908584595},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.11054903268814087}],"concepts":[{"id":"https://openalex.org/C123370116","wikidata":"https://www.wikidata.org/wiki/Q1424540","display_name":"Tabu search","level":2,"score":0.874786376953125},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.7218657732009888},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6026111841201782},{"id":"https://openalex.org/C107568181","wikidata":"https://www.wikidata.org/wiki/Q5319000","display_name":"Dynamic priority scheduling","level":3,"score":0.5519131422042847},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.54655921459198},{"id":"https://openalex.org/C31689143","wikidata":"https://www.wikidata.org/wiki/Q733809","display_name":"Fair-share scheduling","level":3,"score":0.5065490007400513},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5044268369674683},{"id":"https://openalex.org/C158336966","wikidata":"https://www.wikidata.org/wiki/Q3074426","display_name":"Flow shop scheduling","level":4,"score":0.495395302772522},{"id":"https://openalex.org/C127456818","wikidata":"https://www.wikidata.org/wiki/Q238879","display_name":"Rate-monotonic scheduling","level":4,"score":0.41638684272766113},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.28396326303482056},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.11074405908584595},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.11054903268814087},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/ssci.2017.8280877","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ssci.2017.8280877","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2017 IEEE Symposium Series on Computational Intelligence (SSCI)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Affordable and clean energy","score":0.8199999928474426,"id":"https://metadata.un.org/sdg/7"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":20,"referenced_works":["https://openalex.org/W86946307","https://openalex.org/W1527522705","https://openalex.org/W1810830047","https://openalex.org/W1967271207","https://openalex.org/W1971338172","https://openalex.org/W1989353689","https://openalex.org/W2011649121","https://openalex.org/W2026426028","https://openalex.org/W2045755915","https://openalex.org/W2088304441","https://openalex.org/W2111244700","https://openalex.org/W2118975071","https://openalex.org/W2150322710","https://openalex.org/W2527700012","https://openalex.org/W2586783145","https://openalex.org/W2766159318","https://openalex.org/W4212899374","https://openalex.org/W4241417314","https://openalex.org/W6603630510","https://openalex.org/W6657066221"],"related_works":["https://openalex.org/W2184166483","https://openalex.org/W2397293317","https://openalex.org/W2377713709","https://openalex.org/W2167574351","https://openalex.org/W2225350526","https://openalex.org/W2949165180","https://openalex.org/W2838819579","https://openalex.org/W131757205","https://openalex.org/W2384952691","https://openalex.org/W2538210412"],"abstract_inverted_index":{"This":[0,82],"paper":[1,83],"presents":[2],"parallel":[3,111],"reactive":[4,112],"tabu":[5,113],"search":[6],"for":[7],"job-shop":[8],"scheduling":[9,15,47,69,88],"problems":[10],"considering":[11],"energy":[12,29,36,53,62,93,108],"management.":[13],"Production":[14],"of":[16,28,35,52,80,92,101],"factories":[17,39,49],"should":[18,40,73],"be":[19,41,74],"minimized":[20],"to":[21,85,96],"keep":[22],"customer":[23],"delivery":[24],"time.":[25],"Since":[26],"reduction":[27],"costs":[30,63,109],"is":[31,70],"important,":[32],"operational":[33,90],"planning":[34,91],"plants":[37,54],"in":[38,48],"optimized":[42],"as":[43],"well.":[44],"However,":[45],"the":[46,68,77],"and":[50,89,106],"optimization":[51],"have":[55,64],"been":[56,65],"solved":[57],"separately":[58],"so":[59],"far.":[60],"Although":[61],"ignored":[66],"when":[67],"optimized,":[71],"it":[72],"considered":[75],"from":[76],"management":[78],"point":[79],"view.":[81],"tries":[84],"optimize":[86],"production":[87],"plant":[94],"simultaneously":[95],"minimize":[97],"maximum":[98],"end":[99],"time":[100],"all":[102],"factory":[103],"operations":[104],"(makespan)":[105],"total":[107],"using":[110],"search.":[114]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":2}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}