{"id":"https://openalex.org/W2121012222","doi":"https://doi.org/10.1287/opre.38.3.456","title":"A Strong Cutting Plane Algorithm for Production Scheduling with Changeover Costs","display_name":"A Strong Cutting Plane Algorithm for Production Scheduling with Changeover Costs","publication_year":1990,"publication_date":"1990-06-01","ids":{"openalex":"https://openalex.org/W2121012222","doi":"https://doi.org/10.1287/opre.38.3.456","mag":"2121012222"},"language":"en","primary_location":{"id":"doi:10.1287/opre.38.3.456","is_oa":false,"landing_page_url":"https://doi.org/10.1287/opre.38.3.456","pdf_url":null,"source":{"id":"https://openalex.org/S125775545","display_name":"Operations Research","issn_l":"0030-364X","issn":["0030-364X","1526-5463"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310315699","host_organization_name":"Institute for Operations Research and the Management Sciences","host_organization_lineage":["https://openalex.org/P4310315699"],"host_organization_lineage_names":["Institute for Operations Research and the Management Sciences"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Operations Research","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"http://hdl.handle.net/1721.1/5192","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5023919615","display_name":"Thomas L. Magnanti","orcid":"https://orcid.org/0000-0002-0771-3850"},"institutions":[{"id":"https://openalex.org/I63966007","display_name":"Massachusetts Institute of Technology","ror":"https://ror.org/042nb2s44","country_code":"US","type":"education","lineage":["https://openalex.org/I63966007"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"T. L. Magnanti","raw_affiliation_strings":["Massachusetts Institute of Technology, Cambridge, Massachusetts","Massachusetts Institute of Technology, Cambridge, Massachusetts#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Massachusetts Institute of Technology, Cambridge, Massachusetts","institution_ids":["https://openalex.org/I63966007"]},{"raw_affiliation_string":"Massachusetts Institute of Technology, Cambridge, Massachusetts#TAB#","institution_ids":["https://openalex.org/I63966007"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5059927315","display_name":"Rita Vachani","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"R. Vachani","raw_affiliation_strings":["GTE Laboratories, Waltham, Massachusetts","GTE Laboratories, Waltham, Massachusetts#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"GTE Laboratories, Waltham, Massachusetts","institution_ids":[]},{"raw_affiliation_string":"GTE Laboratories, Waltham, Massachusetts#TAB#","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":11.4733,"has_fulltext":false,"cited_by_count":92,"citation_normalized_percentile":{"value":0.98678149,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"38","issue":"3","first_page":"456","last_page":"473"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9998000264167786,"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.9998000264167786,"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/T12176","display_name":"Optimization and Packing Problems","score":0.9994000196456909,"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.9980000257492065,"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/changeover","display_name":"Changeover","score":0.951648473739624},{"id":"https://openalex.org/keywords/integer-programming","display_name":"Integer programming","score":0.7304359674453735},{"id":"https://openalex.org/keywords/cutting-plane-method","display_name":"Cutting-plane method","score":0.730417013168335},{"id":"https://openalex.org/keywords/linear-programming-relaxation","display_name":"Linear programming relaxation","score":0.6836311221122742},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6507794260978699},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6143178343772888},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.585296094417572},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.5577681660652161},{"id":"https://openalex.org/keywords/branch-and-cut","display_name":"Branch and cut","score":0.5486801266670227},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.5408227443695068},{"id":"https://openalex.org/keywords/branch-and-bound","display_name":"Branch and bound","score":0.5175037384033203},{"id":"https://openalex.org/keywords/product","display_name":"Product (mathematics)","score":0.41723230481147766},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.398994505405426},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.29944199323654175}],"concepts":[{"id":"https://openalex.org/C2780129190","wikidata":"https://www.wikidata.org/wiki/Q5071912","display_name":"Changeover","level":3,"score":0.951648473739624},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.7304359674453735},{"id":"https://openalex.org/C109839438","wikidata":"https://www.wikidata.org/wiki/Q1762039","display_name":"Cutting-plane method","level":3,"score":0.730417013168335},{"id":"https://openalex.org/C25360446","wikidata":"https://www.wikidata.org/wiki/Q1512771","display_name":"Linear programming relaxation","level":3,"score":0.6836311221122742},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6507794260978699},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6143178343772888},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.585296094417572},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.5577681660652161},{"id":"https://openalex.org/C50797617","wikidata":"https://www.wikidata.org/wiki/Q498566","display_name":"Branch and cut","level":3,"score":0.5486801266670227},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5408227443695068},{"id":"https://openalex.org/C93693863","wikidata":"https://www.wikidata.org/wiki/Q897659","display_name":"Branch and bound","level":2,"score":0.5175037384033203},{"id":"https://openalex.org/C90673727","wikidata":"https://www.wikidata.org/wiki/Q901718","display_name":"Product (mathematics)","level":2,"score":0.41723230481147766},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.398994505405426},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.29944199323654175},{"id":"https://openalex.org/C761482","wikidata":"https://www.wikidata.org/wiki/Q118093","display_name":"Transmission (telecommunications)","level":2,"score":0.0},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1287/opre.38.3.456","is_oa":false,"landing_page_url":"https://doi.org/10.1287/opre.38.3.456","pdf_url":null,"source":{"id":"https://openalex.org/S125775545","display_name":"Operations Research","issn_l":"0030-364X","issn":["0030-364X","1526-5463"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310315699","host_organization_name":"Institute for Operations Research and the Management Sciences","host_organization_lineage":["https://openalex.org/P4310315699"],"host_organization_lineage_names":["Institute for Operations Research and the Management Sciences"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Operations Research","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.1027.3572","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.1027.3572","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://dspace.mit.edu/bitstream/handle/1721.1/5192/OR-173-87.pdf%3Bjsessionid%3D60ECA814C6115B4D569B1BF850417548?sequence%3D1","raw_type":"text"},{"id":"pmh:oai:RePEc:inm:oropre:v:38:y:1990:i:3:p:456-473","is_oa":false,"landing_page_url":"http://doi.org/10.1287/opre.38.3.456","pdf_url":null,"source":{"id":"https://openalex.org/S4306401271","display_name":"RePEc: Research Papers in Economics","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I77793887","host_organization_name":"Federal Reserve Bank of St. Louis","host_organization_lineage":["https://openalex.org/I77793887"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"article"},{"id":"pmh:oai:dspace.mit.edu:1721.1/5192","is_oa":true,"landing_page_url":"http://hdl.handle.net/1721.1/5192","pdf_url":null,"source":{"id":"https://openalex.org/S4306400425","display_name":"DSpace@MIT (Massachusetts Institute of Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I63966007","host_organization_name":"Massachusetts Institute of Technology","host_organization_lineage":["https://openalex.org/I63966007"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by-nc","license_id":"https://openalex.org/licenses/cc-by-nc","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Working Paper"}],"best_oa_location":{"id":"pmh:oai:dspace.mit.edu:1721.1/5192","is_oa":true,"landing_page_url":"http://hdl.handle.net/1721.1/5192","pdf_url":null,"source":{"id":"https://openalex.org/S4306400425","display_name":"DSpace@MIT (Massachusetts Institute of Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I63966007","host_organization_name":"Massachusetts Institute of Technology","host_organization_lineage":["https://openalex.org/I63966007"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by-nc","license_id":"https://openalex.org/licenses/cc-by-nc","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Working Paper"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":38,"referenced_works":["https://openalex.org/W5720473","https://openalex.org/W420657877","https://openalex.org/W1490971968","https://openalex.org/W1973289176","https://openalex.org/W1978881230","https://openalex.org/W1983449598","https://openalex.org/W1988931160","https://openalex.org/W2002589450","https://openalex.org/W2012329067","https://openalex.org/W2018198126","https://openalex.org/W2018206767","https://openalex.org/W2019590415","https://openalex.org/W2054623195","https://openalex.org/W2055213643","https://openalex.org/W2060960395","https://openalex.org/W2063682953","https://openalex.org/W2072193992","https://openalex.org/W2078140282","https://openalex.org/W2079462220","https://openalex.org/W2081055047","https://openalex.org/W2083601726","https://openalex.org/W2097115813","https://openalex.org/W2098189488","https://openalex.org/W2103263531","https://openalex.org/W2107474910","https://openalex.org/W2108303241","https://openalex.org/W2114552889","https://openalex.org/W2120583150","https://openalex.org/W2135631877","https://openalex.org/W2139211712","https://openalex.org/W2145614148","https://openalex.org/W2167539320","https://openalex.org/W2260470032","https://openalex.org/W2315902205","https://openalex.org/W2317314744","https://openalex.org/W2325663341","https://openalex.org/W2400100617","https://openalex.org/W2912533262"],"related_works":["https://openalex.org/W2009796757","https://openalex.org/W1531708257","https://openalex.org/W2387389269","https://openalex.org/W2109445739","https://openalex.org/W2568448495","https://openalex.org/W2024753861","https://openalex.org/W3162501176","https://openalex.org/W2110818895","https://openalex.org/W134055995","https://openalex.org/W566167518"],"abstract_inverted_index":{"Changeover":[0],"costs":[1,11],"(and":[2,90],"times)":[3],"are":[4],"central":[5],"to":[6,32,39,50,87,92,137],"numerous":[7],"manufacturing":[8],"operations.":[9],"These":[10,139],"arise":[12],"whenever":[13],"work":[14],"centers":[15],"capable":[16],"of":[17,29,42,78,104,119,124,135,144,179],"processing":[18],"only":[19],"one":[20,30,86],"product":[21,31,160],"at":[22],"a":[23,75,102,133,145,151,155,158,167,177],"time":[24,175],"switch":[25],"from":[26,71],"the":[27,40,51,79,114,117,125,142],"manufacture":[28],"another.":[33],"Although":[34],"many":[35],"researchers":[36],"have":[37,57],"contributed":[38],"solution":[41,152],"scheduling":[43],"problems":[44,84],"that":[45,97],"include":[46],"changeover":[47],"costs,":[48],"due":[49],"problem's":[52],"combinatorial":[53],"explosiveness,":[54],"optimization-based":[55],"methods":[56,70,99],"met":[58],"with":[59,83,157,166],"limited":[60],"success.":[61],"In":[62,154],"this":[63,109,162],"paper,":[64],"we":[65],"develop":[66],"and":[67,127],"apply":[68],"polyhedral":[69,98],"integer":[72,94,121],"programming":[73,122,130],"for":[74],"dynamic":[76],"version":[77],"problem.":[80],"Computational":[81],"tests":[82],"containing":[85],"five":[88,159],"products":[89],"up":[91],"225":[93],"variables)":[95],"show":[96],"based":[100],"upon":[101],"set":[103],"facet":[105],"inequalities":[106],"developed":[107],"in":[108],"paper":[110],"can":[111],"effectively":[112],"reduce":[113],"gap":[115],"between":[116],"value":[118],"an":[120],"formulation":[123],"problem":[126],"its":[128],"linear":[129,169],"relaxation":[131],"(by":[132],"factor":[134,178],"94":[136],"100%).":[138],"results":[140],"suggest":[141],"use":[143],"combined":[146],"cutting":[147],"plane/branch-and-bound":[148],"procedure":[149],"as":[150],"approach.":[153],"test":[156],"problem,":[161],"procedure,":[163],"when":[164],"compared":[165],"standard":[168],"programming-based":[170],"branch-and-bound":[171],"approach,":[172],"reduced":[173],"computation":[174],"by":[176],"seven.":[180]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":2},{"year":2022,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":2},{"year":2013,"cited_by_count":2}],"updated_date":"2026-08-12T21:12:35.861297","created_date":"2025-10-10T00:00:00"}