{"id":"https://openalex.org/W1970170535","doi":"https://doi.org/10.1142/s0129626495000321","title":"PERFORMANCE BOUNDS FOR STATIC MULTIPROCESSOR SCHEDULING OF MULTI-TASK JOBS","display_name":"PERFORMANCE BOUNDS FOR STATIC MULTIPROCESSOR SCHEDULING OF MULTI-TASK JOBS","publication_year":1995,"publication_date":"1995-09-01","ids":{"openalex":"https://openalex.org/W1970170535","doi":"https://doi.org/10.1142/s0129626495000321","mag":"1970170535"},"language":"en","primary_location":{"id":"doi:10.1142/s0129626495000321","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0129626495000321","pdf_url":null,"source":{"id":"https://openalex.org/S18360026","display_name":"Parallel Processing Letters","issn_l":"0129-6264","issn":["0129-6264","1793-642X"],"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":"Parallel Processing Letters","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/A5080547631","display_name":"Saptarshi Mahesh","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"S. MAHESH","raw_affiliation_strings":["Tata Information Systems Ltd., Bangalore - 560 017, India"],"affiliations":[{"raw_affiliation_string":"Tata Information Systems Ltd., Bangalore - 560 017, India","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5012659086","display_name":"C. Siva Ram Murthy","orcid":"https://orcid.org/0000-0002-1032-8857"},"institutions":[{"id":"https://openalex.org/I24676775","display_name":"Indian Institute of Technology Madras","ror":"https://ror.org/03v0r5n49","country_code":"IN","type":"facility","lineage":["https://openalex.org/I24676775"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"C. SIVA RAM MURTHY","raw_affiliation_strings":["Department of Computer Science and Engineering, Indian Institute of Technology, Madras - 600 036, India"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Engineering, Indian Institute of Technology, Madras - 600 036, India","institution_ids":["https://openalex.org/I24676775"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5103487617","display_name":"C. Pandu Rangan","orcid":null},"institutions":[{"id":"https://openalex.org/I24676775","display_name":"Indian Institute of Technology Madras","ror":"https://ror.org/03v0r5n49","country_code":"IN","type":"facility","lineage":["https://openalex.org/I24676775"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"C. PANDU RANGAN","raw_affiliation_strings":["Department of Computer Science and Engineering, Indian Institute of Technology, Madras - 600 036, India"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Engineering, Indian Institute of Technology, Madras - 600 036, India","institution_ids":["https://openalex.org/I24676775"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5080547631"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.15128769,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"05","issue":"03","first_page":"343","last_page":"355"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9959999918937683,"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.9959999918937683,"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.9947999715805054,"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.9943000078201294,"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/multiprocessor-scheduling","display_name":"Multiprocessor scheduling","score":0.7152167558670044},{"id":"https://openalex.org/keywords/multiprocessing","display_name":"Multiprocessing","score":0.7070083618164062},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.658365786075592},{"id":"https://openalex.org/keywords/bin-packing-problem","display_name":"Bin packing problem","score":0.6533690690994263},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6512272953987122},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.6352750062942505},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.6284719705581665},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5727815628051758},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.47455674409866333},{"id":"https://openalex.org/keywords/bin","display_name":"Bin","score":0.30625325441360474},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.27449116110801697},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.2619783878326416},{"id":"https://openalex.org/keywords/flow-shop-scheduling","display_name":"Flow shop scheduling","score":0.21507856249809265},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.11449342966079712},{"id":"https://openalex.org/keywords/embedded-system","display_name":"Embedded system","score":0.07078048586845398}],"concepts":[{"id":"https://openalex.org/C85924588","wikidata":"https://www.wikidata.org/wiki/Q107419135","display_name":"Multiprocessor scheduling","level":5,"score":0.7152167558670044},{"id":"https://openalex.org/C4822641","wikidata":"https://www.wikidata.org/wiki/Q846651","display_name":"Multiprocessing","level":2,"score":0.7070083618164062},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.658365786075592},{"id":"https://openalex.org/C87219788","wikidata":"https://www.wikidata.org/wiki/Q814581","display_name":"Bin packing problem","level":3,"score":0.6533690690994263},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6512272953987122},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.6352750062942505},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.6284719705581665},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5727815628051758},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.47455674409866333},{"id":"https://openalex.org/C156273044","wikidata":"https://www.wikidata.org/wiki/Q4913766","display_name":"Bin","level":2,"score":0.30625325441360474},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.27449116110801697},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.2619783878326416},{"id":"https://openalex.org/C158336966","wikidata":"https://www.wikidata.org/wiki/Q3074426","display_name":"Flow shop scheduling","level":4,"score":0.21507856249809265},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.11449342966079712},{"id":"https://openalex.org/C149635348","wikidata":"https://www.wikidata.org/wiki/Q193040","display_name":"Embedded system","level":1,"score":0.07078048586845398},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1142/s0129626495000321","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0129626495000321","pdf_url":null,"source":{"id":"https://openalex.org/S18360026","display_name":"Parallel Processing Letters","issn_l":"0129-6264","issn":["0129-6264","1793-642X"],"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":"Parallel Processing Letters","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.7099999785423279,"id":"https://metadata.un.org/sdg/8","display_name":"Decent work and economic growth"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W2797538013","https://openalex.org/W2026961896","https://openalex.org/W4255148175","https://openalex.org/W2971368033","https://openalex.org/W2001915926","https://openalex.org/W2096053066","https://openalex.org/W2104955674","https://openalex.org/W2949755993","https://openalex.org/W2967935725","https://openalex.org/W1590563747"],"abstract_inverted_index":{"Job":[0],"scheduling":[1],"on":[2,124],"multiprocessor":[3],"systems":[4],"is":[5,100,135,143],"studied":[6],"here":[7],"as":[8],"a":[9,42],"special":[10],"case":[11],"of":[12,59,89,106,111],"oriented":[13],"two-dimensional":[14,96],"orthogonal":[15],"bin":[16],"packing.":[17],"Each":[18],"job":[19,39,160],"has":[20],"subtasks":[21],"which":[22],"can":[23],"be":[24,32,155],"processed":[25],"in":[26],"parallel,":[27],"requiring":[28],"multiple":[29],"processors":[30],"to":[31,34,41,47,86,102,128,154],"allocated":[33],"each":[35,38],"job.":[36],"Then":[37],"corresponds":[40],"rectangle":[43],"with":[44],"sides":[45],"equal":[46],"the":[48,52,87,90,94,103,107,116,125,129,133,138,146],"processor":[49,71,108],"requirement":[50,72,109],"and":[51,68],"processing":[53,63],"time.":[54],"We":[55,76,113],"study":[56],"two":[57],"classes":[58],"algorithms:":[60],"(i)":[61],"Longest":[62],"time":[64],"first":[65,73],"(LPT)":[66],"algorithms,":[67],"(ii)":[69],"Largest":[70],"(LPR)":[74],"algorithms.":[75,131,148],"obtain":[77],"improved":[78],"asymptotic":[79,121],"upper":[80,122],"bounds":[81,88],"for":[82,93,137,145,158],"these":[83],"algorithms":[84,92,118,140,151],"compared":[85,127],"corresponding":[91],"general":[95],"packing":[97],"problem.":[98],"This":[99],"due":[101],"discrete":[104],"nature":[105],"(dimension)":[110],"jobs.":[112],"find":[114],"that":[115],"LPR":[117,139,150],"have":[119],"better":[120],"bound":[123,134],"makespan":[126],"LPT":[130,147],"Specifically,":[132],"7/4":[136],"whereas":[141],"it":[142],"2":[144],"Moreover,":[149],"are":[152],"found":[153],"more":[156],"suited":[157],"dynamic":[159],"scheduling.":[161]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}