{"id":"https://openalex.org/W2255604137","doi":"https://doi.org/10.1007/978-3-662-44602-7_5","title":"Online Scheduling of Unit Length Jobs with Commitment and Penalties","display_name":"Online Scheduling of Unit Length Jobs with Commitment and Penalties","publication_year":2014,"publication_date":"2014-01-01","ids":{"openalex":"https://openalex.org/W2255604137","doi":"https://doi.org/10.1007/978-3-662-44602-7_5","mag":"2255604137"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-662-44602-7_5","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-662-44602-7_5","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"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":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},"type":"book-chapter","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://inria.hal.science/hal-01402028","any_repository_has_fulltext":null},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5049703935","display_name":"Stanley P. Y. Fung","orcid":"https://orcid.org/0000-0002-9335-8567"},"institutions":[{"id":"https://openalex.org/I153648349","display_name":"University of Leicester","ror":"https://ror.org/04h699437","country_code":"GB","type":"education","lineage":["https://openalex.org/I153648349"]}],"countries":["GB"],"is_corresponding":true,"raw_author_name":"Stanley P. Y. Fung","raw_affiliation_strings":["Department of Computer Science, University of Leicester, Leicester, United Kingdom"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Leicester, Leicester, United Kingdom","institution_ids":["https://openalex.org/I153648349"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5049703935"],"corresponding_institution_ids":["https://openalex.org/I153648349"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":{"value":5000,"currency":"EUR","value_usd":5392},"fwci":0.6294,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.71801946,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"54","last_page":"65"},"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.996999979019165,"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.9901999831199646,"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/competitive-analysis","display_name":"Competitive analysis","score":0.7540783882141113},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7134288549423218},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.7086480855941772},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.6175020337104797},{"id":"https://openalex.org/keywords/honour","display_name":"Honour","score":0.5292158722877502},{"id":"https://openalex.org/keywords/online-algorithm","display_name":"Online algorithm","score":0.4600925147533417},{"id":"https://openalex.org/keywords/unit","display_name":"Unit (ring theory)","score":0.43626996874809265},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.41090285778045654},{"id":"https://openalex.org/keywords/operations-research","display_name":"Operations research","score":0.3522409498691559},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.34705179929733276},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.31527772545814514},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.21482041478157043},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.21269413828849792},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.19311052560806274},{"id":"https://openalex.org/keywords/operating-system","display_name":"Operating system","score":0.08137235045433044}],"concepts":[{"id":"https://openalex.org/C102408133","wikidata":"https://www.wikidata.org/wiki/Q5156350","display_name":"Competitive analysis","level":3,"score":0.7540783882141113},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7134288549423218},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.7086480855941772},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.6175020337104797},{"id":"https://openalex.org/C2780110125","wikidata":"https://www.wikidata.org/wiki/Q207333","display_name":"Honour","level":2,"score":0.5292158722877502},{"id":"https://openalex.org/C196921405","wikidata":"https://www.wikidata.org/wiki/Q786431","display_name":"Online algorithm","level":2,"score":0.4600925147533417},{"id":"https://openalex.org/C122637931","wikidata":"https://www.wikidata.org/wiki/Q118084","display_name":"Unit (ring theory)","level":2,"score":0.43626996874809265},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.41090285778045654},{"id":"https://openalex.org/C42475967","wikidata":"https://www.wikidata.org/wiki/Q194292","display_name":"Operations research","level":1,"score":0.3522409498691559},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.34705179929733276},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.31527772545814514},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.21482041478157043},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.21269413828849792},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.19311052560806274},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.08137235045433044},{"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/C95457728","wikidata":"https://www.wikidata.org/wiki/Q309","display_name":"History","level":0,"score":0.0},{"id":"https://openalex.org/C166957645","wikidata":"https://www.wikidata.org/wiki/Q23498","display_name":"Archaeology","level":1,"score":0.0},{"id":"https://openalex.org/C145420912","wikidata":"https://www.wikidata.org/wiki/Q853077","display_name":"Mathematics education","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1007/978-3-662-44602-7_5","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-662-44602-7_5","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"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":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},{"id":"pmh:oai:HAL:hal-01402028v1","is_oa":true,"landing_page_url":"https://inria.hal.science/hal-01402028","pdf_url":null,"source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"8th IFIP International Conference on Theoretical Computer Science (TCS), Sep 2014, Rome, Italy. pp.54-65, ⟨10.1007/978-3-662-44602-7_5⟩","raw_type":"Conference papers"}],"best_oa_location":{"id":"pmh:oai:HAL:hal-01402028v1","is_oa":true,"landing_page_url":"https://inria.hal.science/hal-01402028","pdf_url":null,"source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"8th IFIP International Conference on Theoretical Computer Science (TCS), Sep 2014, Rome, Italy. pp.54-65, ⟨10.1007/978-3-662-44602-7_5⟩","raw_type":"Conference papers"},"sustainable_development_goals":[{"score":0.6200000047683716,"id":"https://metadata.un.org/sdg/8","display_name":"Decent work and economic growth"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":27,"referenced_works":["https://openalex.org/W1278573221","https://openalex.org/W1501066815","https://openalex.org/W1504289907","https://openalex.org/W1506292197","https://openalex.org/W1506652781","https://openalex.org/W1536154726","https://openalex.org/W1539914310","https://openalex.org/W1565113225","https://openalex.org/W1583737895","https://openalex.org/W1585689770","https://openalex.org/W1602012035","https://openalex.org/W1651118527","https://openalex.org/W1964720438","https://openalex.org/W1991173480","https://openalex.org/W1994408974","https://openalex.org/W2006553854","https://openalex.org/W2008545695","https://openalex.org/W2042122291","https://openalex.org/W2080559508","https://openalex.org/W2095073910","https://openalex.org/W2104806240","https://openalex.org/W2165659786","https://openalex.org/W2168012204","https://openalex.org/W2179080494","https://openalex.org/W2403713660","https://openalex.org/W2977506839","https://openalex.org/W4246580564"],"related_works":["https://openalex.org/W2564742953","https://openalex.org/W4213299358","https://openalex.org/W2793095688","https://openalex.org/W1623410360","https://openalex.org/W3115340459","https://openalex.org/W4390751688","https://openalex.org/W4390203503","https://openalex.org/W2797898895","https://openalex.org/W2131569046","https://openalex.org/W2045215405"],"abstract_inverted_index":{"We":[0,144],"consider":[1],"the":[2,17,34,40,47,79,98,105,131,164],"online":[3],"scheduling":[4],"of":[5,12,19,82,100,128,142,166],"unit":[6],"length":[7],"jobs":[8],"with":[9],"two":[10,80],"models":[11,81],"commitment.":[13,83],"In":[14,31,69],"immediate":[15,32,85,135],"notification,":[16],"acceptance":[18],"a":[20,55,60,125,139],"job":[21,41],"must":[22,42],"be":[23,44],"decided":[24],"as":[25,27,50],"soon":[26],"it":[28],"is":[29,97,104,111,122,157],"released.":[30],"decision,":[33,86],"actual":[35],"time":[36],"slot":[37],"allocated":[38],"to":[39,53,163],"also":[43,145],"fixed":[45],"at":[46],"job\u2019s":[48],"arrival":[49,168],"well.":[51],"Failure":[52],"honour":[54],"commitment":[56],"will":[57],"result":[58],"in":[59],"penalty.":[61],"The":[62],"non-commitment":[63],"version":[64],"has":[65],"been":[66],"extensively":[67],"studied.":[68],"this":[70],"paper":[71],"we":[72,87,113,137,160],"give":[73,88,114,138,146,161],"algorithms":[74],"and":[75,102,108,169],"lower":[76,126,140],"bounds":[77,149],"for":[78],"For":[84,134],"an":[89,115],"O(m(1":[90],"+":[91,117],"\u03c1)1/m":[92],")-competitive":[93],"algorithm":[94],"where":[95],"m":[96,110,151],"number":[99],"machines":[101],"\u03c1":[103,156],"penalty":[106],"factor,":[107],"when":[109,150,155],"large":[112],"O(log(1":[116],"\u03c1))":[118],"upper":[119],"bound.":[120],"This":[121],"matched":[123],"by":[124],"bound":[127,141],"\u03a9(log\u03c1)":[129],"on":[130],"competitive":[132],"ratio.":[133],"notification":[136],"\u03a9(log\u03c1/loglog\u03c1).":[143],"some":[147],"better":[148],"=":[152],"1":[153],"or":[154],"small.":[158],"Finally":[159],"considerations":[162],"case":[165],"separate":[167],"start":[170],"times.":[171]},"counts_by_year":[{"year":2016,"cited_by_count":1}],"updated_date":"2026-03-10T16:38:18.471706","created_date":"2025-10-10T00:00:00"}