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

Scheduling tasks with failure probabilities to minimize expected cost

Author

Listed:
  • Mordechai I. Henig
  • David Simchi‐Levi

Abstract

A project is made of several tasks which can be executed in parallel. Each task is associated with performance cost and failure probability. If all tasks succeed a reward is obtained. We suggest a dynamic programming algorithm to solve the problem of scheduling the tasks in order to maximize the expected discounted profit. We show that the general problem is NP‐complete, but that there are cases where the dynamic programming algorithm is polynomially bounded.

Suggested Citation

  • Mordechai I. Henig & David Simchi‐Levi, 1990. "Scheduling tasks with failure probabilities to minimize expected cost," Naval Research Logistics (NRL), John Wiley & Sons, vol. 37(1), pages 99-109, February.
    • Handle: RePEc:wly:navres:v:37:y:1990:i:1:p:99-109
    DOI: 10.1002/1520-6750(199002)37:13.0.CO;2-5
    as

    Download full text from publisher

    File URL: https://doi.org/10.1002/1520-6750(199002)37:13.0.CO;2-5
    Download Restriction: no
    File URL: https://libkey.io/10.1002/1520-6750(199002)37:13.0.CO;2-5?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. Clyde L. Monma & Jeffrey B. Sidney, 1979. "Sequencing with Series-Parallel Precedence Constraints," Mathematics of Operations Research, INFORMS, vol. 4(3), pages 215-224, August.
    2. Wayne E. Smith, 1956. "Various optimizers for single‐stage production," Naval Research Logistics Quarterly, John Wiley & Sons, vol. 3(1‐2), pages 59-66, March.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Mericcan Usta & Feryal Erhun & Warren H. Hausman, 2014. "Supply licensing when the manufacturer strategically commits to invest in R&D," Naval Research Logistics (NRL), John Wiley & Sons, vol. 61(4), pages 341-350, 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.
    1. Ben Hermans & Roel Leus & Jannik Matuschke, 2022. "Exact and Approximation Algorithms for the Expanding Search Problem," INFORMS Journal on Computing, INFORMS, vol. 34(1), pages 281-296, January.
    2. Murali Agastya & Oleksii Birulin, 2023. "Optimal Task Scheduling under Adverse Selection and Hidden Actions," American Economic Journal: Microeconomics, American Economic Association, vol. 15(2), pages 660-698, May.
    3. Robbert Fokkink & Thomas Lidbetter & László A. Végh, 2019. "On Submodular Search and Machine Scheduling," Management Science, INFORMS, vol. 44(4), pages 1431-1449, November.
    4. Lidbetter, Thomas, 2020. "Search and rescue in the face of uncertain threats," European Journal of Operational Research, Elsevier, vol. 285(3), pages 1153-1160.
    5. Stanisław Gawiejnowicz, 2020. "A review of four decades of time-dependent scheduling: main results, new topics, and open problems," Journal of Scheduling, Springer, vol. 23(1), pages 3-47, February.
    6. Agnetis, Alessandro & Hermans, Ben & Leus, Roel & Rostami, Salim, 2022. "Time-critical testing and search problems," European Journal of Operational Research, Elsevier, vol. 296(2), pages 440-452.
    7. Marieke Quant & Marc Meertens & Hans Reijnierse, 2008. "Processing games with shared interest," Annals of Operations Research, Springer, vol. 158(1), pages 219-228, February.
    8. José R. Correa & Maurice Queyranne, 2012. "Efficiency of equilibria in restricted uniform machine scheduling with total weighted completion time as social cost," Naval Research Logistics (NRL), John Wiley & Sons, vol. 59(5), pages 384-395, August.
    9. Qiuping Yu & Gad Allon & Achal Bassamboo & Seyed Iravani, 2018. "Managing Customer Expectations and Priorities in Service Systems," Management Science, INFORMS, vol. 64(8), pages 3942-3970, August.
    10. Lili Liu & Guochun Tang & Baoqiang Fan & Xingpeng Wang, 2015. "Two-person cooperative games on scheduling problems in outpatient pharmacy dispensing process," Journal of Combinatorial Optimization, Springer, vol. 30(4), pages 938-948, November.
    11. van Beek, Andries & Malmberg, Benjamin & Borm, Peter & Quant, Marieke & Schouten, Jop, 2021. "Cooperation and Competition in Linear Production and Sequencing Processes," Discussion Paper 2021-011, Tilburg University, Center for Economic Research.
    12. Gabriel Zayas‐Cabán & Emmett J. Lodree & David L. Kaufman, 2020. "Optimal Control of Parallel Queues for Managing Volunteer Convergence," Production and Operations Management, Production and Operations Management Society, vol. 29(10), pages 2268-2288, October.
    13. Kramer, Arthur & Dell’Amico, Mauro & Iori, Manuel, 2019. "Enhanced arc-flow formulations to minimize weighted completion time on identical parallel machines," European Journal of Operational Research, Elsevier, vol. 275(1), pages 67-79.
    14. C N Potts & V A Strusevich, 2009. "Fifty years of scheduling: a survey of milestones," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 60(1), pages 41-68, May.
    15. Nicholas G. Hall & Marc E. Posner & Chris N. Potts, 2021. "Online production planning to maximize the number of on-time orders," Annals of Operations Research, Springer, vol. 298(1), pages 249-269, March.
    16. Bachtenkirch, David & Bock, Stefan, 2022. "Finding efficient make-to-order production and batch delivery schedules," European Journal of Operational Research, Elsevier, vol. 297(1), pages 133-152.
    17. Reijnierse, Hans & Borm, Peter & Quant, Marieke & Meertens, Marc, 2010. "Processing games with restricted capacities," European Journal of Operational Research, Elsevier, vol. 202(3), pages 773-780, May.
    18. Xiangtong Qi, 2005. "A logistics scheduling model: Inventory cost reduction by batching," Naval Research Logistics (NRL), John Wiley & Sons, vol. 52(4), pages 312-320, June.
    19. Borm, Peter & Fiestras-Janeiro, Gloria & Hamers, Herbert & Sanchez, Estela & Voorneveld, Mark, 2002. "On the convexity of games corresponding to sequencing situations with due dates," European Journal of Operational Research, Elsevier, vol. 136(3), pages 616-634, February.
    20. Rubing Chen & Jinjiang Yuan, 2020. "Single-machine scheduling of proportional-linearly deteriorating jobs with positional due indices," 4OR, Springer, vol. 18(2), pages 177-196, June.

    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:37:y:1990:i:1:p:99-109. 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.