{"id":"https://openalex.org/W4212808824","doi":"https://doi.org/10.1016/0166-218x(95)00030-u","title":"Improving local search heuristics for some scheduling problems\u2014I","display_name":"Improving local search heuristics for some scheduling problems\u2014I","publication_year":1996,"publication_date":"1996-03-01","ids":{"openalex":"https://openalex.org/W4212808824","doi":"https://doi.org/10.1016/0166-218x(95)00030-u"},"language":"en","primary_location":{"id":"doi:10.1016/0166-218x(95)00030-u","is_oa":false,"landing_page_url":"https://doi.org/10.1016/0166-218x(95)00030-u","pdf_url":null,"source":{"id":"https://openalex.org/S171741597","display_name":"Discrete Applied Mathematics","issn_l":"0166-218X","issn":["0166-218X","1872-6771"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Discrete Applied Mathematics","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://research.utwente.nl/en/publications/38559f19-e817-4ef6-a426-b7f9a8622c43","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5000179258","display_name":"Peter Brucker","orcid":null},"institutions":[{"id":"https://openalex.org/I170658231","display_name":"Osnabr\u00fcck University","ror":"https://ror.org/04qmmjx98","country_code":"DE","type":"education","lineage":["https://openalex.org/I170658231"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Peter Brucker","raw_affiliation_strings":["F.B. Mathematik/Informodik, Universit\u00e4t Osnabr\u00fcck, 49069 Osnabr\u00fcck, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"F.B. Mathematik/Informodik, Universit\u00e4t Osnabr\u00fcck, 49069 Osnabr\u00fcck, Germany","institution_ids":["https://openalex.org/I170658231"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5001577619","display_name":"Johann L. Hurink","orcid":"https://orcid.org/0000-0001-6986-5633"},"institutions":[{"id":"https://openalex.org/I170658231","display_name":"Osnabr\u00fcck University","ror":"https://ror.org/04qmmjx98","country_code":"DE","type":"education","lineage":["https://openalex.org/I170658231"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Johann Hurink","raw_affiliation_strings":["F.B. Mathematik/Informodik, Universit\u00e4t Osnabr\u00fcck, 49069 Osnabr\u00fcck, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"F.B. Mathematik/Informodik, Universit\u00e4t Osnabr\u00fcck, 49069 Osnabr\u00fcck, Germany","institution_ids":["https://openalex.org/I170658231"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5000420548","display_name":"Frank Werner","orcid":"https://orcid.org/0000-0002-0709-3591"},"institutions":[{"id":"https://openalex.org/I95793202","display_name":"Otto-von-Guericke-Universit\u00e4t Magdeburg","ror":"https://ror.org/00ggpsq73","country_code":"DE","type":"education","lineage":["https://openalex.org/I95793202"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Frank Werner","raw_affiliation_strings":["Institut f\u00fcr Math. Optimierung, Otto-von-Guericke-Universit\u00e4t, 39016 Magdeburg, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Institut f\u00fcr Math. Optimierung, Otto-von-Guericke-Universit\u00e4t, 39016 Magdeburg, Germany","institution_ids":["https://openalex.org/I95793202"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5000179258"],"corresponding_institution_ids":["https://openalex.org/I170658231"],"apc_list":{"value":2750,"currency":"USD","value_usd":2750},"apc_paid":null,"fwci":7.8738,"has_fulltext":true,"cited_by_count":47,"citation_normalized_percentile":{"value":0.97662792,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"65","issue":"1-3","first_page":"97","last_page":"122"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9998999834060669,"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.9998999834060669,"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.996999979019165,"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"}},{"id":"https://openalex.org/T11814","display_name":"Advanced Manufacturing and Logistics Optimization","score":0.9958000183105469,"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.8121339082717896},{"id":"https://openalex.org/keywords/heuristics","display_name":"Heuristics","score":0.7515318393707275},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6945319771766663},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6861423254013062},{"id":"https://openalex.org/keywords/simulated-annealing","display_name":"Simulated annealing","score":0.6636719107627869},{"id":"https://openalex.org/keywords/guided-local-search","display_name":"Guided Local Search","score":0.6540152430534363},{"id":"https://openalex.org/keywords/local-search","display_name":"Local search (optimization)","score":0.6364879608154297},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.555344820022583},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.43467244505882263},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.4158085286617279},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.2442193627357483},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.05025550723075867}],"concepts":[{"id":"https://openalex.org/C123370116","wikidata":"https://www.wikidata.org/wiki/Q1424540","display_name":"Tabu search","level":2,"score":0.8121339082717896},{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.7515318393707275},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6945319771766663},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6861423254013062},{"id":"https://openalex.org/C126980161","wikidata":"https://www.wikidata.org/wiki/Q863783","display_name":"Simulated annealing","level":2,"score":0.6636719107627869},{"id":"https://openalex.org/C90189156","wikidata":"https://www.wikidata.org/wiki/Q5615481","display_name":"Guided Local Search","level":3,"score":0.6540152430534363},{"id":"https://openalex.org/C135320971","wikidata":"https://www.wikidata.org/wiki/Q1868524","display_name":"Local search (optimization)","level":2,"score":0.6364879608154297},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.555344820022583},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.43467244505882263},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.4158085286617279},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.2442193627357483},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.05025550723075867},{"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/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1016/0166-218x(95)00030-u","is_oa":false,"landing_page_url":"https://doi.org/10.1016/0166-218x(95)00030-u","pdf_url":null,"source":{"id":"https://openalex.org/S171741597","display_name":"Discrete Applied Mathematics","issn_l":"0166-218X","issn":["0166-218X","1872-6771"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Discrete Applied Mathematics","raw_type":"journal-article"},{"id":"pmh:oai:ris.utwente.nl:openaire/38559f19-e817-4ef6-a426-b7f9a8622c43","is_oa":true,"landing_page_url":"https://research.utwente.nl/en/publications/38559f19-e817-4ef6-a426-b7f9a8622c43","pdf_url":null,"source":{"id":"https://openalex.org/S4406922991","display_name":"University of Twente Research Information","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Brucker, P, Hurink, J L & Werner, F 1996, 'Improving local search heuristics for some scheduling problems -- I', Discrete applied mathematics, vol. 65, no. 1-3, pp. 97-122. https://doi.org/10.1016/0166-218X(95)00030-U","raw_type":"info:eu-repo/semantics/article"},{"id":"pmh:oai:ris.utwente.nl:publications/38559f19-e817-4ef6-a426-b7f9a8622c43","is_oa":false,"landing_page_url":null,"pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":""}],"best_oa_location":{"id":"pmh:oai:ris.utwente.nl:openaire/38559f19-e817-4ef6-a426-b7f9a8622c43","is_oa":true,"landing_page_url":"https://research.utwente.nl/en/publications/38559f19-e817-4ef6-a426-b7f9a8622c43","pdf_url":null,"source":{"id":"https://openalex.org/S4406922991","display_name":"University of Twente Research Information","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Brucker, P, Hurink, J L & Werner, F 1996, 'Improving local search heuristics for some scheduling problems -- I', Discrete applied mathematics, vol. 65, no. 1-3, pp. 97-122. https://doi.org/10.1016/0166-218X(95)00030-U","raw_type":"info:eu-repo/semantics/article"},"sustainable_development_goals":[{"score":0.6700000166893005,"id":"https://metadata.un.org/sdg/11","display_name":"Sustainable cities and communities"}],"awards":[],"funders":[{"id":"https://openalex.org/F4320320879","display_name":"Deutsche Forschungsgemeinschaft","ror":"https://ror.org/018mejw64"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":11,"referenced_works":["https://openalex.org/W40309320","https://openalex.org/W125070839","https://openalex.org/W1569458199","https://openalex.org/W1965057580","https://openalex.org/W1985217989","https://openalex.org/W2030250600","https://openalex.org/W2081278763","https://openalex.org/W2104670598","https://openalex.org/W2322240213","https://openalex.org/W4246598646","https://openalex.org/W7047213121"],"related_works":["https://openalex.org/W173587566","https://openalex.org/W1533229056","https://openalex.org/W2072199923","https://openalex.org/W1232705","https://openalex.org/W625289373","https://openalex.org/W2321371676","https://openalex.org/W2971736757","https://openalex.org/W1979763505","https://openalex.org/W2519041592","https://openalex.org/W1555693598"],"abstract_inverted_index":null,"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2018,"cited_by_count":5},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":1},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":1}],"updated_date":"2026-03-10T14:07:55.174380","created_date":"2025-10-10T00:00:00"}
