IDEAS home Printed from https://ideas.repec.org/a/hin/jnlaor/505716.html
   My bibliography  Save this article

Resource Constrained Project Scheduling Subject to Due Dates: Preemption Permitted with Penalty

Author

Listed:
  • Behrouz Afshar-Nadjafi

Abstract

Extensive research works have been carried out in resource constrained project scheduling problem. However, scarce researches have studied the problems in which a setup cost must be incurred if activities are preempted. In this research, we investigate the resource constrained project scheduling problem to minimize the total project cost, considering earliness-tardiness and preemption penalties. A mixed integer programming formulation is proposed for the problem. The resulting problem is NP-hard. So, we try to obtain a satisfying solution using simulated annealing (SA) algorithm. The efficiency of the proposed algorithm is tested based on 150 randomly produced examples. Statistical comparison in terms of the computational times and objective function indicates that the proposed algorithm is efficient and effective.

Suggested Citation

  • Behrouz Afshar-Nadjafi, 2014. "Resource Constrained Project Scheduling Subject to Due Dates: Preemption Permitted with Penalty," Advances in Operations Research, Hindawi, vol. 2014, pages 1-10, April.
    • Handle: RePEc:hin:jnlaor:505716
    DOI: 10.1155/2014/505716
    as

    Download full text from publisher

    File URL: http://downloads.hindawi.com/journals/AOR/2014/505716.pdf
    Download Restriction: no
    File URL: http://downloads.hindawi.com/journals/AOR/2014/505716.xml
    Download Restriction: no
    File URL: https://libkey.io/10.1155/2014/505716?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    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:hin:jnlaor:505716. 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: Mohamed Abdelhakeem (email available below). General contact details of provider: https://www.hindawi.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.