IDEAS home Printed from https://ideas.repec.org/a/inm/oropre/v43y1995i5p838-850.html
   My bibliography  Save this article

Bounds on Expected Project Tardiness

Author

Listed:
  • John R. Birge

    (University of Michigan, Ann Arbor, Michigan)

  • Marilyn J. Maddox

    (Ford Motor Company, Dearborn, Michigan)

Abstract

A frequent goal in scheduling projects and production operations is determining the financial impact of project duration or production lead time. This paper considers net project value effects that increase proportionally to time in excess of a deadline. New bounds on the expected value of these tardiness costs are given. The bounds provide robust measurements without requiring extensive assumptions about activity distributions.

Suggested Citation

  • John R. Birge & Marilyn J. Maddox, 1995. "Bounds on Expected Project Tardiness," Operations Research, INFORMS, vol. 43(5), pages 838-850, October.
    • Handle: RePEc:inm:oropre:v:43:y:1995:i:5:p:838-850
    DOI: 10.1287/opre.43.5.838
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/opre.43.5.838
    Download Restriction: no
    File URL: https://libkey.io/10.1287/opre.43.5.838?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
    ---><---

    Citations

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


    Cited by:

    1. Ho-Yin Mak & Ying Rong & Jiawei Zhang, 2015. "Appointment Scheduling with Limited Distributional Information," Management Science, INFORMS, vol. 61(2), pages 316-334, February.
    2. Jorgensen, Trond & Wallace, Stein W., 2000. "Improving project cost estimation by taking into account managerial flexibility," European Journal of Operational Research, Elsevier, vol. 127(2), pages 239-251, December.
    3. Karthik Natarajan & Dongjian Shi & Kim-Chuan Toh, 2014. "A Probabilistic Model for Minmax Regret in Combinatorial Optimization," Operations Research, INFORMS, vol. 62(1), pages 160-181, February.
    4. Davaadorjin Monhor, 2011. "A new probabilistic approach to the path criticality in stochastic PERT," Central European Journal of Operations Research, Springer;Slovak Society for Operations Research;Hungarian Operational Research Society;Czech Society for Operations Research;Österr. Gesellschaft für Operations Research (ÖGOR);Slovenian Society Informatika - Section for Operational Research;Croatian Operational Research Society, vol. 19(4), pages 615-633, December.
    5. Li, Xiaobo & Natarajan, Karthik & Teo, Chung-Piaw & Zheng, Zhichao, 2014. "Distributionally robust mixed integer linear programs: Persistency models with applications," European Journal of Operational Research, Elsevier, vol. 233(3), pages 459-473.
    6. Vo[ss], Stefan & Witt, Andreas, 2007. "Hybrid flow shop scheduling as a multi-mode multi-project scheduling problem with batching requirements: A real-world application," International Journal of Production Economics, Elsevier, vol. 105(2), pages 445-458, February.
    7. Pieter Kleer & Johan van Leeuwaarden, 2022. "Optimal Stopping Theory for a Distributionally Robust Seller," Papers 2206.02477, arXiv.org, revised Jun 2022.
    8. Xuan Vinh Doan & Karthik Natarajan, 2012. "On the Complexity of Nonoverlapping Multivariate Marginal Bounds for Probabilistic Combinatorial Optimization Problems," Operations Research, INFORMS, vol. 60(1), pages 138-149, February.

    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:inm:oropre:v:43:y:1995:i:5:p:838-850. 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.

    We have no bibliographic references for this item. You can help adding them by using 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: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    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.