{"id":"https://openalex.org/W4225611726","doi":"https://doi.org/10.1007/s11134-022-09760-z","title":"On the Gittins index for multistage jobs","display_name":"On the Gittins index for multistage jobs","publication_year":2022,"publication_date":"2022-04-07","ids":{"openalex":"https://openalex.org/W4225611726","doi":"https://doi.org/10.1007/s11134-022-09760-z"},"language":"en","primary_location":{"id":"doi:10.1007/s11134-022-09760-z","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s11134-022-09760-z","pdf_url":"https://link.springer.com/content/pdf/10.1007/s11134-022-09760-z.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-022-09760-z.pdf","any_repository_has_fulltext":true},"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 Communications and Networking, Aalto University, Espoo, Finland"],"affiliations":[{"raw_affiliation_string":"Department of Communications and Networking, Aalto University, Espoo, Finland","institution_ids":["https://openalex.org/I9927081"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5014560251","display_name":"Ziv Scully","orcid":"https://orcid.org/0000-0002-8547-1068"},"institutions":[{"id":"https://openalex.org/I74973139","display_name":"Carnegie Mellon University","ror":"https://ror.org/05x2bcf33","country_code":"US","type":"education","lineage":["https://openalex.org/I74973139"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Ziv Scully","raw_affiliation_strings":["Computer Science Department, Carnegie Mellon University, Pittsburgh, PA, USA","Computer Science Department, Carnegie Mellon University, Pittsburgh, USA"],"affiliations":[{"raw_affiliation_string":"Computer Science Department, Carnegie Mellon University, Pittsburgh, PA, USA","institution_ids":["https://openalex.org/I74973139"]},{"raw_affiliation_string":"Computer Science Department, Carnegie Mellon University, Pittsburgh, USA","institution_ids":["https://openalex.org/I74973139"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"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.2061,"has_fulltext":true,"cited_by_count":1,"citation_normalized_percentile":{"value":0.52469869,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"102","issue":"3-4","first_page":"353","last_page":"371"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10974","display_name":"Advanced Queuing Theory Analysis","score":0.9998000264167786,"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.9998000264167786,"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.9958000183105469,"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/T12288","display_name":"Optimization and Search Problems","score":0.9919999837875366,"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/recursion","display_name":"Recursion (computer science)","score":0.573573887348175},{"id":"https://openalex.org/keywords/queue","display_name":"Queue","score":0.5369925498962402},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5135934352874756},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5046936273574829},{"id":"https://openalex.org/keywords/queueing-theory","display_name":"Queueing theory","score":0.4892134666442871},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.48585864901542664},{"id":"https://openalex.org/keywords/sequence","display_name":"Sequence (biology)","score":0.4617571532726288},{"id":"https://openalex.org/keywords/index","display_name":"Index (typography)","score":0.419364869594574},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.39519116282463074},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.22841641306877136}],"concepts":[{"id":"https://openalex.org/C168773036","wikidata":"https://www.wikidata.org/wiki/Q264164","display_name":"Recursion (computer science)","level":2,"score":0.573573887348175},{"id":"https://openalex.org/C160403385","wikidata":"https://www.wikidata.org/wiki/Q220543","display_name":"Queue","level":2,"score":0.5369925498962402},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5135934352874756},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5046936273574829},{"id":"https://openalex.org/C22684755","wikidata":"https://www.wikidata.org/wiki/Q847526","display_name":"Queueing theory","level":2,"score":0.4892134666442871},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.48585864901542664},{"id":"https://openalex.org/C2778112365","wikidata":"https://www.wikidata.org/wiki/Q3511065","display_name":"Sequence (biology)","level":2,"score":0.4617571532726288},{"id":"https://openalex.org/C2777382242","wikidata":"https://www.wikidata.org/wiki/Q6017816","display_name":"Index (typography)","level":2,"score":0.419364869594574},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.39519116282463074},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.22841641306877136},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C54355233","wikidata":"https://www.wikidata.org/wiki/Q7162","display_name":"Genetics","level":1,"score":0.0},{"id":"https://openalex.org/C136764020","wikidata":"https://www.wikidata.org/wiki/Q466","display_name":"World Wide Web","level":1,"score":0.0},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1007/s11134-022-09760-z","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s11134-022-09760-z","pdf_url":"https://link.springer.com/content/pdf/10.1007/s11134-022-09760-z.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"},{"id":"pmh:oai:RePEc:spr:queues:v:102:y:2022:i:3:d:10.1007_s11134-022-09760-z","is_oa":false,"landing_page_url":"http://link.springer.com/10.1007/s11134-022-09760-z","pdf_url":null,"source":{"id":"https://openalex.org/S4306401271","display_name":"RePEc: Research Papers in Economics","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I77793887","host_organization_name":"Federal Reserve Bank of St. Louis","host_organization_lineage":["https://openalex.org/I77793887"],"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":"article"},{"id":"pmh:oai:aaltodoc.aalto.fi:123456789/117867","is_oa":true,"landing_page_url":"https://research.aalto.fi/en/publications/c3684218-7020-4091-a935-c2260c56a83a","pdf_url":null,"source":{"id":"https://openalex.org/S4306401662","display_name":"Aaltodoc (Aalto University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I9927081","host_organization_name":"Aalto University","host_organization_lineage":["https://openalex.org/I9927081"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"publishedVersion"}],"best_oa_location":{"id":"doi:10.1007/s11134-022-09760-z","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s11134-022-09760-z","pdf_url":"https://link.springer.com/content/pdf/10.1007/s11134-022-09760-z.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":[{"score":0.4699999988079071,"id":"https://metadata.un.org/sdg/8","display_name":"Decent work and economic growth"}],"awards":[{"id":"https://openalex.org/G1288077169","display_name":null,"funder_award_id":"CMMI-1938909","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G4586274889","display_name":"Optimal Scheduling of Parallelizable Jobs in Cloud Computing Environments","funder_award_id":"1938909","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G5954070948","display_name":null,"funder_award_id":"CMMI-","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G8150508757","display_name":null,"funder_award_id":"CSR-1763701","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"},{"id":"https://openalex.org/F4320321394","display_name":"Aalto-Yliopisto","ror":"https://ror.org/020hwjq30"},{"id":"https://openalex.org/F4320337391","display_name":"Division of Civil, Mechanical and Manufacturing Innovation","ror":"https://ror.org/028yd4c30"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4225611726.pdf","grobid_xml":"https://content.openalex.org/works/W4225611726.grobid-xml"},"referenced_works_count":17,"referenced_works":["https://openalex.org/W1524486678","https://openalex.org/W2014589089","https://openalex.org/W2028301248","https://openalex.org/W2030311589","https://openalex.org/W2040106856","https://openalex.org/W2057181384","https://openalex.org/W2058737022","https://openalex.org/W2098727607","https://openalex.org/W2106993434","https://openalex.org/W2109752811","https://openalex.org/W2116693974","https://openalex.org/W2140519736","https://openalex.org/W2499002200","https://openalex.org/W3204966604","https://openalex.org/W4225611726","https://openalex.org/W4254113915","https://openalex.org/W4254549667"],"related_works":["https://openalex.org/W2020328098","https://openalex.org/W4307705789","https://openalex.org/W2055520496","https://openalex.org/W2034049424","https://openalex.org/W2137580978","https://openalex.org/W2030120134","https://openalex.org/W2022738718","https://openalex.org/W2565612488","https://openalex.org/W2312788649","https://openalex.org/W3207085310"],"abstract_inverted_index":{"Abstract":[0],"Optimal":[1],"scheduling":[2,183],"in":[3,11,30,103],"single-server":[4],"queueing":[5,12],"systems":[6],"is":[7,18,38,46,53,149,199],"a":[8,67,87,138],"classic":[9],"problem":[10],"theory.":[13],"The":[14,98],"Gittins":[15,36,84,124,154,161,204],"index":[16,37,85,125,155,205],"policy":[17,25],"known":[19],"to":[20,151,201],"be":[21],"the":[22,27,31,35,49,57,81,95,104,110,123,153,160,174,177,188,203,208],"optimal":[23],"nonanticipating":[24],"minimizing":[26],"mean":[28],"delay":[29],"M/G/1":[32],"queue.":[33],"While":[34],"thoroughly":[39],"characterized":[40],"for":[41,94,112,122,146,173,182,194],"ordinary":[42],"jobs":[43,60],"whose":[44],"state":[45],"described":[47],"by":[48,157,206],"attained":[50],"service,":[51],"it":[52,77,107,148,198],"not":[54,121],"at":[55],"all":[56],"case":[58],"with":[59],"that":[61,80,106],"have":[62,137],"more":[63],"complex":[64],"structure.":[65],"Recently,":[66],"class":[68],"of":[69,83,86,141,163,176],"such":[70],"jobs,":[71,73,135,197],"multistage":[72,88,134,185,196],"were":[74],"introduced,":[75],"and":[76,120,143,179],"was":[78],"shown":[79],"computation":[82],"job":[89],"decomposes":[90],"into":[91],"separable":[92],"computations":[93],"individual":[96,165],"stages.":[97,166],"characterization":[99],"is,":[100],"however,":[101],"indirect":[102],"sense":[105],"relies":[108],"on":[109,132],"recursion":[111],"an":[113],"auxiliary":[114],"function":[115],"(the":[116],"so-called":[117],"SJP\u2014single-job":[118],"profit\u2014function)":[119],"itself.":[126],"In":[127,167],"this":[128],"paper,":[129],"we":[130,169,191],"focus":[131],"sequential":[133,184],"which":[136],"fixed":[139],"sequence":[140],"stages,":[142],"prove":[144],"that,":[145,193],"them,":[147],"possible":[150],"compute":[152,202],"directly":[156],"recursively":[158],"combining":[159],"indices":[162],"its":[164],"addition,":[168],"give":[170],"sufficient":[171],"conditions":[172],"optimality":[175],"FCFS":[178],"SERPT":[180],"disciplines":[181],"jobs.":[186],"On":[187],"other":[189],"hand,":[190],"demonstrate":[192],"nonsequential":[195],"better":[200],"utilizing":[207],"SJP":[209],"functions.":[210]},"counts_by_year":[{"year":2022,"cited_by_count":1}],"updated_date":"2026-04-01T17:29:45.350535","created_date":"2025-10-10T00:00:00"}