{"id":"https://openalex.org/W2099641832","doi":"https://doi.org/10.1109/etfa.2008.4638404","title":"Descending Deviation Optimization techniques for scheduling problems","display_name":"Descending Deviation Optimization techniques for scheduling problems","publication_year":2008,"publication_date":"2008-09-01","ids":{"openalex":"https://openalex.org/W2099641832","doi":"https://doi.org/10.1109/etfa.2008.4638404","mag":"2099641832"},"language":"en","primary_location":{"id":"doi:10.1109/etfa.2008.4638404","is_oa":false,"landing_page_url":"https://doi.org/10.1109/etfa.2008.4638404","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2008 IEEE International Conference on Emerging Technologies and Factory Automation","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/A5077733112","display_name":"Kevin McCarty","orcid":null},"institutions":[{"id":"https://openalex.org/I155093810","display_name":"University of Idaho","ror":"https://ror.org/03hbp5t65","country_code":"US","type":"education","lineage":["https://openalex.org/I155093810"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Kevin McCarty","raw_affiliation_strings":["University of Idaho, Idaho Falls, Idaho Falls, ID, USA","University of Idaho at Idaho Falls, Idaho Falls, ID"],"affiliations":[{"raw_affiliation_string":"University of Idaho, Idaho Falls, Idaho Falls, ID, USA","institution_ids":["https://openalex.org/I155093810"]},{"raw_affiliation_string":"University of Idaho at Idaho Falls, Idaho Falls, ID","institution_ids":["https://openalex.org/I155093810"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5032679061","display_name":"Milos Manic","orcid":"https://orcid.org/0000-0003-1484-7678"},"institutions":[{"id":"https://openalex.org/I155093810","display_name":"University of Idaho","ror":"https://ror.org/03hbp5t65","country_code":"US","type":"education","lineage":["https://openalex.org/I155093810"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Milos Manic","raw_affiliation_strings":["University of Idaho, Idaho Falls, Idaho Falls, ID, USA","University of Idaho at Idaho Falls, Idaho Falls, ID"],"affiliations":[{"raw_affiliation_string":"University of Idaho, Idaho Falls, Idaho Falls, ID, USA","institution_ids":["https://openalex.org/I155093810"]},{"raw_affiliation_string":"University of Idaho at Idaho Falls, Idaho Falls, ID","institution_ids":["https://openalex.org/I155093810"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5077733112"],"corresponding_institution_ids":["https://openalex.org/I155093810"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.17708333,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"257","last_page":"260"},"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/T12782","display_name":"Assembly Line Balancing Optimization","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/T11814","display_name":"Advanced Manufacturing and Logistics Optimization","score":0.9991000294685364,"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/heuristics","display_name":"Heuristics","score":0.6877102851867676},{"id":"https://openalex.org/keywords/local-search","display_name":"Local search (optimization)","score":0.6756759881973267},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.643778383731842},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5990293622016907},{"id":"https://openalex.org/keywords/maxima-and-minima","display_name":"Maxima and minima","score":0.5161577463150024},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.4599330723285675},{"id":"https://openalex.org/keywords/local-optimum","display_name":"Local optimum","score":0.4406159520149231},{"id":"https://openalex.org/keywords/simulated-annealing","display_name":"Simulated annealing","score":0.43091779947280884},{"id":"https://openalex.org/keywords/guided-local-search","display_name":"Guided Local Search","score":0.4240010976791382},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.37783923745155334},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.26126062870025635}],"concepts":[{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.6877102851867676},{"id":"https://openalex.org/C135320971","wikidata":"https://www.wikidata.org/wiki/Q1868524","display_name":"Local search (optimization)","level":2,"score":0.6756759881973267},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.643778383731842},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5990293622016907},{"id":"https://openalex.org/C186633575","wikidata":"https://www.wikidata.org/wiki/Q845060","display_name":"Maxima and minima","level":2,"score":0.5161577463150024},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.4599330723285675},{"id":"https://openalex.org/C141934464","wikidata":"https://www.wikidata.org/wiki/Q3305386","display_name":"Local optimum","level":2,"score":0.4406159520149231},{"id":"https://openalex.org/C126980161","wikidata":"https://www.wikidata.org/wiki/Q863783","display_name":"Simulated annealing","level":2,"score":0.43091779947280884},{"id":"https://openalex.org/C90189156","wikidata":"https://www.wikidata.org/wiki/Q5615481","display_name":"Guided Local Search","level":3,"score":0.4240010976791382},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.37783923745155334},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.26126062870025635},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/etfa.2008.4638404","is_oa":false,"landing_page_url":"https://doi.org/10.1109/etfa.2008.4638404","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2008 IEEE International Conference on Emerging Technologies and Factory Automation","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":18,"referenced_works":["https://openalex.org/W1833002563","https://openalex.org/W1925170655","https://openalex.org/W1942657423","https://openalex.org/W2038098148","https://openalex.org/W2101097701","https://openalex.org/W2103074876","https://openalex.org/W2121957462","https://openalex.org/W2122510010","https://openalex.org/W2125799878","https://openalex.org/W2131781499","https://openalex.org/W2135062849","https://openalex.org/W2136031107","https://openalex.org/W2159167005","https://openalex.org/W2170886993","https://openalex.org/W2623293810","https://openalex.org/W2983945110","https://openalex.org/W6640568896","https://openalex.org/W6675229121"],"related_works":["https://openalex.org/W2123829500","https://openalex.org/W2560221187","https://openalex.org/W1655912143","https://openalex.org/W3174749984","https://openalex.org/W4283765137","https://openalex.org/W2305572622","https://openalex.org/W2361949641","https://openalex.org/W4244591017","https://openalex.org/W4236293121","https://openalex.org/W2913640856"],"abstract_inverted_index":{"In":[0],"factory":[1],"automation,":[2],"production":[3],"line":[4],"scheduling":[5],"entails":[6],"a":[7,26,62,72,87,97,102,120],"number":[8],"of":[9,18,58,68],"competing":[10],"issues.":[11],"Finding":[12],"optimal":[13],"configurations":[14],"often":[15],"requires":[16],"use":[17],"local":[19,33,44,52,103,121],"search":[20,23,45,104,122],"techniques.":[21],"Local":[22],"looks":[24],"for":[25],"goal":[27],"state":[28,40],"employing":[29],"heuristics":[30],"and":[31,124],"random":[32],"ldquoprobesrdquo":[34],"in":[35,61,95],"order":[36],"to":[37,41,106,119],"move":[38],"from":[39,49],"state.":[42,64],"All":[43],"techniques,":[46],"however,":[47],"suffer":[48],"problems":[50],"with":[51],"maxima,":[53],"i.e.":[54],"have":[55],"the":[56,79,117],"potential":[57],"getting":[59],"ldquostuckrdquo":[60],"suboptimal":[63],"While":[65],"careful":[66],"introduction":[67],"randomizations":[69],"is":[70,128],"certainly":[71],"recognized":[73],"technique,":[74],"it":[75],"can":[76],"also":[77],"lead":[78],"algorithm":[80],"even":[81],"more":[82],"astray.":[83,113],"This":[84],"paper":[85],"describes":[86],"heuristic":[88],"technique":[89,105,123],"called":[90],"descending":[91],"deviation":[92],"optimizations":[93],"(DDO)":[94],"which":[96],"gradually":[98],"lowering-randomization":[99],"ceiling":[100],"allows":[101],"ldquobouncerdquo":[107],"randomly":[108],"without":[109],"going":[110],"too":[111],"far":[112],"An":[114],"example":[115],"applying":[116],"DDO":[118],"achieving":[125],"significant":[126],"improvement":[127],"shown.":[129]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}