IDEAS home Printed from https://ideas.repec.org/p/dar/wpaper/10913.html
   My bibliography  Save this paper

Computing lower bounds by destructive improvement - an application to resource-constrained project scheduling

Author

Listed:
  • Klein, Robert

Abstract

No abstract is available for this item.

Suggested Citation

  • Klein, Robert, 1999. "Computing lower bounds by destructive improvement - an application to resource-constrained project scheduling," Publications of Darmstadt Technical University, Institute for Business Studies (BWL) 10913, Darmstadt Technical University, Department of Business Administration, Economics and Law, Institute for Business Studies (BWL).
    • Handle: RePEc:dar:wpaper:10913
    Note: for complete metadata visit http://tubiblio.ulb.tu-darmstadt.de/10913/
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a search for a similarly titled item that would be available.

    Citations

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


    Cited by:

    1. Guo, Weikang & Vanhoucke, Mario & Coelho, José, 2023. "A prediction model for ranking branch-and-bound procedures for the resource-constrained project scheduling problem," European Journal of Operational Research, Elsevier, vol. 306(2), pages 579-595.
    2. Andrei Horbach, 2010. "A Boolean satisfiability approach to the resource-constrained project scheduling problem," Annals of Operations Research, Springer, vol. 181(1), pages 89-107, December.
    3. Sophie Demassey & Christian Artigues & Philippe Michelon, 2005. "Constraint-Propagation-Based Cutting Planes: An Application to the Resource-Constrained Project Scheduling Problem," INFORMS Journal on Computing, INFORMS, vol. 17(1), pages 52-65, February.
    4. Kai Watermeyer & Jürgen Zimmermann, 2020. "A branch-and-bound procedure for the resource-constrained project scheduling problem with partially renewable resources and general temporal constraints," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 42(2), pages 427-460, June.
    5. Artigues, Christian & Michelon, Philippe & Reusser, Stephane, 2003. "Insertion techniques for static and dynamic resource-constrained project scheduling," European Journal of Operational Research, Elsevier, vol. 149(2), pages 249-267, September.
    6. Carlier, Jacques & Neron, Emmanuel, 2007. "Computing redundant resources for the resource constrained project scheduling problem," European Journal of Operational Research, Elsevier, vol. 176(3), pages 1452-1463, February.
    7. Poder, Emmanuel & Beldiceanu, Nicolas & Sanlaville, Eric, 2004. "Computing a lower approximation of the compulsory part of a task with varying duration and varying resource consumption," European Journal of Operational Research, Elsevier, vol. 153(1), pages 239-254, February.
    8. Sepehr Proon & Mingzhou Jin, 2011. "A genetic algorithm with neighborhood search for the resource‐constrained project scheduling problem," Naval Research Logistics (NRL), John Wiley & Sons, vol. 58(2), pages 73-82, March.
    9. Scholl, Armin & Fliedner, Malte & Boysen, Nils, 2010. "Absalom: Balancing assembly lines with assignment restrictions," European Journal of Operational Research, Elsevier, vol. 200(3), pages 688-701, February.
    10. Rolf H. Möhring & Andreas S. Schulz & Frederik Stork & Marc Uetz, 2003. "Solving Project Scheduling Problems by Minimum Cut Computations," Management Science, INFORMS, vol. 49(3), pages 330-350, March.
    11. Schirmer, Andreas, 1999. "Adaptive control schemes applied to project scheduling with partially renewable resources," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 520, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.
    12. Scholl, Armin & Becker, Christian, 2006. "State-of-the-art exact and heuristic solution procedures for simple assembly line balancing," European Journal of Operational Research, Elsevier, vol. 168(3), pages 666-693, February.
    13. Brucker, Peter & Knust, Sigrid, 2003. "Lower bounds for resource-constrained project scheduling problems," European Journal of Operational Research, Elsevier, vol. 149(2), pages 302-313, September.
    14. Klein, Robert, 2000. "Bidirectional planning: improving priority rule-based heuristics for scheduling resource-constrained projects," European Journal of Operational Research, Elsevier, vol. 127(3), pages 619-638, December.
    15. Moehring, Rolf & Uetz, Marc & Stork, Frederik & Schulz, Andreas S., 2002. "Solving Project Scheduling Problems by Minimum Cut," Working papers 4231-02, Massachusetts Institute of Technology (MIT), Sloan School of Management.
    16. Carlier, J. & Neron, E., 2003. "On linear lower bounds for the resource constrained project scheduling problem," European Journal of Operational Research, Elsevier, vol. 149(2), pages 314-324, September.
    17. Sönke Hartmann, 2002. "A self‐adapting genetic algorithm for project scheduling under resource constraints," Naval Research Logistics (NRL), John Wiley & Sons, vol. 49(5), pages 433-448, August.
    18. Olivier Liess & Philippe Michelon, 2008. "A constraint programming approach for the resource-constrained project scheduling problem," Annals of Operations Research, Springer, vol. 157(1), pages 25-36, January.
    19. Fleszar, Krzysztof & Hindi, Khalil S., 2003. "An enumerative heuristic and reduction methods for the assembly line balancing problem," European Journal of Operational Research, Elsevier, vol. 145(3), pages 606-620, March.
    20. Bianco, Lucio & Caramia, Massimiliano, 2012. "An exact algorithm to minimize the makespan in project scheduling with scarce resources and generalized precedence relations," European Journal of Operational Research, Elsevier, vol. 219(1), pages 73-85.
    21. Valls, Vicente & Quintanilla, Sacramento & Ballestin, Francisco, 2003. "Resource-constrained project scheduling: A critical activity reordering heuristic," European Journal of Operational Research, Elsevier, vol. 149(2), pages 282-301, September.
    22. Ammann, Pia & Kolisch, Rainer & Schiffer, Maximilian, 2023. "Driver routing and scheduling with synchronization constraints," Transportation Research Part B: Methodological, Elsevier, vol. 174(C).
    23. Brucker, Peter & Knust, Sigrid, 2000. "A linear programming and constraint propagation-based lower bound for the RCPSP," European Journal of Operational Research, Elsevier, vol. 127(2), pages 355-362, December.
    24. E A Silver, 2004. "An overview of heuristic solution methods," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 55(9), pages 936-956, September.
    25. Fleszar, Krzysztof & Hindi, Khalil S., 2004. "Solving the resource-constrained project scheduling problem by a variable neighbourhood search," European Journal of Operational Research, Elsevier, vol. 155(2), pages 402-413, 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:dar:wpaper:10913. 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: Dekanatssekretariat (email available below). General contact details of provider: https://edirc.repec.org/data/ivthdde.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.