Advanced Search
MyIDEAS: Login to save this article or follow this journal

Project scheduling with resource constraints: A branch and bound approach

Contents:

Author Info

  • Christofides, Nicos
  • Alvarez-Valdes, R.
  • Tamarit, J. M.
Registered author(s):

    Abstract

    No abstract is available for this item.

    Download Info

    If you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
    File URL: http://www.sciencedirect.com/science/article/B6VCT-4B4RTT1-7X/2/81aed0033fdd8187711e151a286cce6b
    Download Restriction: Full text for ScienceDirect subscribers only

    As the access to this document is restricted, you may want to look for a different version under "Related research" (further below) or search for a different version of it.

    Bibliographic Info

    Article provided by Elsevier in its journal European Journal of Operational Research.

    Volume (Year): 29 (1987)
    Issue (Month): 3 (June)
    Pages: 262-273

    as in new window
    Handle: RePEc:eee:ejores:v:29:y:1987:i:3:p:262-273

    Contact details of provider:
    Web page: http://www.elsevier.com/locate/eor

    Related research

    Keywords:

    References

    No references listed on IDEAS
    You can help add them by filling out this form.

    Citations

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

    Cited by:
    1. Klein, Robert & Scholl, Armin, 1999. "Computing lower bounds by destructive improvement: An application to resource-constrained project scheduling," European Journal of Operational Research, Elsevier, vol. 112(2), pages 322-346, January.
    2. Ozdamar, Linet & Ulusoy, Gunduz, 1996. "A note on an iterative forward/backward scheduling technique with reference to a procedure by Li and Willis," European Journal of Operational Research, Elsevier, vol. 89(2), pages 400-407, March.
    3. Mori, Masao & Tseng, Ching Chih, 1997. "A genetic algorithm for multi-mode resource constrained project scheduling problem," European Journal of Operational Research, Elsevier, vol. 100(1), pages 134-141, July.
    4. 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.
    5. Kogan, Konstantin & Shtub, Avraham, 1999. "Scheduling projects with variable-intensity activities: The case of dynamic earliness and tardiness costs," European Journal of Operational Research, Elsevier, vol. 118(1), pages 65-80, October.
    6. 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.
    7. Elmaghraby, Salah E., 1995. "Activity nets: A guided tour through some recent developments," European Journal of Operational Research, Elsevier, vol. 82(3), pages 383-408, May.
    8. Bowers, J., 1996. "Identifying critical activities in stochastic resource constrained networks," Omega, Elsevier, vol. 24(1), pages 37-46, February.
    9. Kolisch, Rainer & Sprecher, Arno, 1997. "PSPLIB - A project scheduling problem library : OR Software - ORSEP Operations Research Software Exchange Program," European Journal of Operational Research, Elsevier, vol. 96(1), pages 205-216, January.
    10. Simpson, Wendell P. & Patterson, James H., 1996. "A multiple-tree search procedure for the resource-constrained project scheduling problem," European Journal of Operational Research, Elsevier, vol. 89(3), pages 525-542, March.
    11. Bertsimas, Dimitris & Gupta, Shubham & Lulli, Guglielmo, 2014. "Dynamic resource allocation: A flexible and tractable modeling framework," European Journal of Operational Research, Elsevier, vol. 236(1), pages 14-26.
    12. Sprecher, Arno & Kolisch, Rainer & Drexl, Andreas, 1995. "Semi-active, active, and non-delay schedules for the resource-constrained project scheduling problem," European Journal of Operational Research, Elsevier, vol. 80(1), pages 94-102, January.
    13. Yang, Kum Khiong & Tay, Lee Choo & Sum, Chee Chuong, 1995. "A comparison of stochastic scheduling rules for maximizing project net present value," European Journal of Operational Research, Elsevier, vol. 85(2), pages 327-339, September.
    14. Luh, Peter B. & Liu, Feng & Moser, Bryan, 1999. "Scheduling of design projects with uncertain number of iterations," European Journal of Operational Research, Elsevier, vol. 113(3), pages 575-592, March.
    15. Ahn, Taeho & Erenguc, S. Selcuk, 1998. "The resource constrained project scheduling problem with multiple crashable modes: A heuristic procedure," European Journal of Operational Research, Elsevier, vol. 107(2), pages 250-259, June.
    16. Nazareth, Terence & Verma, Sanjay & Bhattacharya, Subir & Bagchi, Amitava, 1999. "The multiple resource constrained project scheduling problem: A breadth-first approach," European Journal of Operational Research, Elsevier, vol. 112(2), pages 347-366, January.
    17. Herroelen, Willy S. & Van Dommelen, Patrick & Demeulemeester, Erik L., 1997. "Project network models with discounted cash flows a guided tour through recent developments," European Journal of Operational Research, Elsevier, vol. 100(1), pages 97-121, July.
    18. Kaefer, Frederick, 2000. "A note on "Project scheduling with resource constraints: A branch and bound approach"," European Journal of Operational Research, Elsevier, vol. 125(1), pages 216-217, August.
    19. Ulusoy, Gunduz & Ozdamar, Linet, 1996. "A framework for an interactive project scheduling system under limited resources," European Journal of Operational Research, Elsevier, vol. 90(2), pages 362-375, April.
    20. Maria Ayala & Abir Benabid & Christian Artigues & Claire Hanen, 2013. "The resource-constrained modulo scheduling problem: an experimental study," Computational Optimization and Applications, Springer, vol. 54(3), pages 645-673, April.
    21. Ramírez Palencia, Alberto E. & Mejía Delgadillo, Gonzalo E., 2012. "A computer application for a bus body assembly line using Genetic Algorithms," International Journal of Production Economics, Elsevier, vol. 140(1), pages 431-438.
    22. Kolisch, Rainer, 1996. "Serial and parallel resource-constrained project scheduling methods revisited: Theory and computation," European Journal of Operational Research, Elsevier, vol. 90(2), pages 320-333, April.
    23. Weglarz, Jan & Józefowska, Joanna & Mika, Marek & Waligóra, Grzegorz, 2011. "Project scheduling with finite or infinite number of activity processing modes - A survey," European Journal of Operational Research, Elsevier, vol. 208(3), pages 177-205, February.
    24. Bouleimen, K. & Lecocq, H., 2003. "A new efficient simulated annealing algorithm for the resource-constrained project scheduling problem and its multiple mode version," European Journal of Operational Research, Elsevier, vol. 149(2), pages 268-281, September.

    Lists

    This item is not listed on Wikipedia, on a reading list or among the top items on IDEAS.

    Statistics

    Access and download statistics

    Corrections

    When requesting a correction, please mention this item's handle: RePEc:eee:ejores:v:29:y:1987:i:3:p:262-273. See general information about how to correct material in RePEc.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Zhang, Lei).

    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 references are entirely missing, you can add them using this form.

    If the full references list an item that is present in RePEc, but the system did not link 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 profile, as there may be some citations waiting for confirmation.

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.