IDEAS home Printed from https://ideas.repec.org/a/wly/navres/v62y2015i8p659-663.html
   My bibliography  Save this article

A sequential scheduling problem with impatient jobs

Author

Listed:
  • Sheldon M. Ross

Abstract

There are n customers that need to be served. Customer i will only wait in queue for an exponentially distributed time with rate λi before departing the system. The service time of customer i has distribution Fi, and on completion of service of customer i a positive reward ri is earned. There is a single server and the problem is to choose, after each service completion, which currently in queue customer to serve next so as to maximize the expected total return. © 2015 Wiley Periodicals, Inc. Naval Research Logistics 62: 659–663, 2015

Suggested Citation

  • Sheldon M. Ross, 2015. "A sequential scheduling problem with impatient jobs," Naval Research Logistics (NRL), John Wiley & Sons, vol. 62(8), pages 659-663, December.
    • Handle: RePEc:wly:navres:v:62:y:2015:i:8:p:659-663
    DOI: 10.1002/nav.21670
    as

    Download full text from publisher

    File URL: https://doi.org/10.1002/nav.21670
    Download Restriction: no
    File URL: https://libkey.io/10.1002/nav.21670?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    References listed on IDEAS

    as
    1. Michael Pinedo, 1983. "Stochastic Scheduling with Release Dates and Due Dates," Operations Research, INFORMS, vol. 31(3), pages 559-572, June.
    2. Donald R. Smith, 1978. "Optimal Repair of a Series System," Operations Research, INFORMS, vol. 26(4), pages 653-662, August.
    3. Michael N. Katehakis & Cyrus Derman, 1984. "Optimal Repair Allocation in a Series System," Mathematics of Operations Research, INFORMS, vol. 9(4), pages 615-623, November.
    4. K.D. Glazebrook & H.M. Mitchell, 2002. "An index policy for a stochastic scheduling model with improving/deteriorating jobs," Naval Research Logistics (NRL), John Wiley & Sons, vol. 49(7), pages 706-721, October.
    Full references (including those not matched with items on IDEAS)

    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.
    1. Frostig, Esther, 1999. "Jointly optimal allocation of a repairman and optimal control of service rate for machine repairman problem," European Journal of Operational Research, Elsevier, vol. 116(2), pages 274-280, July.
    2. Slotnick, Susan A., 2011. "Order acceptance and scheduling: A taxonomy and review," European Journal of Operational Research, Elsevier, vol. 212(1), pages 1-11, July.
    3. Brian C. Dean & Michel X. Goemans & Jan Vondrák, 2008. "Approximating the Stochastic Knapsack Problem: The Benefit of Adaptivity," Mathematics of Operations Research, INFORMS, vol. 33(4), pages 945-964, November.
    4. Setareh Boshrouei Shargh & Mostafa Zandieh & Ashkan Ayough & Farbod Farhadi, 2024. "Scheduling in services: a review and bibliometric analysis," Operations Management Research, Springer, vol. 17(2), pages 754-783, June.
    5. Nicolas Gast & Bruno Gaujal & Kimang Khun, 2023. "Testing indexability and computing Whittle and Gittins index in subcubic time," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 97(3), pages 391-436, June.
    6. Golenko-Ginzburg, Dimitri & Gonik, Aharon, 2002. "Optimal job-shop scheduling with random operations and cost objectives," International Journal of Production Economics, Elsevier, vol. 76(2), pages 147-157, March.
    7. Marbán Sebastián & Rutten Cyriel & Vredeveld Tjark, 2010. "Asymptotic optimality of SEPT in Bayesian Scheduling," Research Memorandum 051, Maastricht University, Maastricht Research School of Economics of Technology and Organization (METEOR).
    8. Mark Brown, 2013. "Sharp bounds for NBUE distributions," Annals of Operations Research, Springer, vol. 208(1), pages 245-250, September.
    9. Zhankun Sun & Nilay Tanık Argon & Serhan Ziya, 2022. "When to Triage in Service Systems with Hidden Customer Class Identities?," Production and Operations Management, Production and Operations Management Society, vol. 31(1), pages 172-193, January.
    10. Yeek-Hyun Kim & Lyn Thomas, 2013. "Training and repair policies for stand-by systems," Annals of Operations Research, Springer, vol. 208(1), pages 469-487, September.
    11. Zhankun Sun & Nilay Tan?k Argon & Serhan Ziya, 2018. "Patient Triage and Prioritization Under Austere Conditions," Management Science, INFORMS, vol. 64(10), pages 4471-4489, October.
    12. Michael Katehakis & Ingram Olkin & Sheldon Ross & Jian Yang, 2013. "On the life and work of Cyrus Derman," Annals of Operations Research, Springer, vol. 208(1), pages 5-26, September.
    13. Drent, Collin & Keizer, Minou Olde & Houtum, Geert-Jan van, 2020. "Dynamic dispatching and repositioning policies for fast-response service networks," European Journal of Operational Research, Elsevier, vol. 285(2), pages 583-598.
    14. Yin, Yunqiang & Luo, Zunhao & Wang, Dujuan & Cheng, T.C.E., 2023. "Wasserstein distance‐based distributionally robust parallel‐machine scheduling," Omega, Elsevier, vol. 120(C).
    15. Jonathan Bard & David Morton & Yong Wang, 2007. "Workforce planning at USPS mail processing and distribution centers using stochastic optimization," Annals of Operations Research, Springer, vol. 155(1), pages 51-78, November.
    16. Xiaoqiang Cai & Sean Zhou, 1999. "Stochastic Scheduling on Parallel Machines Subject to Random Breakdowns to Minimize Expected Costs for Earliness and Tardy Jobs," Operations Research, INFORMS, vol. 47(3), pages 422-437, June.
    17. Huiyin Ouyang & Nilay Taník Argon & Serhan Ziya, 2022. "Assigning Priorities (or Not) in Service Systems with Nonlinear Waiting Costs," Management Science, INFORMS, vol. 68(2), pages 1233-1255, February.
    18. Maciej Drwal & Jerzy Józefczyk, 2020. "Robust min–max regret scheduling to minimize the weighted number of late jobs with interval processing times," Annals of Operations Research, Springer, vol. 284(1), pages 263-282, January.
    19. Xu Yong & Liu Jian & Ma Baomei & Zhang Shuai, 2018. "Service Mechanism and Pricing Based on Fairness Preference of Customers in Queuing System," Journal of Systems Science and Information, De Gruyter, vol. 6(6), pages 481-494, December.
    20. Jonathan Turner & Soonhui Lee & Mark Daskin & Tito Homem-de-Mello & Karen Smilowitz, 2012. "Dynamic fleet scheduling with uncertain demand and customer flexibility," Computational Management Science, Springer, vol. 9(4), pages 459-481, November.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    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:wly:navres:v:62:y:2015:i:8:p:659-663. 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: Wiley Content Delivery (email available below). General contact details of provider: https://doi.org/10.1002/(ISSN)1520-6750 .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.