IDEAS home Printed from https://ideas.repec.org/a/pal/jorsoc/v53y2002i7d10.1057_palgrave.jors.2601351.html
   My bibliography  Save this article

Discrete time/cost trade-offs in project scheduling with time-switch constraints

Author

Listed:
  • M Vanhoucke

    (Operations and Technology Management Center, Vlerick Leuven Gent Management School
    Operations Management and Technology Policy, Faculty of Economics and Business Administration, Ghent University)

  • E Demeulemeester

    (Operations Management Group, Katholieke Universiteit Leuven)

  • W Herroelen

    (Operations Management Group, Katholieke Universiteit Leuven)

Abstract

The discrete time/cost trade-off problem assumes the duration of project activities to be discrete, non-increasing functions of the amount of a single non-renewable resource. The problem has been studied under three possible objectives. The so-called deadline problem involves the scheduling of project activities in order to minimize the total cost of the project while meeting a given deadline. The budget problem aims at minimizing the project duration without exceeding a given budget. A third objective involves the generation of the complete efficient time/cost profile over the set of feasible project durations. In this paper we describe a solution procedure for the deadline problem in which three special cases of time-switch constraints are involved. These constraints impose a specified starting time on the project activities and force them to be inactive during specified time periods. We propose a branch-and-bound algorithm and a heuristic procedure which both make use of a lower bound calculation for the discrete time/cost trade-off problem (without time-switch constraints). The procedures have been coded in Visual C++, version 6.0 under Windows 2000 and have been validated on a randomly generated problem set. We also discuss an illustrative example based on a real-life situation.

Suggested Citation

  • M Vanhoucke & E Demeulemeester & W Herroelen, 2002. "Discrete time/cost trade-offs in project scheduling with time-switch constraints," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 53(7), pages 741-751, July.
    • Handle: RePEc:pal:jorsoc:v:53:y:2002:i:7:d:10.1057_palgrave.jors.2601351
    DOI: 10.1057/palgrave.jors.2601351
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1057/palgrave.jors.2601351
    File Function: Abstract
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1057/palgrave.jors.2601351?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. Prpić, John, 2017. "Project Risk Management Incorporating Knight, Ellsberg & Kahneman," SocArXiv yqhjx, Center for Open Science.
    2. Nicole Megow & Rolf H. Möhring & Jens Schulz, 2011. "Decision Support and Optimization in Shutdown and Turnaround Scheduling," INFORMS Journal on Computing, INFORMS, vol. 23(2), pages 189-204, May.
    3. Karapetyan, Daniel & Mitrovic Minic, Snezana & Malladi, Krishna T. & Punnen, Abraham P., 2015. "Satellite downlink scheduling problem: A case study," Omega, Elsevier, vol. 53(C), pages 115-123.

    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:pal:jorsoc:v:53:y:2002:i:7:d:10.1057_palgrave.jors.2601351. 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.palgrave-journals.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.