IDEAS home Printed from https://ideas.repec.org/a/spr/annopr/v298y2021i1d10.1007_s10479-018-2962-4.html
   My bibliography  Save this article

Optimal unrestricted dynamic stochastic scheduling with partial losses of work due to breakdowns

Author

Listed:
  • Xiaoqiang Cai

    (The Chinese University of Hong Kong
    The Shenzhen Research Institute of Big Data)

  • Xianyi Wu

    (East China Normal University)

  • Xian Zhou

    (Macquarie University)

Abstract

In this article, we discuss the optimal scheduling problem of the recently introduced model for partial loss due to machine breakdowns, which fills up a significant gap in the existing literature. More specifically, we consider the problem of processing a number of jobs with arbitrary random processing times by a machine subject to general stochastic breakdowns, where each breakdown may cause an uncertain loss of the work achieved on the job being processed. The objective is to maximize the expected weighted discounted reward of completing the jobs in the class of unrestricted dynamic policies. We obtain the optimal dynamic polices using multi-armed bandit process methodology, which are characterized by a set of Gittins indices as solutions to a system of integral equations. Optimal solutions for a number of problems with specific loss patterns are derived. Application of the theory to the classical no-loss model is also discussed which leads to new results.

Suggested Citation

  • Xiaoqiang Cai & Xianyi Wu & Xian Zhou, 2021. "Optimal unrestricted dynamic stochastic scheduling with partial losses of work due to breakdowns," Annals of Operations Research, Springer, vol. 298(1), pages 43-64, March.
    • Handle: RePEc:spr:annopr:v:298:y:2021:i:1:d:10.1007_s10479-018-2962-4
    DOI: 10.1007/s10479-018-2962-4
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10479-018-2962-4
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10479-018-2962-4?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
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Hongtao Zhang & Stephen C. Graves, 1997. "Cyclic Scheduling in a Stochastic Environment," Operations Research, INFORMS, vol. 45(6), pages 894-903, December.
    2. Herroelen, Willy & Leus, Roel, 2005. "Project scheduling under uncertainty: Survey and research potentials," European Journal of Operational Research, Elsevier, vol. 165(2), pages 289-306, September.
    3. Xiaoqiang Cai & Xianyi Wu & Xian Zhou, 2014. "Optimal Stochastic Scheduling," International Series in Operations Research and Management Science, Springer, edition 127, number 978-1-4899-7405-1, September.
    4. Kevin D. Glazebrook, 2005. "Optimal scheduling of tasks when service is subject to disruption: the preempt-repeat case," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 61(1), pages 147-169, March.
    5. Xiaoqiang Cai & Xian Zhou, 2000. "Asymmetric Earliness and Tardiness Scheduling with Exponential Processing Times on an Unreliable Machine," Annals of Operations Research, Springer, vol. 98(1), pages 313-331, December.
    6. J. Birge & J. B. G. Frenk & J. Mittenthal & A. H. G. Rinnooy Kan, 1990. "Single‐machine scheduling subject to stochastic breakdowns," Naval Research Logistics (NRL), John Wiley & Sons, vol. 37(5), pages 661-677, October.
    7. Sungmin Park & John W. Fowler & Gerald T. Mackulak & J. Bert Keats & W. Matthew Carlyle, 2002. "D-Optimal Sequential Experiments for Generating a Simulation-Based Cycle Time-Throughput Curve," Operations Research, INFORMS, vol. 50(6), pages 981-990, December.
    8. Xiaoqiang Cai & Xianyi Wu & Xian Zhou, 2009. "Stochastic Scheduling Subject to Preemptive-Repeat Breakdowns with Incomplete Information," Operations Research, INFORMS, vol. 57(5), pages 1236-1249, October.
    9. John Mittenthal & M. Raghavachari, 1993. "Stochastic Single Machine Scheduling with Quadratic Early-Tardy Penalties," Operations Research, INFORMS, vol. 41(4), pages 786-796, August.
    10. Xiaoqiang Cai & Xiaoqian Sun & Xian Zhou, 2004. "Stochastic scheduling subject to machine breakdowns: The preemptive‐repeat model with discounted reward and other criteria," Naval Research Logistics (NRL), John Wiley & Sons, vol. 51(6), pages 800-817, September.
    11. I. Adiri & E. Frostig & A. H. G. Rinnooy Kan, 1991. "Scheduling on a single machine with a single breakdown to minimize stochastically the number of tardy jobs," Naval Research Logistics (NRL), John Wiley & Sons, vol. 38(2), pages 261-271, April.
    12. Lee, Chung-Yee & Lin, Chen-Sin, 2001. "Single-machine scheduling with maintenance and repair rate-modifying activities," European Journal of Operational Research, Elsevier, vol. 135(3), pages 493-513, December.
    13. Stefan Thomke & David E. Bell, 2001. "Sequential Testing in Product Development," Management Science, INFORMS, vol. 47(2), pages 308-323, February.
    14. 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.
    15. Pinar Keskinocak & Frederick Wu & Richard Goodwin & Sesh Murthy & Rama Akkiraju & Santhosh Kumaran & Annap Derebail, 2002. "Scheduling Solutions for the Paper Industry," Operations Research, INFORMS, vol. 50(2), pages 249-259, April.
    16. Allahverdi, Ali & Ng, C.T. & Cheng, T.C.E. & Kovalyov, Mikhail Y., 2008. "A survey of scheduling problems with setup times or costs," European Journal of Operational Research, Elsevier, vol. 187(3), pages 985-1032, June.
    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. Xiaoqiang Cai & Xianyi Wu & Xian Zhou, 2009. "Stochastic Scheduling Subject to Preemptive-Repeat Breakdowns with Incomplete Information," Operations Research, INFORMS, vol. 57(5), pages 1236-1249, October.
    2. Xiaoqiang Cai & Xiaoqian Sun & Xian Zhou, 2004. "Stochastic scheduling subject to machine breakdowns: The preemptive‐repeat model with discounted reward and other criteria," Naval Research Logistics (NRL), John Wiley & Sons, vol. 51(6), pages 800-817, September.
    3. X. Cai & F. S. Tu, 1996. "Scheduling jobs with random processing times on a single machine subject to stochastic breakdowns to minimize early‐tardy penalties," Naval Research Logistics (NRL), John Wiley & Sons, vol. 43(8), pages 1127-1146, December.
    4. Meng, Lingyun & Zhou, Xuesong, 2011. "Robust single-track train dispatching model under a dynamic and stochastic environment: A scenario-based rolling horizon solution approach," Transportation Research Part B: Methodological, Elsevier, vol. 45(7), pages 1080-1102, August.
    5. Mauricio Diéguez & Jaime Bustos & Carlos Cares, 2020. "Mapping the variations for implementing information security controls to their operational research solutions," Information Systems and e-Business Management, Springer, vol. 18(2), pages 157-186, June.
    6. W J Chen, 2006. "Minimizing total flow time in the single-machine scheduling problem with periodic maintenance," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 57(4), pages 410-415, April.
    7. Zhenpeng Li & Congdian Cheng, 2023. "The Expected Competitive Ratio on a Kind of Stochastic-Online Flowtime Scheduling with Machine Subject to an Uncertain Breakdown," Mathematics, MDPI, vol. 11(11), pages 1-12, May.
    8. Ali Allahverdi & John Mittenthal, 1994. "Scheduling on M parallel machines subject to random breakdowns to minimize expected mean flow time," Naval Research Logistics (NRL), John Wiley & Sons, vol. 41(5), pages 677-682, August.
    9. Chen, Wen-Jinn, 2009. "Minimizing number of tardy jobs on a single machine subject to periodic maintenance," Omega, Elsevier, vol. 37(3), pages 591-599, June.
    10. Yanıkoğlu, İhsan & Yavuz, Tonguc, 2022. "Branch-and-price approach for robust parallel machine scheduling with sequence-dependent setup times," European Journal of Operational Research, Elsevier, vol. 301(3), pages 875-895.
    11. Dutta, Kaushik & VanderMeer, Debra, 2011. "Cost-based decision-making in middleware virtualization environments," European Journal of Operational Research, Elsevier, vol. 210(2), pages 344-357, April.
    12. Umar M. Al‐Turki & John Mittenthal & M. Raghavachari, 1996. "The single‐machine absolute‐deviation early‐tardy problem with random completion times," Naval Research Logistics (NRL), John Wiley & Sons, vol. 43(4), pages 573-587, June.
    13. Weglarz, Jan & Józefowska, Joanna & Mika, Marek & Waligóra, Grzegorz, 2011. "Project scheduling with finite or infinite number of activity processing modes - A survey," European Journal of Operational Research, Elsevier, vol. 208(3), pages 177-205, February.
    14. Yarlin Kuo & Zi‐Ann Chang, 2007. "Integrated production scheduling and preventive maintenance planning for a single machine under a cumulative damage failure process," Naval Research Logistics (NRL), John Wiley & Sons, vol. 54(6), pages 602-614, September.
    15. Yin, Yunqiang & Luo, Zunhao & Wang, Dujuan & Cheng, T.C.E., 2023. "Wasserstein distance‐based distributionally robust parallel‐machine scheduling," Omega, Elsevier, vol. 120(C).
    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. Mauricio Diéguez & Jaime Bustos & Carlos Cares, 0. "Mapping the variations for implementing information security controls to their operational research solutions," Information Systems and e-Business Management, Springer, vol. 0, pages 1-30.
    18. Javad Rezaeian & Reza Alizadeh Foroutan & Toraj Mojibi & Yacob Khojasteh, 2023. "Sensitivity Analysis of the Unrelated Parallel Machine Scheduling Problem with Rework Processes and Machine Eligibility Restrictions," SN Operations Research Forum, Springer, vol. 4(3), pages 1-24, September.
    19. Magni, Carlo Alberto, 2015. "Investment, financing and the role of ROA and WACC in value creation," European Journal of Operational Research, Elsevier, vol. 244(3), pages 855-866.
    20. Amanda O. C. Ayres & Betania S. C. Campello & Washington A. Oliveira & Carla T. L. S. Ghidini, 2021. "A Bi-Integrated Model for coupling lot-sizing and cutting-stock problems," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 43(4), pages 1047-1076, December.

    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:spr:annopr:v:298:y:2021:i:1:d:10.1007_s10479-018-2962-4. 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.

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