IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v90y1996i2p334-348.html
   My bibliography  Save this article

An efficient optimal solution procedure for the preemptive resource-constrained project scheduling problem

Author

Listed:
  • Demeulemeester, Erik L.
  • Herroelen, Willy S.

Abstract

No abstract is available for this item.

Suggested Citation

  • Demeulemeester, Erik L. & Herroelen, Willy S., 1996. "An efficient optimal solution procedure for the preemptive resource-constrained project scheduling problem," European Journal of Operational Research, Elsevier, vol. 90(2), pages 334-348, April.
    • Handle: RePEc:eee:ejores:v:90:y:1996:i:2:p:334-348
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/0377-2217(95)00358-4
    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. Jan Weogon glarz, 1981. "Project Scheduling with Continuously-Divisible, Doubly Constrained Resources," Management Science, INFORMS, vol. 27(9), pages 1040-1053, September.
    2. A. Alan B. Pritsker & Lawrence J. Waiters & Philip M. Wolfe, 1969. "Multiproject Scheduling with Limited Resources: A Zero-One Programming Approach," Management Science, INFORMS, vol. 16(1), pages 93-108, September.
    3. Erik Demeulemeester & Willy Herroelen, 1992. "A Branch-and-Bound Procedure for the Multiple Resource-Constrained Project Scheduling Problem," Management Science, INFORMS, vol. 38(12), pages 1803-1818, December.
    4. James H. Patterson & Walter D. Huber, 1974. "A Horizon-Varying, Zero-One Approach to Project Scheduling," Management Science, INFORMS, vol. 20(6), pages 990-998, February.
    5. Edward W. Davis & George E. Heidorn, 1971. "An Algorithm for Optimal Project Scheduling under Multiple Resource Constraints," Management Science, INFORMS, vol. 17(12), pages 803-816, August.
    6. Jerome D. Wiest, 1964. "Some Properties of Schedules for Large Projects with Limited Resources," Operations Research, INFORMS, vol. 12(3), pages 395-418, June.
    7. James H. Patterson, 1984. "A Comparison of Exact Approaches for Solving the Multiple Constrained Resource, Project Scheduling Problem," Management Science, INFORMS, vol. 30(7), pages 854-867, July.
    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. Jorgensen, Trond & Wallace, Stein W., 2000. "Improving project cost estimation by taking into account managerial flexibility," European Journal of Operational Research, Elsevier, vol. 127(2), pages 239-251, December.
    2. Damay, Jean & Quilliot, Alain & Sanlaville, Eric, 2007. "Linear programming based algorithms for preemptive and non-preemptive RCPSP," European Journal of Operational Research, Elsevier, vol. 182(3), pages 1012-1022, November.
    3. 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.
    4. Stefan Creemers, 2019. "The preemptive stochastic resource-constrained project scheduling problem," Post-Print hal-02992618, HAL.
    5. Kadri, Roubila Lilia & Boctor, Fayez F., 2018. "An efficient genetic algorithm to solve the resource-constrained project scheduling problem with transfer times: The single mode case," European Journal of Operational Research, Elsevier, vol. 265(2), pages 454-462.
    6. 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.
    7. Evgeny Gafarov & Alexander Lazarev & Frank Werner, 2014. "Approximability results for the resource-constrained project scheduling problem with a single type of resources," Annals of Operations Research, Springer, vol. 213(1), pages 115-130, February.
    8. Moukrim, Aziz & Quilliot, Alain & Toussaint, Hélène, 2015. "An effective branch-and-price algorithm for the Preemptive Resource Constrained Project Scheduling Problem based on minimal Interval Order Enumeration," European Journal of Operational Research, Elsevier, vol. 244(2), pages 360-368.
    9. Ballestí­n, Francisco & Valls, Vicente & Quintanilla, Sacramento, 2008. "Pre-emption in resource-constrained project scheduling," European Journal of Operational Research, Elsevier, vol. 189(3), pages 1136-1152, September.
    10. 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.
    11. Quintanilla, Sacramento & Pérez, Ángeles & Lino, Pilar & Valls, Vicente, 2012. "Time and work generalised precedence relationships in project scheduling with pre-emption: An application to the management of Service Centres," European Journal of Operational Research, Elsevier, vol. 219(1), pages 59-72.
    12. D. Debels & M. Vanhoucke, 2006. "The impact of various activity assumptions on the lead-time and resource utilization of resource-constrained projects," Working Papers of Faculty of Economics and Business Administration, Ghent University, Belgium 06/385, Ghent University, Faculty of Economics and Business Administration.
    13. Hartmann, Sönke & Briskorn, Dirk, 2008. "A survey of variants and extensions of the resource-constrained project scheduling problem," Working Paper Series 02/2008, Hamburg School of Business Administration (HSBA).
    14. Buddhakulsomsiri, Jirachai & Kim, David S., 2006. "Properties of multi-mode resource-constrained project scheduling problems with resource vacations and activity splitting," European Journal of Operational Research, Elsevier, vol. 175(1), pages 279-295, November.
    15. Abdollah Arasteh, 2020. "Considering Project Management Activities for Engineering Design Groups," SN Operations Research Forum, Springer, vol. 1(4), pages 1-29, December.
    16. Hartmann, Sönke & Briskorn, Dirk, 2010. "A survey of variants and extensions of the resource-constrained project scheduling problem," European Journal of Operational Research, Elsevier, vol. 207(1), pages 1-14, November.
    17. Peteghem, Vincent Van & Vanhoucke, Mario, 2010. "A genetic algorithm for the preemptive and non-preemptive multi-mode resource-constrained project scheduling problem," European Journal of Operational Research, Elsevier, vol. 201(2), pages 409-418, March.
    18. Arda Turkgenci & Huseyin Guden & Mehmet Gülşen, 2021. "Decomposition based extended project scheduling for make-to-order production," Operational Research, Springer, vol. 21(2), pages 801-825, June.
    19. Creemers, Stefan, 2019. "The preemptive stochastic resource-constrained project scheduling problem," European Journal of Operational Research, Elsevier, vol. 277(1), pages 238-247.
    20. Aidin Delgoshaei & Timon Rabczuk & Ahad Ali & Mohd Khairol Anuar Ariffin, 2017. "An applicable method for modifying over-allocated multi-mode resource constraint schedules in the presence of preemptive resources," Annals of Operations Research, Springer, vol. 259(1), pages 85-117, December.

    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. Kolisch, R. & Padman, R., 2001. "An integrated survey of deterministic project scheduling," Omega, Elsevier, vol. 29(3), pages 249-272, June.
    2. Kolisch, Rainer, 1994. "Serial and parallel resource-constrained projekt scheduling methodes revisited: Theory and computation," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 344, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.
    3. Kolisch, Rainer, 1994. "Efficient priority rules for the resource-constrained project scheduling problem," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 350, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.
    4. 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.
    5. Aristide Mingozzi & Vittorio Maniezzo & Salvatore Ricciardelli & Lucio Bianco, 1998. "An Exact Algorithm for the Resource-Constrained Project Scheduling Problem Based on a New Mathematical Formulation," Management Science, INFORMS, vol. 44(5), pages 714-729, May.
    6. Jan Böttcher & Andreas Drexl & Rainer Kolisch & Frank Salewski, 1999. "Project Scheduling Under Partially Renewable Resource Constraints," Management Science, INFORMS, vol. 45(4), pages 543-559, April.
    7. 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.
    8. Böttcher, Jan & Drexl, Andreas & Kolisch, Rainer & Salewski, Frank, 1996. "Project scheduling under partially renewable resource constraints," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 398, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.
    9. 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.
    10. Kolisch, Rainer & Sprecher, Arno & Drexl, Andreas, 1992. "Characterization and generation of a general class of resource-constrained project scheduling problems: Easy and hard instances," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 301, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.
    11. Kolisch, Rainer & Drexl, Andreas, 1994. "Hybrid biased random sampling for multiple resourse-constrained project scheduling problems," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 354, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.
    12. Schirmer, Andreas & Riesenberg, Sven, 1997. "Parameterized heuristics for project scheduling: Biased random sampling methods," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 456, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.
    13. Ballestí­n, Francisco & Valls, Vicente & Quintanilla, Sacramento, 2008. "Pre-emption in resource-constrained project scheduling," European Journal of Operational Research, Elsevier, vol. 189(3), pages 1136-1152, September.
    14. 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.
    15. Kolisch, Rainer & Hempel, Kai, 1995. "Experimentelle Evaluation der methodischen Fundierung von Projektmanagementsoftware," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 372, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.
    16. Viana, Ana & Pinho de Sousa, Jorge, 2000. "Using metaheuristics in multiobjective resource constrained project scheduling," European Journal of Operational Research, Elsevier, vol. 120(2), pages 359-374, January.
    17. Kolisch, Rainer & Sprecher, Arno, 1996. "PSPLIB - a project scheduling problem library," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 396, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.
    18. Sprecher, Arno & Kolisch, Rainer & Drexl, Andreas, 1993. "Semi-active, active and non-delay schedules for the resource-constrained project scheduling problem," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 307, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.
    19. Van Eynde, Rob & Vanhoucke, Mario, 2022. "New summary measures and datasets for the multi-project scheduling problem," European Journal of Operational Research, Elsevier, vol. 299(3), pages 853-868.
    20. Scott E. Sampson & Elliott N. Weiss, 1993. "Local search techniques for the generalized resource constrained project scheduling problem," Naval Research Logistics (NRL), John Wiley & Sons, vol. 40(5), pages 665-675, August.

    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:ejores:v:90:y:1996:i:2:p:334-348. 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/eor .

    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.