{"id":"https://openalex.org/W2080665447","doi":"https://doi.org/10.1142/s0129054194000141","title":"HEURISTIC FOR MINIMIZING THE NUMBER OF LATE JOBS ON TWO PROCESSORS","display_name":"HEURISTIC FOR MINIMIZING THE NUMBER OF LATE JOBS ON TWO PROCESSORS","publication_year":1994,"publication_date":"1994-12-01","ids":{"openalex":"https://openalex.org/W2080665447","doi":"https://doi.org/10.1142/s0129054194000141","mag":"2080665447"},"language":"en","primary_location":{"id":"doi:10.1142/s0129054194000141","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0129054194000141","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/A5108400400","display_name":"Joseph Y.\u2010T. Leung","orcid":null},"institutions":[{"id":"https://openalex.org/I114395901","display_name":"University of Nebraska\u2013Lincoln","ror":"https://ror.org/043mer456","country_code":"US","type":"education","lineage":["https://openalex.org/I114395901"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"JOSEPH Y-T. LEUNG","raw_affiliation_strings":["Department of Computer Science and Engineering,  University of Nebraska-Lincoln, Lincoln, NE 68588\u20130115, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Engineering,  University of Nebraska-Lincoln, Lincoln, NE 68588\u20130115, USA","institution_ids":["https://openalex.org/I114395901"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5009049254","display_name":"Vincent K.M. Yu","orcid":null},"institutions":[{"id":"https://openalex.org/I114395901","display_name":"University of Nebraska\u2013Lincoln","ror":"https://ror.org/043mer456","country_code":"US","type":"education","lineage":["https://openalex.org/I114395901"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"VINCENT K.M. YU","raw_affiliation_strings":["Department of Computer Science and Engineering,  University of Nebraska-Lincoln, Lincoln, NE 68588\u20130115, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Engineering,  University of Nebraska-Lincoln, Lincoln, NE 68588\u20130115, USA","institution_ids":["https://openalex.org/I114395901"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":8,"citation_normalized_percentile":{"value":0.2680624,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":95},"biblio":{"volume":"05","issue":"03n04","first_page":"261","last_page":"279"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9987999796867371,"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.9987999796867371,"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/T10829","display_name":"Interconnection Networks and Systems","score":0.9965999722480774,"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.9919000267982483,"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/heuristic","display_name":"Heuristic","score":0.666558027267456},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.6382066011428833},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.6370550394058228},{"id":"https://openalex.org/keywords/multiprocessor-scheduling","display_name":"Multiprocessor scheduling","score":0.6345561742782593},{"id":"https://openalex.org/keywords/multiprocessing","display_name":"Multiprocessing","score":0.629081666469574},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.6242713928222656},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5980875492095947},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5590084195137024},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.485113263130188},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.4723922908306122},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.3860706388950348},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.38453492522239685},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3588823676109314},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.35073667764663696},{"id":"https://openalex.org/keywords/flow-shop-scheduling","display_name":"Flow shop scheduling","score":0.1124739944934845}],"concepts":[{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.666558027267456},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.6382066011428833},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.6370550394058228},{"id":"https://openalex.org/C85924588","wikidata":"https://www.wikidata.org/wiki/Q107419135","display_name":"Multiprocessor scheduling","level":5,"score":0.6345561742782593},{"id":"https://openalex.org/C4822641","wikidata":"https://www.wikidata.org/wiki/Q846651","display_name":"Multiprocessing","level":2,"score":0.629081666469574},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.6242713928222656},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5980875492095947},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5590084195137024},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.485113263130188},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.4723922908306122},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.3860706388950348},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.38453492522239685},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3588823676109314},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.35073667764663696},{"id":"https://openalex.org/C158336966","wikidata":"https://www.wikidata.org/wiki/Q3074426","display_name":"Flow shop scheduling","level":4,"score":0.1124739944934845},{"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/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","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}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1142/s0129054194000141","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0129054194000141","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":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W2283291034","https://openalex.org/W1998948241","https://openalex.org/W4244289241","https://openalex.org/W2186708011","https://openalex.org/W2364223843","https://openalex.org/W4239937204","https://openalex.org/W2155564881","https://openalex.org/W1984223094","https://openalex.org/W2598378221","https://openalex.org/W2101964286"],"abstract_inverted_index":{"The":[0],"problem":[1,31],"of":[2,7,21,104,125,128,131],"nonpreemptively":[3],"scheduling":[4],"a":[5,47,74],"set":[6],"n":[8],"independent":[9],"jobs":[10,23,64,133],"with":[11],"identical":[12,59,66,111],"release":[13],"times":[14],"so":[15],"as":[16],"to":[17,44,119],"minimize":[18],"the":[19,30,82,101,105,114,121,126,129,141,145],"number":[20,130],"late":[22],"is":[24,27,98,107,117],"considered.":[25],"It":[26,97],"known":[28],"that":[29,51,100,139],"can":[32],"be":[33,120],"solved":[34],"in":[35,134,140],"O(n":[36,93],"log":[37,94],"n)":[38,95],"time,":[39],"by":[40,144],"an":[41,92,135],"algorithm":[42],"due":[43,67],"Moore,":[45],"for":[46,55,81,109],"single":[48],"processor,":[49],"and":[50],"it":[52],"becomes":[53],"NP-hard":[54],"two":[56,110],"or":[57],"more":[58],"processors,":[60,112],"even":[61],"if":[62],"all":[63],"have":[65],"dates.":[68],"In":[69],"this":[70],"paper":[71],"we":[72],"give":[73],"fast":[75],"heuristic,":[76],"based":[77],"on":[78],"Moore\u2019s":[79,86],"algorithm,":[80,87],"multiprocessor":[83],"case.":[84],"Like":[85],"our":[88],"heuristic":[89,106],"also":[90],"admits":[91],"implementation.":[96],"shown":[99],"performance":[102,115],"ratio":[103,116,127],"4/3":[108],"where":[113],"defined":[118],"least":[122],"upper":[123],"bound":[124],"on-time":[132],"optimal":[136],"schedule":[137,142],"versus":[138],"generated":[143],"heuristic.":[146]},"counts_by_year":[{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":2},{"year":2019,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2014,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}