{"id":"https://openalex.org/W2157136231","doi":"https://doi.org/10.1109/coase.2012.6386462","title":"Variable neighborhood search-based subproblem solution procedures for a parallel shifting bottleneck heuristic for complex job shops","display_name":"Variable neighborhood search-based subproblem solution procedures for a parallel shifting bottleneck heuristic for complex job shops","publication_year":2012,"publication_date":"2012-08-01","ids":{"openalex":"https://openalex.org/W2157136231","doi":"https://doi.org/10.1109/coase.2012.6386462","mag":"2157136231"},"language":"en","primary_location":{"id":"doi:10.1109/coase.2012.6386462","is_oa":false,"landing_page_url":"https://doi.org/10.1109/coase.2012.6386462","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2012 IEEE International Conference on Automation Science and Engineering (CASE)","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/A5068993610","display_name":"Andrew Bilyk","orcid":null},"institutions":[{"id":"https://openalex.org/I120691247","display_name":"FernUniversit\u00e4t in Hagen","ror":"https://ror.org/04tkkr536","country_code":"DE","type":"education","lineage":["https://openalex.org/I120691247"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"A. Bilyk","raw_affiliation_strings":["Department of Mathematics and Computer Science, Enterprise-wide Software Systems, University of Hagen, Hagen, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Mathematics and Computer Science, Enterprise-wide Software Systems, University of Hagen, Hagen, Germany","institution_ids":["https://openalex.org/I120691247"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5032060363","display_name":"Lars M\u00f6nch","orcid":null},"institutions":[{"id":"https://openalex.org/I120691247","display_name":"FernUniversit\u00e4t in Hagen","ror":"https://ror.org/04tkkr536","country_code":"DE","type":"education","lineage":["https://openalex.org/I120691247"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"L. Monch","raw_affiliation_strings":["Department of Mathematics and Computer Science, Enterprise-wide Software Systems, University of Hagen, Hagen, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Mathematics and Computer Science, Enterprise-wide Software Systems, University of Hagen, Hagen, Germany","institution_ids":["https://openalex.org/I120691247"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I120691247"],"apc_list":null,"apc_paid":null,"fwci":3.0356,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.91185544,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":97},"biblio":{"volume":"177","issue":null,"first_page":"419","last_page":"424"},"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/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9973999857902527,"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.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/tardiness","display_name":"Tardiness","score":0.898675799369812},{"id":"https://openalex.org/keywords/bottleneck","display_name":"Bottleneck","score":0.882648229598999},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6828815340995789},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.6244069337844849},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.6234579086303711},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.6205771565437317},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6183285713195801},{"id":"https://openalex.org/keywords/variable-neighborhood-search","display_name":"Variable neighborhood search","score":0.6108001470565796},{"id":"https://openalex.org/keywords/job-scheduler","display_name":"Job scheduler","score":0.44441431760787964},{"id":"https://openalex.org/keywords/variable","display_name":"Variable (mathematics)","score":0.41631385684013367},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2249588668346405},{"id":"https://openalex.org/keywords/metaheuristic","display_name":"Metaheuristic","score":0.09931516647338867}],"concepts":[{"id":"https://openalex.org/C2778047078","wikidata":"https://www.wikidata.org/wiki/Q82299449","display_name":"Tardiness","level":4,"score":0.898675799369812},{"id":"https://openalex.org/C2780513914","wikidata":"https://www.wikidata.org/wiki/Q18210350","display_name":"Bottleneck","level":2,"score":0.882648229598999},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6828815340995789},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.6244069337844849},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.6234579086303711},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.6205771565437317},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6183285713195801},{"id":"https://openalex.org/C2776435737","wikidata":"https://www.wikidata.org/wiki/Q7915703","display_name":"Variable neighborhood search","level":3,"score":0.6108001470565796},{"id":"https://openalex.org/C111873713","wikidata":"https://www.wikidata.org/wiki/Q1641413","display_name":"Job scheduler","level":3,"score":0.44441431760787964},{"id":"https://openalex.org/C182365436","wikidata":"https://www.wikidata.org/wiki/Q50701","display_name":"Variable (mathematics)","level":2,"score":0.41631385684013367},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2249588668346405},{"id":"https://openalex.org/C109718341","wikidata":"https://www.wikidata.org/wiki/Q1385229","display_name":"Metaheuristic","level":2,"score":0.09931516647338867},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C149635348","wikidata":"https://www.wikidata.org/wiki/Q193040","display_name":"Embedded system","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/C160403385","wikidata":"https://www.wikidata.org/wiki/Q220543","display_name":"Queue","level":2,"score":0.0},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/coase.2012.6386462","is_oa":false,"landing_page_url":"https://doi.org/10.1109/coase.2012.6386462","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2012 IEEE International Conference on Automation Science and Engineering (CASE)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.7099999785423279,"display_name":"Decent work and economic growth","id":"https://metadata.un.org/sdg/8"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":16,"referenced_works":["https://openalex.org/W1507539267","https://openalex.org/W1579921200","https://openalex.org/W1989570164","https://openalex.org/W2003452693","https://openalex.org/W2008838974","https://openalex.org/W2010334716","https://openalex.org/W2010577417","https://openalex.org/W2062604839","https://openalex.org/W2069657950","https://openalex.org/W2078533235","https://openalex.org/W2087418240","https://openalex.org/W2088304441","https://openalex.org/W2117987000","https://openalex.org/W2159711221","https://openalex.org/W2600961830","https://openalex.org/W3139792597"],"related_works":["https://openalex.org/W2094449457","https://openalex.org/W3097192092","https://openalex.org/W2895982276","https://openalex.org/W2039885954","https://openalex.org/W3029619930","https://openalex.org/W2061005265","https://openalex.org/W2927922058","https://openalex.org/W4221116989","https://openalex.org/W2943986114","https://openalex.org/W2963206272"],"abstract_inverted_index":{"The":[0,33],"shifting":[1],"bottleneck":[2],"heuristic":[3,34],"(SBH)":[4],"for":[5],"complex":[6],"job":[7],"shops":[8],"decomposes":[9],"the":[10,46,49,60,64,80,91],"overall":[11],"scheduling":[12,18,28],"problem":[13],"into":[14],"a":[15,38,56,67],"series":[16],"of":[17,59,66,93],"problems":[19,29],"related":[20],"to":[21,44,62],"machine":[22],"groups.":[23],"These":[24],"smaller,":[25],"more":[26],"tractable,":[27],"are":[30],"called":[31],"subproblems.":[32],"is":[35,42],"based":[36],"on":[37,75,85],"disjunctive":[39],"graph":[40],"that":[41],"used":[43],"model":[45],"relationship":[47],"between":[48],"sub-problems.":[50],"In":[51],"this":[52],"paper,":[53],"we":[54,89],"use":[55],"parallel":[57],"implementation":[58],"SBH":[61],"assess":[63],"impact":[65],"variable":[68],"neighborhood":[69],"search-based":[70],"subproblem":[71],"solution":[72],"procedure":[73],"(SSP)":[74],"global":[76],"performance":[77],"measures":[78],"like":[79],"total":[81],"weighted":[82],"tardiness.":[83],"Based":[84],"designed":[86],"simulation":[87],"experiments,":[88],"demonstrate":[90],"advantage":[92],"using":[94],"high-quality":[95],"SSPs.":[96]},"counts_by_year":[{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":3}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}