{"id":"https://openalex.org/W2068171188","doi":"https://doi.org/10.1109/cdc.2013.6760724","title":"Projection-based optimal mode scheduling","display_name":"Projection-based optimal mode scheduling","publication_year":2013,"publication_date":"2013-12-01","ids":{"openalex":"https://openalex.org/W2068171188","doi":"https://doi.org/10.1109/cdc.2013.6760724","mag":"2068171188"},"language":"en","primary_location":{"id":"doi:10.1109/cdc.2013.6760724","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cdc.2013.6760724","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"52nd IEEE Conference on Decision and Control","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/A5111628533","display_name":"Timothy M. Caldwell","orcid":null},"institutions":[{"id":"https://openalex.org/I111979921","display_name":"Northwestern University","ror":"https://ror.org/000e0be47","country_code":"US","type":"education","lineage":["https://openalex.org/I111979921"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"T. M. Caldwell","raw_affiliation_strings":["Department of Mechanical Engineering, Northwestern University, Evanston, IL, USA","[Dept. of Mech. Eng., Northwestern Univ., Evanston, IL, USA]"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Mechanical Engineering, Northwestern University, Evanston, IL, USA","institution_ids":["https://openalex.org/I111979921"]},{"raw_affiliation_string":"[Dept. of Mech. Eng., Northwestern Univ., Evanston, IL, USA]","institution_ids":["https://openalex.org/I111979921"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5067725461","display_name":"Todd D. Murphey","orcid":"https://orcid.org/0000-0003-2262-8176"},"institutions":[{"id":"https://openalex.org/I111979921","display_name":"Northwestern University","ror":"https://ror.org/000e0be47","country_code":"US","type":"education","lineage":["https://openalex.org/I111979921"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"T. D. Murphey","raw_affiliation_strings":["Department of Mechanical Engineering, Northwestern University, Evanston, IL, USA","[Dept. of Mech. Eng., Northwestern Univ., Evanston, IL, USA]"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Mechanical Engineering, Northwestern University, Evanston, IL, USA","institution_ids":["https://openalex.org/I111979921"]},{"raw_affiliation_string":"[Dept. of Mech. Eng., Northwestern Univ., Evanston, IL, USA]","institution_ids":["https://openalex.org/I111979921"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I111979921"],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":14,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":"14","issue":null,"first_page":"5307","last_page":"5314"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11248","display_name":"Advanced Power Amplifier Design","score":0.9970999956130981,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic 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/T11248","display_name":"Advanced Power Amplifier Design","score":0.9970999956130981,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic 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/T11233","display_name":"Advanced Adaptive Filtering Techniques","score":0.9959999918937683,"subfield":{"id":"https://openalex.org/subfields/2206","display_name":"Computational Mechanics"},"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/T11034","display_name":"Digital Filter Design and Implementation","score":0.982699990272522,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"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.6717959642410278},{"id":"https://openalex.org/keywords/line-search","display_name":"Line search","score":0.6667472720146179},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5425158143043518},{"id":"https://openalex.org/keywords/gradient-descent","display_name":"Gradient descent","score":0.5370655655860901},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.5180768966674805},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.474099725484848},{"id":"https://openalex.org/keywords/convergence","display_name":"Convergence (economics)","score":0.46840542554855347},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.45761293172836304},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4468987286090851},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.42631787061691284},{"id":"https://openalex.org/keywords/quadratic-equation","display_name":"Quadratic equation","score":0.41608214378356934},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3691442906856537},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.3559585213661194},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.06312784552574158}],"concepts":[{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6717959642410278},{"id":"https://openalex.org/C85522705","wikidata":"https://www.wikidata.org/wiki/Q3278015","display_name":"Line search","level":3,"score":0.6667472720146179},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5425158143043518},{"id":"https://openalex.org/C153258448","wikidata":"https://www.wikidata.org/wiki/Q1199743","display_name":"Gradient descent","level":3,"score":0.5370655655860901},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.5180768966674805},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.474099725484848},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.46840542554855347},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.45761293172836304},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4468987286090851},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.42631787061691284},{"id":"https://openalex.org/C129844170","wikidata":"https://www.wikidata.org/wiki/Q41299","display_name":"Quadratic equation","level":2,"score":0.41608214378356934},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3691442906856537},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.3559585213661194},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.06312784552574158},{"id":"https://openalex.org/C178635117","wikidata":"https://www.wikidata.org/wiki/Q747499","display_name":"RADIUS","level":2,"score":0.0},{"id":"https://openalex.org/C50644808","wikidata":"https://www.wikidata.org/wiki/Q192776","display_name":"Artificial neural network","level":2,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","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/C50522688","wikidata":"https://www.wikidata.org/wiki/Q189833","display_name":"Economic growth","level":1,"score":0.0},{"id":"https://openalex.org/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","level":1,"score":0.0},{"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/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/cdc.2013.6760724","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cdc.2013.6760724","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"52nd IEEE Conference on Decision and Control","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":25,"referenced_works":["https://openalex.org/W54906651","https://openalex.org/W1537335979","https://openalex.org/W1967823050","https://openalex.org/W1969811075","https://openalex.org/W1973235087","https://openalex.org/W1999484566","https://openalex.org/W2000975219","https://openalex.org/W2003225665","https://openalex.org/W2020203738","https://openalex.org/W2035618967","https://openalex.org/W2048922416","https://openalex.org/W2059276961","https://openalex.org/W2067480733","https://openalex.org/W2068171188","https://openalex.org/W2069552136","https://openalex.org/W2071473360","https://openalex.org/W2102347640","https://openalex.org/W2121310282","https://openalex.org/W2148599741","https://openalex.org/W2151740611","https://openalex.org/W2172012981","https://openalex.org/W3029645440","https://openalex.org/W4300448178","https://openalex.org/W6650404023","https://openalex.org/W6682291270"],"related_works":["https://openalex.org/W2970302286","https://openalex.org/W2810352541","https://openalex.org/W3080334989","https://openalex.org/W2142195909","https://openalex.org/W4226095963","https://openalex.org/W2366552965","https://openalex.org/W2372778757","https://openalex.org/W4377090276","https://openalex.org/W2364567920","https://openalex.org/W1994778783"],"abstract_inverted_index":{"This":[0],"paper":[1],"develops":[2],"an":[3],"iterative":[4],"optimization":[5,136],"technique":[6],"that":[7,24,64,79],"can":[8],"be":[9],"applied":[10],"to":[11,71,91,133],"mode":[12,19,25,87],"scheduling.":[13],"The":[14],"algorithm":[15,32,137],"provides":[16],"both":[17],"a":[18,36,59,76,105],"schedule":[20,26],"and":[21,39,68,99,138],"timing":[22],"of":[23,35,42,108,114],"with":[27],"convergence":[28,97],"guarantees.":[29],"Moreover,":[30],"the":[31,40,45,56,81,86,96,109,112,115,124,131,135],"takes":[33,65],"advantage":[34],"line":[37,46],"search,":[38],"number":[41],"iterations":[43],"in":[44,55,111],"search":[47,116],"is":[48,62,83,122],"bounded.":[49],"There":[50],"are":[51],"two":[52],"key":[53],"ingredients":[54],"algorithm.":[57],"First,":[58],"projection":[60,82],"operation":[61],"used":[63],"arbitrary":[66],"curves":[67],"maps":[69],"them":[70],"feasible":[72],"switching":[73],"controls.":[74],"Second,":[75],"descent":[77],"direction":[78,113],"incorporates":[80],"calculated":[84],"using":[85],"insertion":[88],"gradient.":[89],"Similar":[90],"derivative-based":[92],"finite":[93],"dimensional":[94],"optimization,":[95],"guarantees":[98],"sufficient":[100],"decrease":[101],"criteria":[102],"follow":[103],"from":[104],"local":[106,120],"approximation":[107,121],"cost":[110],"direction,":[117],"but":[118],"this":[119],"not":[123],"standard":[125],"quadratic":[126],"approximation.":[127],"An":[128],"example":[129],"demonstrates":[130],"steps":[132],"implement":[134],"illustrates":[139],"convergence.":[140]},"counts_by_year":[{"year":2020,"cited_by_count":3},{"year":2018,"cited_by_count":3},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":3},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":1}],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}