IDEAS home Printed from https://ideas.repec.org/h/spr/isochp/978-1-4614-9056-2_10.html
   My bibliography  Save this book chapter

Dynamic Resource Constrained Multi-Project Scheduling Problem with Weighted Earliness/Tardiness Costs

In: Essays in Production, Project Planning and Scheduling

Author

Listed:
  • M. Berke Pamay

    (Sabancı University)

  • Kerem Bülbül

    (Sabancı University)

  • Gündüz Ulusoy

    (Sabancı University)

Abstract

In this study, a conceptual framework is given for the dynamic resource-constrained multi-project scheduling problem with weighted earliness/tardiness costs (DRCMPSPWET), and a mathematical programming formulation of the problem is provided. In DRCMPSPWET, a project arrives on top of an existing project portfolio, and a due date has to be quoted for the new project while minimizing the costs of schedule changes. The objective function consists of the weighted earliness/tardiness costs of the activities of the existing projects in the current baseline schedule plus a term that increases linearly with the anticipated completion time of the new project. An iterated local search (LS)-based approach is developed for large instances of this problem. In order to analyze the performance and behavior of the proposed method, a new multi-project data set is created by controlling the total number of activities, the due date tightness, the due date range, the number of resource types, and the completion time factor in an instance. A series of computational experiments are carried out to test the performance of the LS approach. Exact solutions are provided for small instances. The results indicate that the LS heuristic performs well in terms of both solution quality and solution time.

Suggested Citation

  • M. Berke Pamay & Kerem Bülbül & Gündüz Ulusoy, 2014. "Dynamic Resource Constrained Multi-Project Scheduling Problem with Weighted Earliness/Tardiness Costs," International Series in Operations Research & Management Science, in: P. Simin Pulat & Subhash C. Sarin & Reha Uzsoy (ed.), Essays in Production, Project Planning and Scheduling, edition 127, chapter 10, pages 219-247, Springer.
  • Handle: RePEc:spr:isochp:978-1-4614-9056-2_10
    DOI: 10.1007/978-1-4614-9056-2_10
    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. Satic, U. & Jacko, P. & Kirkbride, C., 2024. "A simulation-based approximate dynamic programming approach to dynamic and stochastic resource-constrained multi-project scheduling problem," European Journal of Operational Research, Elsevier, vol. 315(2), pages 454-469.

    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:isochp:978-1-4614-9056-2_10. 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.