{"id":"https://openalex.org/W4417106564","doi":"https://doi.org/10.1007/s11134-025-09961-2","title":"Dynamic scheduling with convex delay costs revisited","display_name":"Dynamic scheduling with convex delay costs revisited","publication_year":2025,"publication_date":"2025-12-08","ids":{"openalex":"https://openalex.org/W4417106564","doi":"https://doi.org/10.1007/s11134-025-09961-2"},"language":"en","primary_location":{"id":"doi:10.1007/s11134-025-09961-2","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s11134-025-09961-2","pdf_url":"https://link.springer.com/content/pdf/10.1007/s11134-025-09961-2.pdf","source":{"id":"https://openalex.org/S148503350","display_name":"Queueing Systems","issn_l":"0257-0130","issn":["0257-0130","1572-9443"],"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","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Queueing Systems","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://link.springer.com/content/pdf/10.1007/s11134-025-09961-2.pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5078889189","display_name":"Samuli Aalto","orcid":"https://orcid.org/0000-0003-1040-4095"},"institutions":[{"id":"https://openalex.org/I9927081","display_name":"Aalto University","ror":"https://ror.org/020hwjq30","country_code":"FI","type":"education","lineage":["https://openalex.org/I9927081"]}],"countries":["FI"],"is_corresponding":true,"raw_author_name":"Samuli Aalto","raw_affiliation_strings":["Department of Information and Communications Engineering, Aalto University, Espoo, Finland"],"affiliations":[{"raw_affiliation_string":"Department of Information and Communications Engineering, Aalto University, Espoo, Finland","institution_ids":["https://openalex.org/I9927081"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5078889189"],"corresponding_institution_ids":["https://openalex.org/I9927081"],"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":0,"citation_normalized_percentile":{"value":0.57444732,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"110","issue":"1","first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10974","display_name":"Advanced Queuing Theory Analysis","score":0.7918000221252441,"subfield":{"id":"https://openalex.org/subfields/1404","display_name":"Management Information Systems"},"field":{"id":"https://openalex.org/fields/14","display_name":"Business, Management and Accounting"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},"topics":[{"id":"https://openalex.org/T10974","display_name":"Advanced Queuing Theory Analysis","score":0.7918000221252441,"subfield":{"id":"https://openalex.org/subfields/1404","display_name":"Management Information Systems"},"field":{"id":"https://openalex.org/fields/14","display_name":"Business, Management and Accounting"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T11409","display_name":"Advanced Wireless Network Optimization","score":0.15459999442100525,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic 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/T13553","display_name":"Age of Information Optimization","score":0.00989999994635582,"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/queue","display_name":"Queue","score":0.675599992275238},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.6308000087738037},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.5307999849319458},{"id":"https://openalex.org/keywords/dynamic-priority-scheduling","display_name":"Dynamic priority scheduling","score":0.5105000138282776},{"id":"https://openalex.org/keywords/poisson-distribution","display_name":"Poisson distribution","score":0.4936999976634979},{"id":"https://openalex.org/keywords/holding-cost","display_name":"Holding cost","score":0.37369999289512634},{"id":"https://openalex.org/keywords/convex-optimization","display_name":"Convex optimization","score":0.37290000915527344}],"concepts":[{"id":"https://openalex.org/C160403385","wikidata":"https://www.wikidata.org/wiki/Q220543","display_name":"Queue","level":2,"score":0.675599992275238},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6730999946594238},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.6308000087738037},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5320000052452087},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.5307999849319458},{"id":"https://openalex.org/C107568181","wikidata":"https://www.wikidata.org/wiki/Q5319000","display_name":"Dynamic priority scheduling","level":3,"score":0.5105000138282776},{"id":"https://openalex.org/C100906024","wikidata":"https://www.wikidata.org/wiki/Q205692","display_name":"Poisson distribution","level":2,"score":0.4936999976634979},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3763999938964844},{"id":"https://openalex.org/C192365026","wikidata":"https://www.wikidata.org/wiki/Q5046829","display_name":"Holding cost","level":2,"score":0.37369999289512634},{"id":"https://openalex.org/C157972887","wikidata":"https://www.wikidata.org/wiki/Q463359","display_name":"Convex optimization","level":3,"score":0.37290000915527344},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.33640000224113464},{"id":"https://openalex.org/C151201525","wikidata":"https://www.wikidata.org/wiki/Q177239","display_name":"Limit (mathematics)","level":2,"score":0.334199994802475},{"id":"https://openalex.org/C3017960815","wikidata":"https://www.wikidata.org/wiki/Q1592638","display_name":"Heavy traffic","level":2,"score":0.32690000534057617},{"id":"https://openalex.org/C2779391423","wikidata":"https://www.wikidata.org/wiki/Q17009728","display_name":"Dynamic pricing","level":2,"score":0.3052999973297119},{"id":"https://openalex.org/C2780958618","wikidata":"https://www.wikidata.org/wiki/Q945621","display_name":"Average cost","level":2,"score":0.29919999837875366},{"id":"https://openalex.org/C2777382242","wikidata":"https://www.wikidata.org/wiki/Q6017816","display_name":"Index (typography)","level":2,"score":0.2985999882221222},{"id":"https://openalex.org/C111110010","wikidata":"https://www.wikidata.org/wiki/Q2627315","display_name":"Convex combination","level":4,"score":0.2870999872684479},{"id":"https://openalex.org/C28826006","wikidata":"https://www.wikidata.org/wiki/Q33521","display_name":"Applied mathematics","level":1,"score":0.2840999960899353},{"id":"https://openalex.org/C22684755","wikidata":"https://www.wikidata.org/wiki/Q847526","display_name":"Queueing theory","level":2,"score":0.27309998869895935}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/s11134-025-09961-2","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s11134-025-09961-2","pdf_url":"https://link.springer.com/content/pdf/10.1007/s11134-025-09961-2.pdf","source":{"id":"https://openalex.org/S148503350","display_name":"Queueing Systems","issn_l":"0257-0130","issn":["0257-0130","1572-9443"],"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","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Queueing Systems","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.1007/s11134-025-09961-2","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s11134-025-09961-2","pdf_url":"https://link.springer.com/content/pdf/10.1007/s11134-025-09961-2.pdf","source":{"id":"https://openalex.org/S148503350","display_name":"Queueing Systems","issn_l":"0257-0130","issn":["0257-0130","1572-9443"],"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","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Queueing Systems","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4417106564.pdf","grobid_xml":"https://content.openalex.org/works/W4417106564.grobid-xml"},"referenced_works_count":27,"referenced_works":["https://openalex.org/W210869371","https://openalex.org/W1965665090","https://openalex.org/W1995213871","https://openalex.org/W1996475996","https://openalex.org/W2009883375","https://openalex.org/W2015983186","https://openalex.org/W2040106856","https://openalex.org/W2044502527","https://openalex.org/W2056921512","https://openalex.org/W2140519736","https://openalex.org/W2151323275","https://openalex.org/W2159617688","https://openalex.org/W2255981264","https://openalex.org/W2295870161","https://openalex.org/W2439872401","https://openalex.org/W2467243923","https://openalex.org/W2511028367","https://openalex.org/W2606872978","https://openalex.org/W2762138693","https://openalex.org/W2966266146","https://openalex.org/W2984380590","https://openalex.org/W3123517799","https://openalex.org/W3204966604","https://openalex.org/W4238550457","https://openalex.org/W4361284723","https://openalex.org/W4391925936","https://openalex.org/W4402785288"],"related_works":[],"abstract_inverted_index":{"Abstract":[0],"We":[1],"consider":[2],"the":[3,44,62,85,128,138,152,164,171,178,201,207,217,226,247,255,268,274,283],"dynamic":[4,139,220],"scheduling":[5,100,140,221,270],"problem":[6,26,141,181],"in":[7,38,61,110,117,273,291],"a":[8,67,98,212],"multi-server":[9,82],"queue":[10],"with":[11,21,182,294],"Poisson":[12],"arrivals,":[13],"independent":[14],"service":[15,144,190,300],"times,":[16],"and":[17,56,71,156,267],"multiple":[18],"customer":[19],"classes":[20],"convex":[22,232],"delay":[23,233],"costs.":[24],"This":[25,114],"was":[27,115],"already":[28],"studied":[29,236],"by":[30,237],"van":[31],"Mieghem":[32],"(Ann":[33],"Appl":[34],"Probab":[35],"5:808\u2013833,":[36],"1995)":[37],"his":[39],"seminal":[40],"paper.":[41],"He":[42],"launched":[43],"generalized":[45,77,86,256],"$$c\\mu":[46,87,257],"$$":[47,88,258],"<mml:math":[48,89,259],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\">":[49,90,260],"<mml:mrow>":[50,91,261],"<mml:mi>c</mml:mi>":[51,92,262],"<mml:mi>\u03bc</mml:mi>":[52,93,263],"</mml:mrow>":[53,94,264],"</mml:math>":[54,95,265],"rule":[55,96,266],"proved":[57],"its":[58],"asymptotic":[59,79],"optimality":[60],"heavy":[63,103],"traffic":[64,112],"limit":[65],"for":[66,81,137,188,216,231],"single-server":[68,292],"system.":[69],"Mandelbaum":[70],"Stolyar":[72],"(Oper":[73],"Res":[74,122],"52:836\u2013855,":[75],"2004)":[76],"this":[78,147,241],"result":[80],"systems.":[83],"While":[84],"is":[97,159,185,235,288],"near-optimal":[99],"policy":[101,136,215,230,250,287],"under":[102],"traffic,":[104],"it":[105],"can":[106],"still":[107],"be":[108],"improved":[109],"normal":[111],"conditions.":[113],"demonstrated":[116],"Aalto":[118],"(Math":[119],"Methods":[120],"Oper":[121],"100:603\u2013634,":[123],"2024),":[124],"where":[125],"we":[126,149,175,195,210,244],"applied":[127],"Whittle":[129,153,203,228,248,285],"index":[130,135,154,214,229,249,286],"approach":[131],"to":[132,160],"develop":[133,211],"an":[134,197],"assuming":[142],"IHR":[143,166],"times.":[145,301],"In":[146,193,240],"paper,":[148],"continue":[150],"applying":[151,282],"approach,":[155],"our":[157],"aim":[158],"get":[161],"rid":[162],"of":[163,200,225],"restrictive":[165],"assumption":[167],"mentioned":[168],"above.":[169],"As":[170],"main":[172],"theoretical":[173],"contribution,":[174],"prove":[176],"that":[177,246,281,296],"corresponding":[179,202],"discrete-time":[180,208],"discounted":[183],"costs":[184,234],"indexable":[186],"even":[187],"non-IHR":[189],"time":[191],"distributions.":[192],"addition,":[194],"give":[196],"explicit":[198],"characterization":[199],"index.":[204],"By":[205],"utilizing":[206],"results,":[209],"novel":[213],"original":[218],"continuous-time":[219],"problem.":[222],"The":[223,276],"performance":[224],"developed":[227,284],"numerical":[238,242,277],"simulations.":[239],"study,":[243],"demonstrate":[245],"performs":[251],"systematically":[252],"better":[253],"than":[254],"other":[269],"policies":[271],"included":[272],"comparison.":[275],"results":[278],"also":[279],"hint":[280],"most":[289],"efficient":[290],"systems":[293],"customers":[295],"have":[297],"highly":[298],"varying":[299]},"counts_by_year":[],"updated_date":"2026-03-13T14:20:09.374765","created_date":"2025-12-08T00:00:00"}