On the Gittins index for multistage jobs
Author
Abstract
Suggested Citation
DOI: 10.1007/s11134-022-09760-z
Download full text from publisher
As the access to this document is restricted, you may want to search for a different version of it.
References listed on IDEAS
- Donald R. Smith, 1978. "Technical Note—A New Proof of the Optimality of the Shortest Remaining Processing Time Discipline," Operations Research, INFORMS, vol. 26(1), pages 197-199, February.
- Izak Duenyas & Diwakar Gupta & Tava Lennon Olsen, 1998. "Control of a Single-Server Tandem Queueing System with Setups," Operations Research, INFORMS, vol. 46(2), pages 218-230, April.
- Peter Whittle, 2002. "Applied Probability in Great Britain," Operations Research, INFORMS, vol. 50(1), pages 227-239, February.
- Linus Schrage, 1968. "Letter to the Editor—A Proof of the Optimality of the Shortest Remaining Processing Time Discipline," Operations Research, INFORMS, vol. 16(3), pages 687-690, June.
Most related items
These are the items that most often cite the same works as this one and are cited by the same works as this one.- Chen, Rubing & Yuan, Jinjiang & Ng, C.T. & Cheng, T.C.E., 2021. "Single-machine hierarchical scheduling with release dates and preemption to minimize the total completion time and a regular criterion," European Journal of Operational Research, Elsevier, vol. 293(1), pages 79-92.
- Samuli Aalto & Ziv Scully, 2023. "Minimizing the mean slowdown in the M/G/1 queue," Queueing Systems: Theory and Applications, Springer, vol. 104(3), pages 187-210, August.
- Samuli Aalto & Urtzi Ayesta, 2009. "SRPT applied to bandwidth-sharing networks," Annals of Operations Research, Springer, vol. 170(1), pages 3-19, September.
- Yonatan Shadmi, 2022. "Fluid limits for shortest job first with aging," Queueing Systems: Theory and Applications, Springer, vol. 101(1), pages 93-112, June.
- Łukasz Kruk & Ewa Sokołowska, 2016. "Fluid Limits for Multiple-Input Shortest Remaining Processing Time Queues," Mathematics of Operations Research, INFORMS, vol. 41(3), pages 1055-1092, August.
- Thomas Kittsteiner & Benny Moldovanu, 2005.
"Priority Auctions and Queue Disciplines That Depend on Processing Time,"
Management Science, INFORMS, vol. 51(2), pages 236-248, February.
- Kittsteiner, Thomas & Moldovanu, Benny, 2004. "Priority Auctions and Queue Disciplines that Depend on Processing Time," Discussion Paper Series of SFB/TR 15 Governance and the Efficiency of Economic Systems 5, Free University of Berlin, Humboldt University of Berlin, University of Bonn, University of Mannheim, University of Munich.
- Samuli Aalto, 2006. "M/G/1/MLPS compared with M/G/1/PS within service time distribution class IMRL," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 64(2), pages 309-325, October.
- Jin Xu & Natarajan Gautam, 2020. "On competitive analysis for polling systems," Naval Research Logistics (NRL), John Wiley & Sons, vol. 67(6), pages 404-419, September.
- Mor Harchol-Balter, 2021. "Open problems in queueing theory inspired by datacenter computing," Queueing Systems: Theory and Applications, Springer, vol. 97(1), pages 3-37, February.
- Legros, Benjamin & Jouini, Oualid & Akşin, O. Zeynep & Koole, Ger, 2020. "Front-office multitasking between service encounters and back-office tasks," European Journal of Operational Research, Elsevier, vol. 287(3), pages 946-963.
- Chengbin Chu, 1992. "A branch‐and‐bound algorithm to minimize total tardiness with different release dates," Naval Research Logistics (NRL), John Wiley & Sons, vol. 39(2), pages 265-283, March.
- Ramesh Arumugam & Maria Mayorga & Kevin Taaffe, 2009. "Inventory based allocation policies for flexible servers in serial systems," Annals of Operations Research, Springer, vol. 172(1), pages 1-23, November.
- Eser Kırkızlar & Sigrún Andradóttir & Hayriye Ayhan, 2010. "Robustness of efficient server assignment policies to service time distributions in finite‐buffered lines," Naval Research Logistics (NRL), John Wiley & Sons, vol. 57(6), pages 563-582, September.
- Luca Becchetti & Stefano Leonardi & Alberto Marchetti-Spaccamela & Guido Schäfer & Tjark Vredeveld, 2006. "Average-Case and Smoothed Competitive Analysis of the Multilevel Feedback Algorithm," Mathematics of Operations Research, INFORMS, vol. 31(1), pages 85-108, February.
- Seyed M. R. Iravani & John A. Buzacott & Morton J. M. Posner, 2003. "Operations and Shipment Scheduling of a Batch on a Felxible Machine," Operations Research, INFORMS, vol. 51(4), pages 585-601, August.
- Yi‐Chun Tsai & Nilay Tanık Argon, 2008. "Dynamic server assignment policies for assembly‐type queues with flexible servers," Naval Research Logistics (NRL), John Wiley & Sons, vol. 55(3), pages 234-251, April.
- Samuli Aalto & Pasi Lassila & Prajwal Osti, 2016. "Whittle index approach to size-aware scheduling for time-varying channels with multiple states," Queueing Systems: Theory and Applications, Springer, vol. 83(3), pages 195-225, August.
- Nikhil Bansal & Bart Kamphorst & Bert Zwart, 2018. "Achievable Performance of Blind Policies in Heavy Traffic," Mathematics of Operations Research, INFORMS, vol. 43(3), pages 949-964, August.
- Tuğçe Işık & Sigrún Andradóttir & Hayriye Ayhan, 2022. "Dynamic Control of Non‐Collaborative Workers When Reassignment Is Costly," Production and Operations Management, Production and Operations Management Society, vol. 31(3), pages 1332-1352, March.
- Peng Wang & Kai Pan & Zhenzhen Yan & Yun Fong Lim, 2022. "Managing Stochastic Bucket Brigades on Discrete Work Stations," Production and Operations Management, Production and Operations Management Society, vol. 31(1), pages 358-373, January.
More about this item
Keywords
Optimal scheduling; Multistage job; Gittins index; Stochastic optimization; M/G/1;All these keywords.
Statistics
Access and download statisticsCorrections
All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:queues:v:102:y:2022:i:3:d:10.1007_s11134-022-09760-z. See general information about how to correct material in RePEc.
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .
Please note that corrections may take a couple of weeks to filter through the various RePEc services.