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

Active and stable project scheduling

Author

Listed:
  • K. Neumann
  • H. Nübel
  • C. Schwindt

Abstract

The paper proposes a new classification of schedules for resource-constrained project scheduling problems with minimum and maximum time lags between project activities and regular and different types of nonregular objective functions. The feasible region of the scheduling problems represents a (generally disconnected) union of polytopes. In addition to the well-known concepts of active and semiactive schedules, pseudoactive and quasiactive as well as stable, semistable, pseudostable, and quasistable schedules are introduced. The (quasi-, pseudo-, semi-)active schedules are related to different types of left-shifts of sets of activities and correspond to minimal points of certain subsets of the feasible region. The (quasi-, pseudo-, semi-)stable schedules do not allow oppositely directed shifts and correspond to extreme points of certain subsets of the feasible region. The different sets of schedules contain optimal schedules for project scheduling problems which differ in their objective functions. The correspondence between those sets of schedules and vertices of specific polyhedral subsets of the feasible region can be exploited for analyzing schedule generation schemes which have been developed recently for finding solutions to the different classes of project scheduling problems. Copyright Springer-Verlag Berlin Heidelberg 2000

Suggested Citation

  • K. Neumann & H. Nübel & C. Schwindt, 2000. "Active and stable project scheduling," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 52(3), pages 441-465, December.
    • Handle: RePEc:spr:mathme:v:52:y:2000:i:3:p:441-465
    DOI: 10.1007/s001860000092
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1007/s001860000092
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1007/s001860000092?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. André Schnabel & Carolin Kellenbrink & Stefan Helber, 2018. "Profit-oriented scheduling of resource-constrained projects with flexible capacity constraints," Business Research, Springer;German Academic Association for Business Research, vol. 11(2), pages 329-356, September.
    2. Heilmann, Roland, 2003. "A branch-and-bound procedure for the multi-mode resource-constrained project scheduling problem with minimum and maximum time lags," European Journal of Operational Research, Elsevier, vol. 144(2), pages 348-365, January.
    3. Thomas Selle & Jürgen Zimmermann, 2003. "A bidirectional heuristic for maximizing the net present value of large‐scale projects subject to limited resources," Naval Research Logistics (NRL), John Wiley & Sons, vol. 50(2), pages 130-148, March.
    4. Gehring, Marco & Volk, Rebekka & Schultmann, Frank, 2022. "On the integration of diverging material flows into resource‐constrained project scheduling," European Journal of Operational Research, Elsevier, vol. 303(3), pages 1071-1087.
    5. Kreter, Stefan & Schutt, Andreas & Stuckey, Peter J. & Zimmermann, Jürgen, 2018. "Mixed-integer linear programming and constraint programming formulations for solving resource availability cost problems," European Journal of Operational Research, Elsevier, vol. 266(2), pages 472-486.
    6. Herroelen, Willy & Leus, Roel, 2004. "The construction of stable project baseline schedules," European Journal of Operational Research, Elsevier, vol. 156(3), pages 550-565, August.
    7. Kai Watermeyer & Jürgen Zimmermann, 2023. "A constructive branch-and-bound algorithm for the project duration problem with partially renewable resources and general temporal constraints," Journal of Scheduling, Springer, vol. 26(1), pages 95-111, February.
    8. Rieck, Julia & Zimmermann, Jürgen & Gather, Thorsten, 2012. "Mixed-integer linear programming for resource leveling problems," European Journal of Operational Research, Elsevier, vol. 221(1), pages 27-37.
    9. Neumann, K. & Schwindt, C. & Zimmermann, J., 2003. "Order-based neighborhoods for project scheduling with nonregular objective functions," European Journal of Operational Research, Elsevier, vol. 149(2), pages 325-343, September.
    10. Neumann, K. & Zimmermann, J., 2000. "Procedures for resource leveling and net present value problems in project scheduling with general temporal and resource constraints," European Journal of Operational Research, Elsevier, vol. 127(2), pages 425-443, 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:mathme:v:52:y:2000:i:3:p:441-465. 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.