{"id":"https://openalex.org/W1982462728","doi":"https://doi.org/10.1007/pl00009254","title":"Upper and Lower Bounds on the Makespan of Schedules for Tree Dags on Linear Arrays","display_name":"Upper and Lower Bounds on the Makespan of Schedules for Tree Dags on Linear Arrays","publication_year":1999,"publication_date":"1999-02-01","ids":{"openalex":"https://openalex.org/W1982462728","doi":"https://doi.org/10.1007/pl00009254","mag":"1982462728"},"language":"en","primary_location":{"id":"doi:10.1007/pl00009254","is_oa":false,"landing_page_url":"https://doi.org/10.1007/pl00009254","pdf_url":null,"source":{"id":"https://openalex.org/S89324355","display_name":"Algorithmica","issn_l":"0178-4617","issn":["0178-4617","1432-0541"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithmica","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/A5013521790","display_name":"K. Kalpakis","orcid":null},"institutions":[{"id":"https://openalex.org/I79272384","display_name":"University of Maryland, Baltimore County","ror":"https://ror.org/02qskvh78","country_code":"US","type":"education","lineage":["https://openalex.org/I79272384"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"K. Kalpakis","raw_affiliation_strings":["Department of Computer  Science and Electrical Engineering, University of Maryland Baltimore County,  1000 Hilltop Circle, Baltimore, MD 21250, USA.  kalpakis@cs.umbc.edu, yayesha@cs.umbc.edu., , , , , , US","Department of Computer Science and Electrical Engineering, University of Maryland Baltimore County, 1000 Hilltop Circle, Baltimore, MD 21250, USA. kalpakis@cs.umbc.edu, yayesha@cs.umbc.edu., US"],"affiliations":[{"raw_affiliation_string":"Department of Computer  Science and Electrical Engineering, University of Maryland Baltimore County,  1000 Hilltop Circle, Baltimore, MD 21250, USA.  kalpakis@cs.umbc.edu, yayesha@cs.umbc.edu., , , , , , US","institution_ids":["https://openalex.org/I79272384"]},{"raw_affiliation_string":"Department of Computer Science and Electrical Engineering, University of Maryland Baltimore County, 1000 Hilltop Circle, Baltimore, MD 21250, USA. kalpakis@cs.umbc.edu, yayesha@cs.umbc.edu., US","institution_ids":["https://openalex.org/I79272384"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5111941996","display_name":"Yaacov Yesha","orcid":null},"institutions":[{"id":"https://openalex.org/I79272384","display_name":"University of Maryland, Baltimore County","ror":"https://ror.org/02qskvh78","country_code":"US","type":"education","lineage":["https://openalex.org/I79272384"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Y. Yesha","raw_affiliation_strings":["Department of Computer  Science and Electrical Engineering, University of Maryland Baltimore County,  1000 Hilltop Circle, Baltimore, MD 21250, USA.  kalpakis@cs.umbc.edu, yayesha@cs.umbc.edu., , , , , , US","Department of Computer Science and Electrical Engineering, University of Maryland Baltimore County, 1000 Hilltop Circle, Baltimore, MD 21250, USA. kalpakis@cs.umbc.edu, yayesha@cs.umbc.edu., US"],"affiliations":[{"raw_affiliation_string":"Department of Computer  Science and Electrical Engineering, University of Maryland Baltimore County,  1000 Hilltop Circle, Baltimore, MD 21250, USA.  kalpakis@cs.umbc.edu, yayesha@cs.umbc.edu., , , , , , US","institution_ids":["https://openalex.org/I79272384"]},{"raw_affiliation_string":"Department of Computer Science and Electrical Engineering, University of Maryland Baltimore County, 1000 Hilltop Circle, Baltimore, MD 21250, USA. kalpakis@cs.umbc.edu, yayesha@cs.umbc.edu., US","institution_ids":["https://openalex.org/I79272384"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5013521790"],"corresponding_institution_ids":["https://openalex.org/I79272384"],"apc_list":{"value":2290,"currency":"EUR","value_usd":2890},"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.1766078,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"23","issue":"2","first_page":"159","last_page":"179"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9948999881744385,"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.9948999881744385,"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.949400007724762,"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/T11729","display_name":"Product Development and Customization","score":0.9271000027656555,"subfield":{"id":"https://openalex.org/subfields/1405","display_name":"Management of Technology and Innovation"},"field":{"id":"https://openalex.org/fields/14","display_name":"Business, Management and Accounting"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/directed-acyclic-graph","display_name":"Directed acyclic graph","score":0.6762205362319946},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.6487617492675781},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6459680795669556},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.6357071399688721},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.6047201752662659},{"id":"https://openalex.org/keywords/binary-tree","display_name":"Binary tree","score":0.5488919019699097},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.5312955975532532},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5100422501564026},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.5025486946105957},{"id":"https://openalex.org/keywords/theory-of-computation","display_name":"Theory of computation","score":0.500762939453125},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.4612523317337036},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4366312026977539},{"id":"https://openalex.org/keywords/omega","display_name":"Omega","score":0.4146319627761841},{"id":"https://openalex.org/keywords/binary-number","display_name":"Binary number","score":0.4140644967556},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.38706523180007935},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.23132988810539246},{"id":"https://openalex.org/keywords/arithmetic","display_name":"Arithmetic","score":0.0802987813949585}],"concepts":[{"id":"https://openalex.org/C74197172","wikidata":"https://www.wikidata.org/wiki/Q1195339","display_name":"Directed acyclic graph","level":2,"score":0.6762205362319946},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.6487617492675781},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6459680795669556},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.6357071399688721},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.6047201752662659},{"id":"https://openalex.org/C197855036","wikidata":"https://www.wikidata.org/wiki/Q380172","display_name":"Binary tree","level":2,"score":0.5488919019699097},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.5312955975532532},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5100422501564026},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.5025486946105957},{"id":"https://openalex.org/C24858836","wikidata":"https://www.wikidata.org/wiki/Q844718","display_name":"Theory of computation","level":2,"score":0.500762939453125},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.4612523317337036},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4366312026977539},{"id":"https://openalex.org/C2779557605","wikidata":"https://www.wikidata.org/wiki/Q9890","display_name":"Omega","level":2,"score":0.4146319627761841},{"id":"https://openalex.org/C48372109","wikidata":"https://www.wikidata.org/wiki/Q3913","display_name":"Binary number","level":2,"score":0.4140644967556},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.38706523180007935},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.23132988810539246},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.0802987813949585},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","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}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/pl00009254","is_oa":false,"landing_page_url":"https://doi.org/10.1007/pl00009254","pdf_url":null,"source":{"id":"https://openalex.org/S89324355","display_name":"Algorithmica","issn_l":"0178-4617","issn":["0178-4617","1432-0541"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithmica","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":12,"referenced_works":["https://openalex.org/W98850730","https://openalex.org/W167393176","https://openalex.org/W1985004065","https://openalex.org/W1989582918","https://openalex.org/W1997409844","https://openalex.org/W2009081567","https://openalex.org/W2011039300","https://openalex.org/W2065231486","https://openalex.org/W2074762232","https://openalex.org/W2091190547","https://openalex.org/W2110521808","https://openalex.org/W2153573559"],"related_works":["https://openalex.org/W2731094954","https://openalex.org/W2789273959","https://openalex.org/W4302345037","https://openalex.org/W2952978498","https://openalex.org/W2774472052","https://openalex.org/W2022891963","https://openalex.org/W2904242085","https://openalex.org/W2593735092","https://openalex.org/W2749663619","https://openalex.org/W1977529769"],"abstract_inverted_index":null,"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}