IDEAS home Printed from https://ideas.repec.org/p/vlg/vlgwps/2002-18.html
   My bibliography  Save this paper

New computational results for the discrete time/cost trade-off problem with time-switch constraints

Author

Listed:
  • Mario Vanhoucke

    (Vlerick Leuven Gent Management School)

Abstract

Recently, time-switch constraints have been introduced in literature by Yang and Chen (2000). Basically, these constraints impose a specified starting time on the project activities and force them to be inactive during specified time periods. This type of constraints have been incorporated into the well-known discrete time/cost trade-off problem in order to cope with day, night and weekend shifts.In this paper, we propose a new branch-and-bound algorithm which outperforms the previous one by Vanhoucke et al. (2002a). The procedure makes use of a lower bound calculation for the discrete time/cost trade-off problem (without time-switch constraints). The procedure has been coded in Visual C++, version 6.0 under Windows 2000 and has been validated on a randomly generated problem set.

Suggested Citation

  • Mario Vanhoucke, 2002. "New computational results for the discrete time/cost trade-off problem with time-switch constraints," Vlerick Leuven Gent Management School Working Paper Series 2002-18, Vlerick Leuven Gent Management School.
    • Handle: RePEc:vlg:vlgwps:2002-18
    as

    Download full text from publisher

    File URL: http://www.vlerick.be/en/5785-VLK/version/default/part/AttachmentData/data/vlgms-wp-2002-18.pdf
    Download Restriction: no
    ---><---

    Other versions of this item:

    References listed on IDEAS

    as
    1. Vanhoucke, Mario, 2005. "New computational results for the discrete time/cost trade-off problem with time-switch constraints," European Journal of Operational Research, Elsevier, vol. 165(2), pages 359-374, September.
    2. Salah E. Elmaghraby & Jerzy Kamburowski, 1992. "The Analysis of Activity Networks Under Generalized Precedence Relations (GPRs)," Management Science, INFORMS, vol. 38(9), pages 1245-1263, September.
    3. 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.
    4. Thomas J. Hindelang & John F. Muth, 1979. "A Dynamic Programming Algorithm for Decision CPM Networks," Operations Research, INFORMS, vol. 27(2), pages 225-241, April.
    5. Elmaghraby, Salah E. & Herroelen, Willy S., 1980. "On the measurement of complexity in activity networks," European Journal of Operational Research, Elsevier, vol. 5(4), pages 223-234, October.
    6. Demeulemeester, Erik L. & Herroelen, Willy S. & Elmaghraby, Salah E., 1996. "Optimal procedures for the discrete time/cost trade-off problem in project networks," European Journal of Operational Research, Elsevier, vol. 88(1), pages 50-68, January.
    7. De, Prabuddha & James Dunne, E. & Ghosh, Jay B. & Wells, Charles E., 1995. "The discrete time-cost tradeoff problem revisited," European Journal of Operational Research, Elsevier, vol. 81(2), pages 225-238, March.
    8. Nicolai Siemens, 1971. "A Simple CPM Time-Cost Tradeoff Algorithm," Management Science, INFORMS, vol. 17(6), pages 354-363, February.
    9. D. R. Fulkerson, 1961. "A Network Flow Computation for Project Cost Curves," Management Science, INFORMS, vol. 7(2), pages 167-178, January.
    10. L. R. Lamberson & R. R. Hocking, 1970. "Optimum Time Compression in Project Scheduling," Management Science, INFORMS, vol. 16(10), pages 597-606, June.
    11. Martin Skutella, 1998. "Approximation Algorithms for the Discrete Time-Cost Tradeoff Problem," Mathematics of Operations Research, INFORMS, vol. 23(4), pages 909-929, November.
    12. De Reyck, Bert & Herroelen, Willy, 1996. "On the use of the complexity index as a measure of complexity in activity networks," European Journal of Operational Research, Elsevier, vol. 91(2), pages 347-366, June.
    13. James E. Falk & Joel L. Horowitz, 1972. "Critical Path Problems with Concave Cost-Time Curves," Management Science, INFORMS, vol. 19(4-Part-1), pages 446-455, December.
    14. W. Crowston & G. L. Thompson, 1967. "Decision CPM: A Method for Simultaneous Planning, Scheduling, and Control of Projects," Operations Research, INFORMS, vol. 15(3), pages 407-426, June.
    15. Don R. Robinson, 1975. "A Dynamic Programming Solution to Cost-Time Tradeoff for CPM," Management Science, INFORMS, vol. 22(2), pages 158-166, October.
    16. Siemens, Nicolai & Gooding, Carl, 1975. "Reducing project duration at minimum cost: A time-cost tradeoff algorithm," Omega, Elsevier, vol. 3(5), pages 569-581, October.
    17. Yang, Hsu-Hao & Chen, Yen-Liang, 2000. "Finding the critical path in an activity network with time-switch constraints," European Journal of Operational Research, Elsevier, vol. 120(3), pages 603-613, February.
    18. De Reyck, Bert & Herroelen, willy, 1998. "A branch-and-bound procedure for the resource-constrained project scheduling problem with generalized precedence relations," European Journal of Operational Research, Elsevier, vol. 111(1), pages 152-174, November.
    19. James E. Kelley, 1961. "Critical-Path Planning and Scheduling: Mathematical Basis," Operations Research, INFORMS, vol. 9(3), pages 296-320, June.
    20. W Herroelen & B De Reyck, 1999. "Phase transitions in project scheduling," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 50(2), pages 148-156, February.
    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. Vanhoucke, Mario, 2005. "New computational results for the discrete time/cost trade-off problem with time-switch constraints," European Journal of Operational Research, Elsevier, vol. 165(2), pages 359-374, September.
    2. Helena Gaspars, 2006. "A conception of a new algorithm for the project time-cost analysis," Operations Research and Decisions, Wroclaw University of Science and Technology, Faculty of Management, vol. 16(3-4), pages 5-27.
    3. D. Van den Poel, 2003. "Predicting Mail-Order Repeat Buying. Which Variables Matter?," Review of Business and Economic Literature, KU Leuven, Faculty of Economics and Business (FEB), Review of Business and Economic Literature, vol. 0(3), pages 371-404.
    4. M. Vanhoucke, 2007. "An electromagnetic time/cost trade-off optimization in project scheduling," Working Papers of Faculty of Economics and Business Administration, Ghent University, Belgium 07/457, Ghent University, Faculty of Economics and Business Administration.
    5. Valenko Tadej & Klanšek Uroš, 2017. "An integration of spreadsheet and project management software for cost optimal time scheduling in construction," Organization, Technology and Management in Construction, Sciendo, vol. 9(1), pages 1627-1637, December.
    6. 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.
    7. 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.
    8. Zsolt T. Kosztyán & István Szalkai, 2020. "Multimode resource-constrained project scheduling in flexible projects," Journal of Global Optimization, Springer, vol. 76(1), pages 211-241, January.
    9. He, Zhengwen & Wang, Nengmin & Jia, Tao & Xu, Yu, 2009. "Simulated annealing and tabu search for multi-mode project payment scheduling," European Journal of Operational Research, Elsevier, vol. 198(3), pages 688-696, November.

    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. M. Vanhoucke, 2007. "An electromagnetic time/cost trade-off optimization in project scheduling," Working Papers of Faculty of Economics and Business Administration, Ghent University, Belgium 07/457, Ghent University, Faculty of Economics and Business Administration.
    2. Bregman, Robert L., 2009. "A heuristic procedure for solving the dynamic probabilistic project expediting problem," European Journal of Operational Research, Elsevier, vol. 192(1), pages 125-137, January.
    3. Helena Gaspars, 2006. "A conception of a new algorithm for the project time-cost analysis," Operations Research and Decisions, Wroclaw University of Science and Technology, Faculty of Management, vol. 16(3-4), pages 5-27.
    4. 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.
    5. R L Bregman, 2009. "Preemptive expediting to improve project due date performance," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 60(1), pages 120-129, January.
    6. He, Zhengwen & Wang, Nengmin & Jia, Tao & Xu, Yu, 2009. "Simulated annealing and tabu search for multi-mode project payment scheduling," European Journal of Operational Research, Elsevier, vol. 198(3), pages 688-696, November.
    7. Marcin Anholcer & Helena Gaspars-Wieloch, 2011. "Efficiency analysis of the Kaufmann and Dezbazeille algorithm for the deadline problem," Operations Research and Decisions, Wroclaw University of Science and Technology, Faculty of Management, vol. 21(1), pages 5-18.
    8. Kolisch, R. & Padman, R., 2001. "An integrated survey of deterministic project scheduling," Omega, Elsevier, vol. 29(3), pages 249-272, June.
    9. 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.
    10. Akkan, Can & Drexl, Andreas & Kimms, Alf, 2000. "Network decomposition-based lower and upper bounds for the discrete time-cost tradeoff problem," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 527, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.
    11. Akkan, Can & Drexl, Andreas & Kimms, Alf, 2005. "Network decomposition-based benchmark results for the discrete time-cost tradeoff problem," European Journal of Operational Research, Elsevier, vol. 165(2), pages 339-358, September.
    12. A B Hafızoğlu & M Azizoğlu, 2010. "Linear programming based approaches for the discrete time/cost trade-off problem in project networks," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 61(4), pages 676-685, April.
    13. Eleni Hadjiconstantinou & Evelina Klerides, 2010. "A new path-based cutting plane approach for the discrete time-cost tradeoff problem," Computational Management Science, Springer, vol. 7(3), pages 313-336, July.
    14. 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.
    15. De, Prabuddha & James Dunne, E. & Ghosh, Jay B. & Wells, Charles E., 1995. "The discrete time-cost tradeoff problem revisited," European Journal of Operational Research, Elsevier, vol. 81(2), pages 225-238, March.
    16. M. Vanhoucke & J. Coelho & L. V. Tavares & D. Debels, 2004. "On The Morphological Structure Of A Network," Working Papers of Faculty of Economics and Business Administration, Ghent University, Belgium 04/272, Ghent University, Faculty of Economics and Business Administration.
    17. Xue Li & Zhengwen He & Nengmin Wang & Mario Vanhoucke, 2022. "Multimode time-cost-robustness trade-off project scheduling problem under uncertainty," Journal of Combinatorial Optimization, Springer, vol. 43(5), pages 1173-1202, July.
    18. De Reyck, Bert & Herroelen, Willy, 1999. "The multi-mode resource-constrained project scheduling problem with generalized precedence relations," European Journal of Operational Research, Elsevier, vol. 119(2), pages 538-556, December.
    19. Martin Skutella, 1998. "Approximation Algorithms for the Discrete Time-Cost Tradeoff Problem," Mathematics of Operations Research, INFORMS, vol. 23(4), pages 909-929, November.
    20. 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.

    More about this item

    NEP fields

    This paper has been announced in the following NEP Reports:

    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:vlg:vlgwps:2002-18. 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: Isabelle Vandenbroere (email available below). General contact details of provider: https://edirc.repec.org/data/vlgmsbe.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.