IDEAS home Printed from https://ideas.repec.org/p/zbw/cauman/475.html
   My bibliography  Save this paper

Minimizing total weighted completion times subject to precedence constraints by dynamic programming

Author

Listed:
  • Drexl, Andreas
  • Kimms, Alf

Abstract

In this paper we present a polynomial time dynamic programming algorithm for solving a scheduling problem with a (total) weighted completion time objective function where the weights are activity- and time-dependent. We highlight application areas for this type of problem to underscore the relevance of it. A computational study proves that large instances with up to 120 activities can be solved.

Suggested Citation

  • Drexl, Andreas & Kimms, Alf, 1998. "Minimizing total weighted completion times subject to precedence constraints by dynamic programming," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 475, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.
    • Handle: RePEc:zbw:cauman:475
    as

    Download full text from publisher

    File URL: https://www.econstor.eu/bitstream/10419/147580/1/manuskript_475.pdf
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Christofides, Nicos & Alvarez-Valdes, R. & Tamarit, J. M., 1987. "Project scheduling with resource constraints: A branch and bound approach," European Journal of Operational Research, Elsevier, vol. 29(3), pages 262-273, June.
    2. Rainer Kolisch & Arno Sprecher & Andreas Drexl, 1995. "Characterization and Generation of a General Class of Resource-Constrained Project Scheduling Problems," Management Science, INFORMS, vol. 41(10), pages 1693-1703, October.
    3. Sepil, Canan, 1994. "Comment on elmaghraby and herroelen's "The scheduling of activities to maximize the net present value of projects"," European Journal of Operational Research, Elsevier, vol. 73(1), pages 185-187, February.
    4. Elmaghraby, Salah E. & Herroelen, Willy S., 1990. "The scheduling of activities to maximize the net present value of projects," European Journal of Operational Research, Elsevier, vol. 49(1), pages 35-49, November.
    5. 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.
    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. Drexl, Andreas & Kimms, Alf, 1998. "Optimization guided lower and upper bounds for the resource investment problem," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 481, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.

    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. 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.
    2. Kolisch, R. & Padman, R., 2001. "An integrated survey of deterministic project scheduling," Omega, Elsevier, vol. 29(3), pages 249-272, June.
    3. Brucker, Peter & Drexl, Andreas & Mohring, Rolf & Neumann, Klaus & Pesch, Erwin, 1999. "Resource-constrained project scheduling: Notation, classification, models, and methods," European Journal of Operational Research, Elsevier, vol. 112(1), pages 3-41, January.
    4. Mika, Marek & Waligora, Grzegorz & Weglarz, Jan, 2005. "Simulated annealing and tabu search for multi-mode resource-constrained project scheduling with positive discounted cash flows and different payment models," European Journal of Operational Research, Elsevier, vol. 164(3), pages 639-668, August.
    5. 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.
    6. Boysen, Ole & Juretzka, Jan & Kimms, Alf, 1999. "Ameisen-Systeme zur kapitalwertmaximierenden Projektplanung," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 499, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.
    7. 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.
    8. Sprecher, Arno & Drexl, Andreas, 1996. "Minimal delaying alternatives and semi-active timetabling in resource-constrained project scheduling," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 426, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.
    9. 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.
    10. 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.
    11. Naber, Anulark & Kolisch, Rainer, 2014. "MIP models for resource-constrained project scheduling with flexible resource profiles," European Journal of Operational Research, Elsevier, vol. 239(2), pages 335-348.
    12. Brucker, Peter & Knust, Sigrid & Schoo, Arno & Thiele, Olaf, 1998. "A branch and bound algorithm for the resource-constrained project scheduling problem," European Journal of Operational Research, Elsevier, vol. 107(2), pages 272-288, June.
    13. Sprecher, Arno, 1996. "Solving the RCPSP efficiently at modest memory requirements," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 425, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.
    14. Hartmann, Sönke & Drexl, Andreas, 1997. "Project scheduling with multiple modes: A comparison of exact algorithms," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 430, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.
    15. Mario Vanhoucke & Erik Demeulemeester & Willy Herroelen, 2001. "On Maximizing the Net Present Value of a Project Under Renewable Resource Constraints," Management Science, INFORMS, vol. 47(8), pages 1113-1121, August.
    16. 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.
    17. 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.
    18. 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.
    19. 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.
    20. Kolisch, Rainer & Hartmann, Sönke, 1998. "Heuristic algorithms for solving the resource-constrained project scheduling problem: Classification and computational analysis," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 469, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.

    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:zbw:cauman:475. 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: ZBW - Leibniz Information Centre for Economics (email available below). General contact details of provider: https://edirc.repec.org/data/ibkiede.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.