{"id":"https://openalex.org/W1990127005","doi":"https://doi.org/10.1145/2576768.2598213","title":"A heuristic approach to schedule reoptimization in the context of interactive optimization","display_name":"A heuristic approach to schedule reoptimization in the context of interactive optimization","publication_year":2014,"publication_date":"2014-07-11","ids":{"openalex":"https://openalex.org/W1990127005","doi":"https://doi.org/10.1145/2576768.2598213","mag":"1990127005"},"language":"en","primary_location":{"id":"doi:10.1145/2576768.2598213","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2576768.2598213","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2014 Annual Conference on Genetic and 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/A5005544026","display_name":"David Meignan","orcid":"https://orcid.org/0000-0001-7225-8615"},"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":"David Meignan","raw_affiliation_strings":["Universit\u00e4t Osnabr\u00fcck, Osnabr\u00fcck, Germany","Universitat Osnabruck, Osnabruck, Germany"],"affiliations":[{"raw_affiliation_string":"Universit\u00e4t Osnabr\u00fcck, Osnabr\u00fcck, Germany","institution_ids":["https://openalex.org/I170658231"]},{"raw_affiliation_string":"Universitat Osnabruck, Osnabruck, Germany","institution_ids":["https://openalex.org/I170658231"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5005544026"],"corresponding_institution_ids":["https://openalex.org/I170658231"],"apc_list":null,"apc_paid":null,"fwci":1.6849,"has_fulltext":false,"cited_by_count":12,"citation_normalized_percentile":{"value":0.85373373,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"461","last_page":"468"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12401","display_name":"Scheduling and Timetabling Solutions","score":0.9998000264167786,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},"topics":[{"id":"https://openalex.org/T12401","display_name":"Scheduling and Timetabling Solutions","score":0.9998000264167786,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9991999864578247,"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/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9987999796867371,"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/mathematical-optimization","display_name":"Mathematical optimization","score":0.7294924855232239},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6967896819114685},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.6395537853240967},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.555083155632019},{"id":"https://openalex.org/keywords/metaheuristic","display_name":"Metaheuristic","score":0.5220794081687927},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.5136787295341492},{"id":"https://openalex.org/keywords/obstacle","display_name":"Obstacle","score":0.5062207579612732},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.47824326157569885},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.45306238532066345},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.44964396953582764},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.41859686374664307},{"id":"https://openalex.org/keywords/context","display_name":"Context (archaeology)","score":0.4156709313392639},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.1258709728717804}],"concepts":[{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.7294924855232239},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6967896819114685},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.6395537853240967},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.555083155632019},{"id":"https://openalex.org/C109718341","wikidata":"https://www.wikidata.org/wiki/Q1385229","display_name":"Metaheuristic","level":2,"score":0.5220794081687927},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.5136787295341492},{"id":"https://openalex.org/C2776650193","wikidata":"https://www.wikidata.org/wiki/Q264661","display_name":"Obstacle","level":2,"score":0.5062207579612732},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.47824326157569885},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.45306238532066345},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.44964396953582764},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.41859686374664307},{"id":"https://openalex.org/C2779343474","wikidata":"https://www.wikidata.org/wiki/Q3109175","display_name":"Context (archaeology)","level":2,"score":0.4156709313392639},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.1258709728717804},{"id":"https://openalex.org/C17744445","wikidata":"https://www.wikidata.org/wiki/Q36442","display_name":"Political science","level":0,"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/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C199539241","wikidata":"https://www.wikidata.org/wiki/Q7748","display_name":"Law","level":1,"score":0.0},{"id":"https://openalex.org/C151730666","wikidata":"https://www.wikidata.org/wiki/Q7205","display_name":"Paleontology","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":1,"locations":[{"id":"doi:10.1145/2576768.2598213","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2576768.2598213","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2014 Annual Conference on Genetic and Evolutionary Computation","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Peace, Justice and strong institutions","id":"https://metadata.un.org/sdg/16","score":0.7300000190734863}],"awards":[],"funders":[{"id":"https://openalex.org/F4320320879","display_name":"Deutsche Forschungsgemeinschaft","ror":"https://ror.org/018mejw64"},{"id":"https://openalex.org/F4320327422","display_name":"Kwame Nkrumah University of Science and Technology","ror":"https://ror.org/00cb23x68"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":26,"referenced_works":["https://openalex.org/W86994119","https://openalex.org/W1512285802","https://openalex.org/W1528796068","https://openalex.org/W1529634223","https://openalex.org/W1532554206","https://openalex.org/W1773444504","https://openalex.org/W2013459868","https://openalex.org/W2016721869","https://openalex.org/W2051662438","https://openalex.org/W2056302562","https://openalex.org/W2061005345","https://openalex.org/W2065601237","https://openalex.org/W2067091385","https://openalex.org/W2070721801","https://openalex.org/W2080081621","https://openalex.org/W2081234605","https://openalex.org/W2123696861","https://openalex.org/W2148948822","https://openalex.org/W2151019861","https://openalex.org/W2159298214","https://openalex.org/W2168893789","https://openalex.org/W2340030103","https://openalex.org/W3022193041","https://openalex.org/W4211231030","https://openalex.org/W4235967258","https://openalex.org/W6638174742"],"related_works":["https://openalex.org/W2794103424","https://openalex.org/W1996530509","https://openalex.org/W3028317537","https://openalex.org/W2389515972","https://openalex.org/W4245435724","https://openalex.org/W2055301889","https://openalex.org/W4400979532","https://openalex.org/W2376554934","https://openalex.org/W2077790809","https://openalex.org/W4375949242"],"abstract_inverted_index":{"Optimization":[0],"models":[1],"used":[2],"in":[3,50,191],"planning":[4],"and":[5,23,93,154,185],"scheduling":[6],"systems":[7,15],"are":[8,130],"not":[9],"exempt":[10],"from":[11],"inaccuracies.":[12],"These":[13],"optimization":[14,37],"often":[16],"require":[17,55],"an":[18,36,95,189],"expert":[19],"to":[20,24,56,66,113,132],"assess":[21],"solutions":[22],"adjust":[25],"them":[26],"before":[27],"taking":[28],"decisions.":[29],"However,":[30],"adjusting":[31],"a":[32,51,58,70,90,106,121,137,146,176,181,192],"solution":[33,53,71],"computed":[34],"by":[35,75,159],"procedure":[38],"is":[39,105,118,152],"difficult,":[40],"especially":[41],"because":[42],"of":[43,61,69,85,123,136,183],"the":[44,62,67,83,86,114,149,167],"cascading":[45,87,150],"effect.":[46],"A":[47],"small":[48,147],"modification":[49],"candidate":[52],"may":[54],"modify":[57],"large":[59],"part":[60],"solution.":[63],"This":[64,116],"obstacle":[65],"adjustment":[68],"can":[72],"be":[73,156],"overcome":[74],"interactive":[76],"reoptimization.":[77,115],"In":[78],"this":[79],"paper":[80],"we":[81],"analyze":[82],"impact":[84],"effect":[88,151],"on":[89,120,126],"shift-scheduling":[91],"problem":[92,124],"propose":[94],"efficient":[96],"heuristic":[97],"approach":[98,104,117],"for":[99,188],"reoptimizing":[100],"solutions.":[101],"The":[102],"proposed":[103,168],"local-search":[107],"metaheuristic":[108],"that":[109,166],"has":[110],"been":[111],"adapted":[112],"evaluated":[119],"set":[122],"instances":[125],"which":[127],"additional":[128],"preferences":[129],"generated":[131],"simulate":[133],"desired":[134],"adjustments":[135],"decision":[138,193],"maker.":[139],"Experimental":[140],"results":[141,164],"indicate":[142],"that,":[143],"even":[144],"with":[145],"perturbation,":[148],"manifest":[153],"cannot":[155],"efficiently":[157],"tackled":[158],"applying":[160],"recovery":[161],"actions.":[162],"Moreover,":[163],"show":[165],"reoptimization":[169],"method":[170],"provides":[171],"significant":[172],"cost":[173],"gains":[174],"within":[175],"short":[177],"time":[178],"while":[179],"keeping":[180],"level":[182],"simplicity":[184],"modularity":[186],"adequate":[187],"implementation":[190],"support":[194],"system.":[195]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":3},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":2}],"updated_date":"2026-03-27T14:29:43.386196","created_date":"2025-10-10T00:00:00"}