{"id":"https://openalex.org/W2805215296","doi":"https://doi.org/10.1142/s0129054119500102","title":"Tight Bounds for Restricted Grid Scheduling","display_name":"Tight Bounds for Restricted Grid Scheduling","publication_year":2019,"publication_date":"2019-04-01","ids":{"openalex":"https://openalex.org/W2805215296","doi":"https://doi.org/10.1142/s0129054119500102","mag":"2805215296"},"language":"en","primary_location":{"id":"doi:10.1142/s0129054119500102","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0129054119500102","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/A5068354624","display_name":"Joan Boyar","orcid":"https://orcid.org/0000-0002-0725-8341"},"institutions":[{"id":"https://openalex.org/I177969490","display_name":"University of Southern Denmark","ror":"https://ror.org/03yrrjy16","country_code":"DK","type":"education","lineage":["https://openalex.org/I177969490"]}],"countries":["DK"],"is_corresponding":true,"raw_author_name":"Joan Boyar","raw_affiliation_strings":["Department of Mathematics and Computer Science, University of Southern Denmark, Campusvej 55, DK-5230 Odense M, Denmark"],"raw_orcid":"https://orcid.org/0000-0002-0725-8341","affiliations":[{"raw_affiliation_string":"Department of Mathematics and Computer Science, University of Southern Denmark, Campusvej 55, DK-5230 Odense M, Denmark","institution_ids":["https://openalex.org/I177969490"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5013813328","display_name":"Faith Ellen","orcid":"https://orcid.org/0000-0003-4473-931X"},"institutions":[{"id":"https://openalex.org/I185261750","display_name":"University of Toronto","ror":"https://ror.org/03dbr7087","country_code":"CA","type":"education","lineage":["https://openalex.org/I185261750"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Faith Ellen","raw_affiliation_strings":["Department of Computer Science, University of Toronto, 10 King\u2019s College Road, Toronto, Ontario, Canada M5S 3G4, Canada"],"raw_orcid":"https://orcid.org/0000-0003-4473-931X","affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Toronto, 10 King\u2019s College Road, Toronto, Ontario, Canada M5S 3G4, Canada","institution_ids":["https://openalex.org/I185261750"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5068354624"],"corresponding_institution_ids":["https://openalex.org/I177969490"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.00621804,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"30","issue":"03","first_page":"375","last_page":"405"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9998999834060669,"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"}},"topics":[{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9998999834060669,"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/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9995999932289124,"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/T10715","display_name":"Distributed and Parallel Computing Systems","score":0.9954000115394592,"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/computer-science","display_name":"Computer science","score":0.6276153922080994},{"id":"https://openalex.org/keywords/grid","display_name":"Grid","score":0.5407590270042419},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.4913460314273834},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.4038083851337433},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.3660030961036682},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.31654423475265503},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3024659752845764},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.08723220229148865}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6276153922080994},{"id":"https://openalex.org/C187691185","wikidata":"https://www.wikidata.org/wiki/Q2020720","display_name":"Grid","level":2,"score":0.5407590270042419},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.4913460314273834},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.4038083851337433},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.3660030961036682},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.31654423475265503},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3024659752845764},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.08723220229148865}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1142/s0129054119500102","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0129054119500102","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"},{"id":"pmh:oai:sdu.dk:openaire_cris_publications/b022042b-b271-46f6-801c-bdfc4ead0f1e","is_oa":false,"landing_page_url":"https://portal.findresearcher.sdu.dk/da/publications/b022042b-b271-46f6-801c-bdfc4ead0f1e","pdf_url":null,"source":{"id":"https://openalex.org/S4306400423","display_name":"University of Southern Denmark Research Portal (University of Southern Denmark)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I177969490","host_organization_name":"University of Southern Denmark","host_organization_lineage":["https://openalex.org/I177969490"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Boyar, J & Ellen, F 2019, 'Tight Bounds for Restricted Grid Scheduling', International Journal of Foundations of Computer Science, vol. 30, no. 3, pp. 375-405. https://doi.org/10.1142/S0129054119500102","raw_type":"info:eu-repo/semantics/publishedVersion"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G2664447491","display_name":null,"funder_award_id":"DFF-1323-00247","funder_id":"https://openalex.org/F4320310485","funder_display_name":"Natur og Univers, Det Frie Forskningsr\u00e5d"},{"id":"https://openalex.org/G6298695570","display_name":null,"funder_award_id":"VKR023219","funder_id":"https://openalex.org/F4320310490","funder_display_name":"Villum Fonden"}],"funders":[{"id":"https://openalex.org/F4320310485","display_name":"Natur og Univers, Det Frie Forskningsr\u00e5d","ror":"https://ror.org/03ge1nb22"},{"id":"https://openalex.org/F4320310489","display_name":"Velux Fonden","ror":"https://ror.org/007ww2d15"},{"id":"https://openalex.org/F4320310490","display_name":"Villum Fonden","ror":"https://ror.org/007ww2d15"},{"id":"https://openalex.org/F4320321487","display_name":"Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","ror":"https://ror.org/01h531d29"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":10,"referenced_works":["https://openalex.org/W1552828154","https://openalex.org/W1974455577","https://openalex.org/W1999166105","https://openalex.org/W2011670396","https://openalex.org/W2021844871","https://openalex.org/W2041645394","https://openalex.org/W2055872862","https://openalex.org/W2056198897","https://openalex.org/W2060939489","https://openalex.org/W2801463174"],"related_works":["https://openalex.org/W2115140794","https://openalex.org/W2041120224","https://openalex.org/W1504320321","https://openalex.org/W2067902980","https://openalex.org/W2548529098","https://openalex.org/W4312275919","https://openalex.org/W2338293335","https://openalex.org/W1993039745","https://openalex.org/W1581129489","https://openalex.org/W2369252416"],"abstract_inverted_index":{"The":[0,37],"following":[1],"problem":[2,64],"is":[3,24,39],"considered:":[4],"Items":[5],"with":[6],"integer":[7],"sizes":[8,81],"are":[9],"given":[10],"and":[11,74,82,94],"variable":[12],"sized":[13],"bins":[14,48],"arrive":[15],"online.":[16],"A":[17],"bin":[18,35,84],"must":[19],"be":[20],"used":[21],"if":[22],"there":[23],"still":[25],"an":[26],"item":[27,80],"remaining":[28],"which":[29,97],"fits":[30],"in":[31],"it":[32],"when":[33],"the":[34,42,47,59,101,104,110],"arrives.":[36],"goal":[38],"to":[40,109],"minimize":[41],"total":[43],"size":[44,70,85],"of":[45,54,62,69,103,106,112],"all":[46],"used.":[49],"Previously,":[50],"a":[51],"lower":[52,95],"bound":[53],"[Formula:":[55,71,75,86],"see":[56,72,76,87],"text]":[57,73],"on":[58,100],"competitive":[60],"ratio":[61,102],"this":[63],"was":[65],"achieved":[66],"using":[67],"items":[68,108],"text].":[77],"For":[78],"these":[79],"maximum":[83],"text],":[88],"we":[89],"obtain":[90],"asymptotically":[91],"matching":[92],"upper":[93],"bounds,":[96],"vary":[98],"depending":[99],"number":[105,111],"small":[107],"large":[113],"items.":[114]},"counts_by_year":[],"updated_date":"2026-03-27T05:58:40.876381","created_date":"2025-10-10T00:00:00"}