IDEAS home Printed from https://ideas.repec.org/a/spr/annopr/v108y2001i1p55-7410.1023-a1016046625583.html
   My bibliography  Save this article

Project Scheduling under Time Dependent Costs – A Branch and Bound Algorithm

Author

Listed:
  • N.R. Achuthan
  • A. Hardjawidjaja

Abstract

In a given project network, execution of each activity in normal duration requires utilization of certain resources. If faster execution of an activity is desired then additional resources at extra cost would be required. Given a project network, the cost structure for each activity and a planning horizon, the project compression problem is concerned with the determination of optimal schedule (duration) of performing each activity while satisfying given restrictions and minimizing the total cost of project execution. This paper considers the project compression problem with time dependent cost structure for each activity. The planning horizon is divided into several regular time intervals over which the cost structure of an activity may vary. But the cost structure of the activities remains the same (constant) within a time interval. Key events of the project attract penalty for finishing earlier or later than the corresponding target times. The objective is to find an optimal project schedule minimizing the total project cost. We present a mathematical model for this problem, develop some heuristics and an exact branch and bound algorithm. Using simulated problems we provide an insight into the computational performances of heuristics and the branch and bound algorithm. Copyright Kluwer Academic Publishers 2001

Suggested Citation

  • N.R. Achuthan & A. Hardjawidjaja, 2001. "Project Scheduling under Time Dependent Costs – A Branch and Bound Algorithm," Annals of Operations Research, Springer, vol. 108(1), pages 55-74, November.
    • Handle: RePEc:spr:annopr:v:108:y:2001:i:1:p:55-74:10.1023/a:1016046625583
    DOI: 10.1023/A:1016046625583
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1023/A:1016046625583
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1023/A:1016046625583?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
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Citations

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


    Cited by:

    1. Klanšek Uroš & Pšunder Mirko, 2008. "Cost Optimal Project Scheduling," Organizacija, Sciendo, vol. 41(4), pages 153-158, July.
    2. 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).
    3. 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.
    4. Mohammad Rostami & Morteza Bagherpour, 2020. "A lagrangian relaxation algorithm for facility location of resource-constrained decentralized multi-project scheduling problems," Operational Research, Springer, vol. 20(2), pages 857-897, June.
    5. 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.
    6. Kerkhove, L.-P. & Vanhoucke, M., 2017. "Optimised scheduling for weather sensitive offshore construction projects," Omega, Elsevier, vol. 66(PA), pages 58-78.

    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:annopr:v:108:y:2001:i:1:p:55-74:10.1023/a:1016046625583. 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.