IDEAS home Printed from https://ideas.repec.org/a/eee/proeco/v64y2000i1-3p153-164.html
   My bibliography  Save this article

Optimal start times under stochastic activity durations

Author

Listed:
  • Elmaghraby, S. E.
  • Ferreira, A. A.
  • Tavares, L. V.

Abstract

No abstract is available for this item.

Suggested Citation

  • Elmaghraby, S. E. & Ferreira, A. A. & Tavares, L. V., 2000. "Optimal start times under stochastic activity durations," International Journal of Production Economics, Elsevier, vol. 64(1-3), pages 153-164, March.
    • Handle: RePEc:eee:proeco:v:64:y:2000:i:1-3:p:153-164
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0925-5273(99)00054-7
    Download Restriction: Full text for ScienceDirect subscribers only
    ---><---

    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. Thom J. Hodgson & Russell E. King & Paul M. Stanfield, 1997. "Ready-Time Scheduling with Stochastic Service Times," Operations Research, INFORMS, vol. 45(5), pages 779-783, October.
    2. Arnold H. Buss & Meir J. Rosenblatt, 1997. "Activity Delay in Stochastic Project Networks," Operations Research, INFORMS, vol. 45(1), pages 126-139, February.
    3. Elmaghraby, Salah E. & Herroelen, Willy S., 1990. "The scheduling of activities to maximize the net present value of projects," European Journal of Operational Research, Elsevier, vol. 49(1), pages 35-49, November.
    4. V. G. Kulkarni & V. G. Adlakha, 1986. "Markov and Markov-Regenerative pert Networks," Operations Research, INFORMS, vol. 34(5), pages 769-781, October.
    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. Laslo, Zohar & Golenko-Ginzburg, Dimitri & Keren, Baruch, 2008. "Optimal booking of machines in a virtual job-shop with stochastic processing times to minimize total machine rental and job tardiness costs," International Journal of Production Economics, Elsevier, vol. 111(2), pages 812-821, February.
    2. Illana Bendavid & Boaz Golany, 2009. "Setting gates for activities in the stochastic project scheduling problem through the cross entropy methodology," Annals of Operations Research, Springer, vol. 172(1), pages 259-276, November.
    3. Illana Bendavid & Boaz Golany, 2011. "Setting gates for activities in the stochastic project scheduling problem through the cross entropy methodology," Annals of Operations Research, Springer, vol. 189(1), pages 25-42, September.
    4. Illana Bendavid & Yariv N. Marmor & Boris Shnits, 2018. "Developing an optimal appointment scheduling for systems with rigid standby time under pre-determined quality of service," Flexible Services and Manufacturing Journal, Springer, vol. 30(1), pages 54-77, June.
    5. Song, Dong-Ping, 2006. "Raw material release time control for complex make-to-order products with stochastic processing times," International Journal of Production Economics, Elsevier, vol. 103(1), pages 371-385, September.
    6. Azaron, Amir & Katagiri, Hideki & Kato, Kosuke & Sakawa, Masatoshi, 2006. "Modelling complex assemblies as a queueing network for lead time control," European Journal of Operational Research, Elsevier, vol. 174(1), pages 150-168, October.
    7. Illana Bendavid & Boaz Golany, 2011. "Predetermined intervals for start times of activities in the stochastic project scheduling problem," Annals of Operations Research, Springer, vol. 186(1), pages 429-442, June.
    8. Li, Haitao & Womer, Norman K., 2015. "Solving stochastic resource-constrained project scheduling problems by closed-loop approximate dynamic programming," European Journal of Operational Research, Elsevier, vol. 246(1), pages 20-33.
    9. Song, D. P. & Hicks, C. & Earl, C. F., 2002. "Product due date assignment for complex assemblies," International Journal of Production Economics, Elsevier, vol. 76(3), pages 243-256, April.
    10. Siqian Shen & J. Cole Smith & Shabbir Ahmed, 2010. "Expectation and Chance-Constrained Models and Algorithms for Insuring Critical Paths," Management Science, INFORMS, vol. 56(10), pages 1794-1814, October.
    11. Shnits, Boris & Bendavid, Illana & Marmor, Yariv N., 2020. "An appointment scheduling policy for healthcare systems with parallel servers and pre-determined quality of service," Omega, Elsevier, vol. 97(C).

    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. Elmaghraby, Salah E., 2001. "On the optimal release time of jobs with random processing times, with extensions to other criteria," International Journal of Production Economics, Elsevier, vol. 74(1-3), pages 103-113, December.
    2. Wiesemann, Wolfram & Kuhn, Daniel & Rustem, Berç, 2010. "Maximizing the net present value of a project under uncertainty," European Journal of Operational Research, Elsevier, vol. 202(2), pages 356-367, April.
    3. Creemers, Stefan, 2018. "Maximizing the expected net present value of a project with phase-type distributed activity durations: An efficient globally optimal solution procedure," European Journal of Operational Research, Elsevier, vol. 267(1), pages 16-22.
    4. Creemers, Stefan & De Reyck, Bert & Leus, Roel, 2015. "Project planning with alternative technologies in uncertain environments," European Journal of Operational Research, Elsevier, vol. 242(2), pages 465-476.
    5. Hazır, Öncü & Ulusoy, Gündüz, 2020. "A classification and review of approaches and methods for modeling uncertainty in projects," International Journal of Production Economics, Elsevier, vol. 223(C).
    6. Sobel, Matthew J. & Szmerekovsky, Joseph G. & Tilson, Vera, 2009. "Scheduling projects with stochastic activity duration to maximize expected net present value," European Journal of Operational Research, Elsevier, vol. 198(3), pages 697-705, November.
    7. Hermans, Ben & Leus, Roel & Looy, Bart Van, 2023. "Deciding on scheduling, secrecy, and patenting during the new product development process: The relevance of project planning models," Omega, Elsevier, vol. 116(C).
    8. Alessio Angius & András Horváth & Marcello Urgo, 2021. "A Kronecker Algebra Formulation for Markov Activity Networks with Phase-Type Distributions," Mathematics, MDPI, vol. 9(12), pages 1-22, June.
    9. Song, Dong-Ping, 2006. "Raw material release time control for complex make-to-order products with stochastic processing times," International Journal of Production Economics, Elsevier, vol. 103(1), pages 371-385, September.
    10. Eli Gutin & Daniel Kuhn & Wolfram Wiesemann, 2015. "Interdiction Games on Markovian PERT Networks," Management Science, INFORMS, vol. 61(5), pages 999-1017, May.
    11. Creemers, Stefan, 2019. "The preemptive stochastic resource-constrained project scheduling problem," European Journal of Operational Research, Elsevier, vol. 277(1), pages 238-247.
    12. Stefan Creemers, 2019. "The preemptive stochastic resource-constrained project scheduling problem," Post-Print hal-02992618, HAL.
    13. Öncü Hazir & Gündüz Ulusoy, 2020. "A classification and review of approaches and methods for modeling uncertainty in projects," Post-Print hal-02898162, HAL.
    14. Peymankar, Mahboobeh & Davari, Morteza & Ranjbar, Mohammad, 2021. "Maximizing the expected net present value in a project with uncertain cash flows," European Journal of Operational Research, Elsevier, vol. 294(2), pages 442-452.
    15. Salim Rostami & Stefan Creemers & Roel Leus, 2018. "New strategies for stochastic resource-constrained project scheduling," Journal of Scheduling, Springer, vol. 21(3), pages 349-365, June.
    16. Elmaghraby, Salah E., 2000. "On criticality and sensitivity in activity networks," European Journal of Operational Research, Elsevier, vol. 127(2), pages 220-238, December.
    17. Elmaghraby, S. E. & Fathi, Y. & Taner, M. R., 1999. "On the sensitivity of project variability to activity mean duration," International Journal of Production Economics, Elsevier, vol. 62(3), pages 219-232, September.
    18. Azaron, Amir & Fatemi Ghomi, S.M.T., 2008. "Lower bound for the mean project completion time in dynamic PERT networks," European Journal of Operational Research, Elsevier, vol. 186(1), pages 120-127, April.
    19. Nalini Dayanand & Rema Padman, 2001. "Project Contracts and Payment Schedules: The Client's Problem," Management Science, INFORMS, vol. 47(12), pages 1654-1667, December.
    20. Junguang Zhang & Dan Wan, 2021. "Determination of early warning time window for bottleneck resource buffer," Annals of Operations Research, Springer, vol. 300(1), pages 289-305, May.

    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:eee:proeco:v:64:y:2000:i:1-3:p:153-164. 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: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/ijpe .

    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.