{"id":"https://openalex.org/W2040939999","doi":"https://doi.org/10.1142/s012905410900708x","title":"PREEMPTIVE SCHEDULING ALGORITHMS WITH NESTED PROCESSING SET RESTRICTION","display_name":"PREEMPTIVE SCHEDULING ALGORITHMS WITH NESTED PROCESSING SET RESTRICTION","publication_year":2009,"publication_date":"2009-11-22","ids":{"openalex":"https://openalex.org/W2040939999","doi":"https://doi.org/10.1142/s012905410900708x","mag":"2040939999"},"language":"en","primary_location":{"id":"doi:10.1142/s012905410900708x","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s012905410900708x","pdf_url":null,"source":{"id":"https://openalex.org/S68047077","display_name":"International Journal of Foundations of Computer Science","issn_l":"0129-0541","issn":["0129-0541","1793-6373"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Foundations of Computer Science","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/A5055734882","display_name":"Yumei Huo","orcid":"https://orcid.org/0000-0003-3550-8843"},"institutions":[{"id":"https://openalex.org/I142393192","display_name":"College of Staten Island","ror":"https://ror.org/02p179j44","country_code":"US","type":"education","lineage":["https://openalex.org/I142393192"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"YUMEI HUO","raw_affiliation_strings":["Department of Computer Science, CUNY at Staten Island, Staten Island, NY 10314, USA"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, CUNY at Staten Island, Staten Island, NY 10314, USA","institution_ids":["https://openalex.org/I142393192"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5108400400","display_name":"Joseph Y.\u2010T. Leung","orcid":null},"institutions":[{"id":"https://openalex.org/I118118575","display_name":"New Jersey Institute of Technology","ror":"https://ror.org/05e74xb87","country_code":"US","type":"education","lineage":["https://openalex.org/I118118575"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"JOSEPH Y.-T. LEUNG","raw_affiliation_strings":["Department of Computer Science, New Jersey Institute of Technology, Newark, NJ 07102, USA","Department of Computer Science, New Jersey Institute of Technology, Newark, NJ 07102. USA"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, New Jersey Institute of Technology, Newark, NJ 07102, USA","institution_ids":["https://openalex.org/I118118575"]},{"raw_affiliation_string":"Department of Computer Science, New Jersey Institute of Technology, Newark, NJ 07102. USA","institution_ids":["https://openalex.org/I118118575"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5100327945","display_name":"Xin Wang","orcid":"https://orcid.org/0000-0002-4315-1867"},"institutions":[{"id":"https://openalex.org/I1299907687","display_name":"Bloomberg (United States)","ror":"https://ror.org/02rdpzb15","country_code":"US","type":"company","lineage":["https://openalex.org/I1299907687"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"XIN WANG","raw_affiliation_strings":["R&D Department, Bloomberg L.P., 731 Lexington Ave. New York, NY 10022, USA"],"affiliations":[{"raw_affiliation_string":"R&D Department, Bloomberg L.P., 731 Lexington Ave. New York, NY 10022, USA","institution_ids":["https://openalex.org/I1299907687"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5055734882"],"corresponding_institution_ids":["https://openalex.org/I142393192"],"apc_list":null,"apc_paid":null,"fwci":1.5007,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.85287134,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"20","issue":"06","first_page":"1147","last_page":"1160"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10551","display_name":"Scheduling and Optimization Algorithms","score":1.0,"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":1.0,"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.9994000196456909,"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/T12176","display_name":"Optimization and Packing Problems","score":0.9955999851226807,"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/job-shop-scheduling","display_name":"Job shop scheduling","score":0.6650494933128357},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6019308567047119},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.5919678807258606},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.5372061729431152},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5328450798988342},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5185145139694214},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.44960102438926697},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.425630658864975},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.1528608798980713}],"concepts":[{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.6650494933128357},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6019308567047119},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5919678807258606},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.5372061729431152},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5328450798988342},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5185145139694214},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.44960102438926697},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.425630658864975},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.1528608798980713},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1142/s012905410900708x","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s012905410900708x","pdf_url":null,"source":{"id":"https://openalex.org/S68047077","display_name":"International Journal of Foundations of Computer Science","issn_l":"0129-0541","issn":["0129-0541","1793-6373"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Foundations of Computer Science","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Decent work and economic growth","id":"https://metadata.un.org/sdg/8","score":0.5400000214576721}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":16,"referenced_works":["https://openalex.org/W85650009","https://openalex.org/W639071292","https://openalex.org/W1488422606","https://openalex.org/W1965437596","https://openalex.org/W1976344941","https://openalex.org/W2011039300","https://openalex.org/W2019300924","https://openalex.org/W2052586468","https://openalex.org/W2058817479","https://openalex.org/W2064294745","https://openalex.org/W2072712212","https://openalex.org/W2077500752","https://openalex.org/W2082631305","https://openalex.org/W2088171871","https://openalex.org/W2102201348","https://openalex.org/W2156978792"],"related_works":["https://openalex.org/W3172150420","https://openalex.org/W2107725657","https://openalex.org/W2112121444","https://openalex.org/W2509452605","https://openalex.org/W3112689649","https://openalex.org/W2148608945","https://openalex.org/W2101020326","https://openalex.org/W2808535280","https://openalex.org/W3122821775","https://openalex.org/W3204654320"],"abstract_inverted_index":{"We":[0,114,127],"consider":[1],"the":[2,62,112],"problem":[3],"of":[4,50,65],"preemptively":[5],"scheduling":[6],"n":[7,18,133],"independent":[8],"jobs":[9],"{J":[10],"1":[11,25],",":[12,15,26,29],"J":[13,17,37,66],"2":[14,28],"\u2026,":[16,30],"}":[19],"on":[20,43],"m":[21,32],"parallel":[22],"machines":[23,51,57],"{M":[24],"M":[27,31],"},":[33],"where":[34,142],"each":[35],"job":[36],"j":[38,67,75,78],"can":[39],"only":[40],"be":[41,148],"processed":[42],"a":[44,74,139,143],"prespecified":[45],"subset":[46],"[Formula:":[47,81,96,100,104],"see":[48,82,97,101,105],"text]":[49],"called":[52],"its":[53],"processing":[54,63,85],"set.":[55],"The":[56,84],"are":[58,87],"linearly":[59],"ordered,":[60],"and":[61,76],"set":[64],"is":[68,109,145],"specified":[69],"by":[70],"two":[71],"machine":[72],"indexes":[73],"b":[77],";":[79],"i.e.,":[80,89],"text].":[83,106],"sets":[86],"nested;":[88],"for":[90],"i":[91],"\u2260":[92],"j,":[93],"we":[94],"have":[95],"text],":[98,102],"or":[99,103],"Our":[107],"goal":[108],"to":[110,122,137,147],"minimize":[111],"makespan.":[113],"first":[115],"give":[116,129],"an":[117,124,130],"O(n":[118],"log":[119,134],"n)-time":[120,135],"algorithm":[121,136],"find":[123,138],"optimal":[125],"schedule.":[126],"then":[128],"O(mn":[131],"+":[132],"maximal":[140,149],"schedule,":[141],"schedule":[144,159],"said":[146],"if":[150],"it":[151],"processes":[152],"as":[153,156],"much":[154],"work":[155],"any":[157,161],"other":[158],"in":[160],"time":[162],"interval":[163],"[0,":[164],"t],":[165],"t":[166],">":[167],"0.":[168]},"counts_by_year":[{"year":2016,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}