{"id":"https://openalex.org/W2075889702","doi":"https://doi.org/10.1137/0207031","title":"Complexity of Task Sequencing with Deadlines, Set-Up Times and Changeover Costs","display_name":"Complexity of Task Sequencing with Deadlines, Set-Up Times and Changeover Costs","publication_year":1978,"publication_date":"1978-11-01","ids":{"openalex":"https://openalex.org/W2075889702","doi":"https://doi.org/10.1137/0207031","mag":"2075889702"},"language":"en","primary_location":{"id":"doi:10.1137/0207031","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0207031","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-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/A5109919265","display_name":"John Bruno","orcid":"https://orcid.org/0009-0003-8003-8331"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"John Bruno","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5050484157","display_name":"Peter J. Downey","orcid":"https://orcid.org/0000-0001-6902-4455"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Peter Downey","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.9771,"has_fulltext":false,"cited_by_count":148,"citation_normalized_percentile":{"value":0.87182362,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"7","issue":"4","first_page":"393","last_page":"404"},"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/T12288","display_name":"Optimization and Search Problems","score":0.9970999956130981,"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.9837999939918518,"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.8713036179542542},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.6523371934890747},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.6092537641525269},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6023144721984863},{"id":"https://openalex.org/keywords/task","display_name":"Task (project management)","score":0.5712544322013855},{"id":"https://openalex.org/keywords/class","display_name":"Class (philosophy)","score":0.5687355995178223},{"id":"https://openalex.org/keywords/polynomial","display_name":"Polynomial","score":0.5552718043327332},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.4695988893508911},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.36783936619758606},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3289431631565094},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.32572120428085327},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.27802184224128723},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.14065435528755188},{"id":"https://openalex.org/keywords/transmission","display_name":"Transmission (telecommunications)","score":0.07866382598876953}],"concepts":[{"id":"https://openalex.org/C2780129190","wikidata":"https://www.wikidata.org/wiki/Q5071912","display_name":"Changeover","level":3,"score":0.8713036179542542},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.6523371934890747},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.6092537641525269},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6023144721984863},{"id":"https://openalex.org/C2780451532","wikidata":"https://www.wikidata.org/wiki/Q759676","display_name":"Task (project management)","level":2,"score":0.5712544322013855},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.5687355995178223},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.5552718043327332},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.4695988893508911},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.36783936619758606},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3289431631565094},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.32572120428085327},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.27802184224128723},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.14065435528755188},{"id":"https://openalex.org/C761482","wikidata":"https://www.wikidata.org/wiki/Q118093","display_name":"Transmission (telecommunications)","level":2,"score":0.07866382598876953},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"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/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C187736073","wikidata":"https://www.wikidata.org/wiki/Q2920921","display_name":"Management","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/0207031","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0207031","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.4000000059604645,"display_name":"Decent work and economic growth","id":"https://metadata.un.org/sdg/8"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":7,"referenced_works":["https://openalex.org/W634463279","https://openalex.org/W1655990431","https://openalex.org/W1973289176","https://openalex.org/W1988931160","https://openalex.org/W2009990213","https://openalex.org/W2125690626","https://openalex.org/W2401610261"],"related_works":["https://openalex.org/W4386286239","https://openalex.org/W1521548618","https://openalex.org/W2276786401","https://openalex.org/W1488306886","https://openalex.org/W1578235985","https://openalex.org/W62059400","https://openalex.org/W2176689235","https://openalex.org/W1589381382","https://openalex.org/W961142965","https://openalex.org/W1774334694"],"abstract_inverted_index":{"In":[0],"this":[1],"paper":[2],"we":[3],"consider":[4,36],"the":[5,37,47,55],"problem":[6],"of":[7,10,39,54,76],"sequencing":[8],"classes":[9],"tasks":[11,29],"with":[12,26],"deadlines":[13],"in":[14,30],"which":[15],"there":[16],"is":[17,58],"a":[18,22,40],"set-up":[19],"time":[20,63,66,70],"or":[21],"changeover":[23],"cost":[24],"associated":[25],"switching":[27],"from":[28],"one":[31],"class":[32],"to":[33],"another.":[34],"We":[35],"case":[38],"single":[41],"machine":[42],"and":[43,51,68],"our":[44],"results":[45],"delineate":[46],"borderline":[48],"between":[49],"polynomial-solvable":[50],"$NP$-complete":[52],"versions":[53],"problem.":[56],"This":[57],"accomplished":[59],"by":[60],"giving":[61],"polynomial":[62,69],"reductions,":[64],"pseudo-polynomial":[65],"algorithms":[67,71],"for":[72],"various":[73],"restricted":[74],"cases":[75],"these":[77],"problems.":[78]},"counts_by_year":[{"year":2026,"cited_by_count":2},{"year":2025,"cited_by_count":6},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":4},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":3},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":3},{"year":2012,"cited_by_count":4}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}