{"id":"https://openalex.org/W2001364911","doi":"https://doi.org/10.1137/0206029","title":"Two-Processor Scheduling with Start-Times and Deadlines","display_name":"Two-Processor Scheduling with Start-Times and Deadlines","publication_year":1977,"publication_date":"1977-09-01","ids":{"openalex":"https://openalex.org/W2001364911","doi":"https://doi.org/10.1137/0206029","mag":"2001364911"},"language":"en","primary_location":{"id":"doi:10.1137/0206029","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0206029","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/A5047995033","display_name":"M. R. Garey","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"M. R. Garey","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5110866131","display_name":"David S. Johnson","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"D. S. Johnson","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5047995033"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":20.2468,"has_fulltext":false,"cited_by_count":236,"citation_normalized_percentile":{"value":0.99223947,"is_in_top_1_percent":true,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":94,"max":99},"biblio":{"volume":"6","issue":"3","first_page":"416","last_page":"426"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9997000098228455,"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.9997000098228455,"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.9955999851226807,"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/T10715","display_name":"Distributed and Parallel Computing Systems","score":0.9894000291824341,"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/tardiness","display_name":"Tardiness","score":0.7104343175888062},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.6915514469146729},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6747551560401917},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.5582728981971741},{"id":"https://openalex.org/keywords/task","display_name":"Task (project management)","score":0.45979732275009155},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.45004165172576904},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.4470081031322479},{"id":"https://openalex.org/keywords/integer","display_name":"Integer (computer science)","score":0.4337460398674011},{"id":"https://openalex.org/keywords/preemption","display_name":"Preemption","score":0.4132063388824463},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.3998505473136902},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.3469943404197693},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.32312309741973877},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.31406742334365845},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.07324251532554626},{"id":"https://openalex.org/keywords/operating-system","display_name":"Operating system","score":0.06409621238708496}],"concepts":[{"id":"https://openalex.org/C2778047078","wikidata":"https://www.wikidata.org/wiki/Q82299449","display_name":"Tardiness","level":4,"score":0.7104343175888062},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.6915514469146729},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6747551560401917},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5582728981971741},{"id":"https://openalex.org/C2780451532","wikidata":"https://www.wikidata.org/wiki/Q759676","display_name":"Task (project management)","level":2,"score":0.45979732275009155},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.45004165172576904},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.4470081031322479},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.4337460398674011},{"id":"https://openalex.org/C206952183","wikidata":"https://www.wikidata.org/wiki/Q1193100","display_name":"Preemption","level":2,"score":0.4132063388824463},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3998505473136902},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.3469943404197693},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.32312309741973877},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.31406742334365845},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.07324251532554626},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.06409621238708496},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"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":2,"locations":[{"id":"doi:10.1137/0206029","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0206029","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"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.134.6468","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.134.6468","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.utdallas.edu/~miaohua/Research/TwoPSchedulingStartTime_Garey77.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":12,"referenced_works":["https://openalex.org/W100926944","https://openalex.org/W1655990431","https://openalex.org/W1973538756","https://openalex.org/W1976306508","https://openalex.org/W2020299050","https://openalex.org/W2057392949","https://openalex.org/W2070992781","https://openalex.org/W2092333800","https://openalex.org/W2095381673","https://openalex.org/W2104734478","https://openalex.org/W2157846217","https://openalex.org/W2401610261"],"related_works":["https://openalex.org/W2061005265","https://openalex.org/W1978754971","https://openalex.org/W2159431873","https://openalex.org/W2563877583","https://openalex.org/W4296962586","https://openalex.org/W2047571228","https://openalex.org/W1964216218","https://openalex.org/W2785512376","https://openalex.org/W4200341649","https://openalex.org/W2078421576"],"abstract_inverted_index":{"Given":[0],"a":[1,28,49,76,88,101],"set":[2],"$\\mathcal{T}":[3],"=":[4],"\\{":[5],"T_1":[6],",T_2":[7],",":[8],"\\cdots":[9],",T_n":[10],"\\}":[11],"$":[12],"of":[13,44,109,112],"tasks,":[14,39],"each":[15,57],"$T_i$":[16],"having":[17],"execution":[18],"time":[19,61],"1,":[20],"an":[21,70],"integer":[22],"start-time":[23,65],"$s_i":[24],"\\geqq":[25],"0$":[26],"and":[27,66,121],"deadline":[29],"$d_i":[30],">":[31],"0$,":[32],"along":[33],"with":[34],"precedence":[35],"constraints":[36],"among":[37],"the":[38,42,60,94],"we":[40],"examine":[41],"problem":[43,114],"determining":[45],"whether":[46],"there":[47],"exists":[48],"schedule":[50,77,97,102],"on":[51],"two":[52],"identical":[53],"processors":[54],"that":[55,73,103],"executes":[56],"task":[58],"in":[59,87],"interval":[62],"between":[63],"its":[64],"deadline.":[67],"We":[68],"present":[69],"$O(n^3)$":[71],"algorithm":[72,82],"constructs":[74],"such":[75,96],"whenever":[78],"one":[79],"exists.":[80],"The":[81],"may":[83],"also":[84],"be":[85,118],"used":[86],"binary":[89],"search":[90],"mode":[91],"to":[92,99,117],"find":[93,100],"shortest":[95],"or":[98],"minimizes":[104],"maximum":[105],"\u201ctardiness\u201d.":[106],"A":[107],"number":[108],"natural":[110],"extensions":[111],"this":[113],"are":[115],"seen":[116],"$NP$":[119],"complete":[120],"hence":[122],"probably":[123],"intractable.":[124]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":3},{"year":2024,"cited_by_count":3},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":4},{"year":2021,"cited_by_count":6},{"year":2020,"cited_by_count":4},{"year":2019,"cited_by_count":3},{"year":2018,"cited_by_count":10},{"year":2017,"cited_by_count":9},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":6},{"year":2014,"cited_by_count":4},{"year":2013,"cited_by_count":3},{"year":2012,"cited_by_count":5}],"updated_date":"2026-04-09T08:11:56.329763","created_date":"2025-10-10T00:00:00"}