{"id":"https://openalex.org/W2567863272","doi":"https://doi.org/10.1007/s10951-011-0233-1","title":"Online scheduling of bounded length jobs to maximize throughput","display_name":"Online scheduling of bounded length jobs to maximize throughput","publication_year":2011,"publication_date":"2011-04-08","ids":{"openalex":"https://openalex.org/W2567863272","doi":"https://doi.org/10.1007/s10951-011-0233-1","mag":"2567863272"},"language":"en","primary_location":{"id":"doi:10.1007/s10951-011-0233-1","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s10951-011-0233-1","pdf_url":"https://link.springer.com/content/pdf/10.1007/s10951-011-0233-1.pdf","source":{"id":"https://openalex.org/S91278097","display_name":"Journal of Scheduling","issn_l":"1094-6136","issn":["1094-6136","1099-1425"],"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":"cc-by-nc","license_id":"https://openalex.org/licenses/cc-by-nc","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Scheduling","raw_type":"journal-article"},"type":"article","indexed_in":["arxiv","crossref"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://link.springer.com/content/pdf/10.1007/s10951-011-0233-1.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5029270613","display_name":"Christoph D\u00fcrr","orcid":"https://orcid.org/0000-0001-8103-5333"},"institutions":[{"id":"https://openalex.org/I39804081","display_name":"Sorbonne Universit\u00e9","ror":"https://ror.org/02en5vm52","country_code":"FR","type":"education","lineage":["https://openalex.org/I39804081"]},{"id":"https://openalex.org/I1294671590","display_name":"Centre National de la Recherche Scientifique","ror":"https://ror.org/02feahw73","country_code":"FR","type":"funder","lineage":["https://openalex.org/I1294671590"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Christoph D\u00fcrr","raw_affiliation_strings":["CNRS, LIP6, Universit\u00e9 Pierre et Marie Curie, Paris, France"],"affiliations":[{"raw_affiliation_string":"CNRS, LIP6, Universit\u00e9 Pierre et Marie Curie, Paris, France","institution_ids":["https://openalex.org/I39804081","https://openalex.org/I1294671590"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5007826587","display_name":"\u0141ukasz Je\u017c","orcid":"https://orcid.org/0000-0002-7375-0641"},"institutions":[{"id":"https://openalex.org/I219388962","display_name":"University of Wroc\u0142aw","ror":"https://ror.org/00yae6e25","country_code":"PL","type":"education","lineage":["https://openalex.org/I219388962"]},{"id":"https://openalex.org/I4210087266","display_name":"Institute of Computer Science","ror":"https://ror.org/003fvp964","country_code":"PL","type":"facility","lineage":["https://openalex.org/I4210087266","https://openalex.org/I99542240"]}],"countries":["PL"],"is_corresponding":true,"raw_author_name":"\u0141ukasz Je\u017c","raw_affiliation_strings":["Institute of Computer Science, University of Wroc\u0142aw, 50-383, Wroc\u0142aw, Poland"],"affiliations":[{"raw_affiliation_string":"Institute of Computer Science, University of Wroc\u0142aw, 50-383, Wroc\u0142aw, Poland","institution_ids":["https://openalex.org/I219388962","https://openalex.org/I4210087266"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5077796278","display_name":"Nguy\u1ec5n Kim Th\u1eafng","orcid":"https://orcid.org/0000-0002-6085-9453"},"institutions":[{"id":"https://openalex.org/I56435720","display_name":"Universit\u00e9 Paris Dauphine-PSL","ror":"https://ror.org/052bz7812","country_code":"FR","type":"education","lineage":["https://openalex.org/I2746051580","https://openalex.org/I56435720"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Nguyen Kim Thang","raw_affiliation_strings":["Lamsade, Universit\u00e9 Paris-Dauphine, Paris, France"],"affiliations":[{"raw_affiliation_string":"Lamsade, Universit\u00e9 Paris-Dauphine, Paris, France","institution_ids":["https://openalex.org/I56435720"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5007826587"],"corresponding_institution_ids":["https://openalex.org/I219388962","https://openalex.org/I4210087266"],"apc_list":{"value":2290,"currency":"EUR","value_usd":2890},"apc_paid":{"value":2290,"currency":"EUR","value_usd":2890},"fwci":0.0,"has_fulltext":true,"cited_by_count":8,"citation_normalized_percentile":{"value":0.38729876,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":98},"biblio":{"volume":"15","issue":"5","first_page":"653","last_page":"664"},"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.9998000264167786,"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/T11814","display_name":"Advanced Manufacturing and Logistics Optimization","score":0.996399998664856,"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/scheduling","display_name":"Scheduling (production processes)","score":0.658845067024231},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6512584686279297},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.6265575885772705},{"id":"https://openalex.org/keywords/throughput","display_name":"Throughput","score":0.6149485111236572},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4842469394207001},{"id":"https://openalex.org/keywords/operations-research","display_name":"Operations research","score":0.4083249270915985},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.37812578678131104},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.180060476064682},{"id":"https://openalex.org/keywords/telecommunications","display_name":"Telecommunications","score":0.11903369426727295}],"concepts":[{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.658845067024231},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6512584686279297},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.6265575885772705},{"id":"https://openalex.org/C157764524","wikidata":"https://www.wikidata.org/wiki/Q1383412","display_name":"Throughput","level":3,"score":0.6149485111236572},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4842469394207001},{"id":"https://openalex.org/C42475967","wikidata":"https://www.wikidata.org/wiki/Q194292","display_name":"Operations research","level":1,"score":0.4083249270915985},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.37812578678131104},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.180060476064682},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.11903369426727295},{"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/C555944384","wikidata":"https://www.wikidata.org/wiki/Q249","display_name":"Wireless","level":2,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1007/s10951-011-0233-1","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s10951-011-0233-1","pdf_url":"https://link.springer.com/content/pdf/10.1007/s10951-011-0233-1.pdf","source":{"id":"https://openalex.org/S91278097","display_name":"Journal of Scheduling","issn_l":"1094-6136","issn":["1094-6136","1099-1425"],"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":"cc-by-nc","license_id":"https://openalex.org/licenses/cc-by-nc","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Scheduling","raw_type":"journal-article"},{"id":"pmh:oai:arXiv.org:0902.2209","is_oa":true,"landing_page_url":"http://arxiv.org/abs/0902.2209","pdf_url":"https://arxiv.org/pdf/0902.2209","source":{"id":"https://openalex.org/S4393918464","display_name":"ArXiv.org","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},{"id":"pmh:oai:HAL:hal-01185266v1","is_oa":false,"landing_page_url":"https://hal.science/hal-01185266","pdf_url":null,"source":{"id":"https://openalex.org/S4306402512","display_name":"HAL (Le Centre pour la Communication Scientifique Directe)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1294671590","host_organization_name":"Centre National de la Recherche Scientifique","host_organization_lineage":["https://openalex.org/I1294671590"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Journal of Scheduling, 2012, 15 (5), pp.653-664. ⟨10.1007/s10951-011-0233-1⟩","raw_type":"Journal articles"},{"id":"pmh:oai:basepub.dauphine.fr:123456789/6047","is_oa":true,"landing_page_url":"https://basepub.dauphine.fr/handle/123456789/6047","pdf_url":null,"source":{"id":"https://openalex.org/S4306401007","display_name":"Base Institutionnelle de Recherche de l'universit\u00e9 Paris-Dauphine (BIRD) (University Paris-Dauphine)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I102197404","host_organization_name":"Universit\u00e9 Paris-Sud","host_organization_lineage":["https://openalex.org/I102197404"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by-sa","license_id":"https://openalex.org/licenses/cc-by-sa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Article accept\u00e9 pour publication ou publi\u00e9"}],"best_oa_location":{"id":"doi:10.1007/s10951-011-0233-1","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s10951-011-0233-1","pdf_url":"https://link.springer.com/content/pdf/10.1007/s10951-011-0233-1.pdf","source":{"id":"https://openalex.org/S91278097","display_name":"Journal of Scheduling","issn_l":"1094-6136","issn":["1094-6136","1099-1425"],"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":"cc-by-nc","license_id":"https://openalex.org/licenses/cc-by-nc","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Scheduling","raw_type":"journal-article"},"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/9","display_name":"Industry, innovation and infrastructure","score":0.46000000834465027}],"awards":[],"funders":[{"id":"https://openalex.org/F4320320883","display_name":"Agence Nationale de la Recherche","ror":"https://ror.org/00rbzpz17"},{"id":"https://openalex.org/F4320322733","display_name":"Ministerstwo Edukacji i Nauki","ror":"https://ror.org/05dwvd537"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2567863272.pdf","grobid_xml":"https://content.openalex.org/works/W2567863272.grobid-xml"},"referenced_works_count":19,"referenced_works":["https://openalex.org/W5599802","https://openalex.org/W1278573221","https://openalex.org/W1571155498","https://openalex.org/W1964720438","https://openalex.org/W1972868674","https://openalex.org/W1975122098","https://openalex.org/W1986168186","https://openalex.org/W2015429079","https://openalex.org/W2025312307","https://openalex.org/W2047204419","https://openalex.org/W2049176717","https://openalex.org/W2080158054","https://openalex.org/W2080354718","https://openalex.org/W2099261768","https://openalex.org/W2171103562","https://openalex.org/W2525189598","https://openalex.org/W2794104339","https://openalex.org/W2912985640","https://openalex.org/W6670655661"],"related_works":["https://openalex.org/W3013085049","https://openalex.org/W2136583354","https://openalex.org/W2111238207","https://openalex.org/W1560496689","https://openalex.org/W1992739770","https://openalex.org/W4386900933","https://openalex.org/W4229058035","https://openalex.org/W2760721665","https://openalex.org/W2025955409","https://openalex.org/W1577301438"],"abstract_inverted_index":{"We":[0],"consider":[1,50],"an":[2,193],"online":[3,52],"scheduling":[4,53],"problem,":[5],"motivated":[6],"by":[7,205],"the":[8,12,51,99,119,129,148,151,154,169,199],"issues":[9],"present":[10],"at":[11,63,91,126],"joints":[13],"of":[14,102,122,158,185],"networks":[15],"using":[16],"ATM":[17,30],"and":[18,32,69,80,153],"TCP/IP.":[19],"Namely,":[20],"IP":[21],"packets":[22,43],"have":[23,174],"to":[24,41,97],"be":[25,45,89],"broken":[26],"down":[27],"into":[28],"small":[29],"cells":[31,39],"sent":[33],"out":[34],"before":[35],"their":[36],"deadlines,":[37],"but":[38],"corresponding":[40],"different":[42],"can":[44,88],"interwoven.":[46],"More":[47],"formally,":[48],"we":[49,115,138,180],"problem":[54],"with":[55,143,201],"preemptions,":[56],"where":[57],"each":[58],"job":[59,87],"j":[60,67,74,78,83],"is":[61,96,134],"revealed":[62],"release":[64],"time":[65,72,157],"r":[66],",":[68,75,79],"has":[70],"processing":[71,120,156,176,202],"p":[73],"deadline":[76],"d":[77],"weight":[81,101],"w":[82],".":[84],"A":[85],"preempted":[86],"resumed":[90],"any":[92],"time.":[93,107],"The":[94,187],"goal":[95],"maximize":[98],"total":[100],"all":[103,123,159,172],"jobs":[104,124,173],"completed":[105],"on":[106,147],"Our":[108],"main":[109],"results":[110],"are":[111,125],"as":[112],"follows.":[113],"Firstly,":[114],"prove":[116],"that":[117],"when":[118,171],"times":[121,203],"most":[127],"k,":[128],"optimum":[130],"deterministic":[131,141],"competitive":[132,144,165],"ratio":[133,145,149,166],"\u0398(k/log":[135],"k).":[136],"Secondly,":[137],"give":[139,181],"a":[140,182],"algorithm":[142,197],"depending":[146],"between":[150],"smallest":[152],"largest":[155],"jobs.":[160],"In":[161],"particular,":[162],"it":[163],"attains":[164],"5":[167],"in":[168],"case":[170],"identical":[175],"times,":[177],"for":[178,198],"which":[179],"lower":[183],"bound":[184,190],"2.598.":[186],"latter":[188],"upper":[189],"also":[191],"yields":[192],"O(log":[194],"k)-competitive":[195],"randomized":[196],"variant":[200],"bounded":[204],"k.":[206]},"counts_by_year":[{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":4},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":1}],"updated_date":"2026-03-20T23:20:44.827607","created_date":"2025-10-10T00:00:00"}