IDEAS home Printed from https://ideas.repec.org/a/spr/mathme/v52y2000i3p501-515.html
   My bibliography  Save this article

Linear preselective policies for stochastic project scheduling

Author

Listed:
  • Rolf H. Möhring
  • Frederik Stork

Abstract

In the context of stochastic resource-constrained project scheduling we introduce a novel class of scheduling policies, the linear preselective policies. They combine the benefits of preselective policies and priority policies; two classes that are well known from both deterministic and stochastic scheduling. We study several properties of this new class of policies which indicate its usefulness for computational purposes. Based on a new representation of preselective policies as and/ or precedence constraints we derive efficient algorithms for computing earliest job start times and state a necessary and sufficient dominance criterion for preselective policies. A computational experiment based on 480 instances empirically validates the theoretical findings. Copyright Springer-Verlag Berlin Heidelberg 2000

Suggested Citation

  • Rolf H. Möhring & Frederik Stork, 2000. "Linear preselective policies for stochastic project scheduling," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 52(3), pages 501-515, December.
    • Handle: RePEc:spr:mathme:v:52:y:2000:i:3:p:501-515
    DOI: 10.1007/s001860000095
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1007/s001860000095
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1007/s001860000095?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.

    Citations

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


    Cited by:

    1. 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.
    2. Gutjahr, Walter J., 2015. "Bi-Objective Multi-Mode Project Scheduling Under Risk Aversion," European Journal of Operational Research, Elsevier, vol. 246(2), pages 421-434.
    3. 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.
    4. Shoshana Hahn-Goldberg & Michael Carter & J. Beck & Maureen Trudeau & Philomena Sousa & Kathy Beattie, 2014. "Dynamic optimization of chemotherapy outpatient scheduling with uncertainty," Health Care Management Science, Springer, vol. 17(4), pages 379-392, December.
    5. Roland Braune & Walter J. Gutjahr & Petra Vogl, 2022. "Stochastic radiotherapy appointment scheduling," 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. 30(4), pages 1239-1277, December.
    6. Masoud Arjmand & Amir Abbas Najafi & Majid Ebrahimzadeh, 2020. "Evolutionary algorithms for multi-objective stochastic resource availability cost problem," OPSEARCH, Springer;Operational Research Society of India, vol. 57(3), pages 935-985, September.

    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:mathme:v:52:y:2000:i:3:p:501-515. 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: 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.