IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v81y1995i2p225-238.html
   My bibliography  Save this article

The discrete time-cost tradeoff problem revisited

Author

Listed:
  • De, Prabuddha
  • James Dunne, E.
  • Ghosh, Jay B.
  • Wells, Charles E.

Abstract

No abstract is available for this item.

Suggested Citation

  • 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.
    • Handle: RePEc:eee:ejores:v:81:y:1995:i:2:p:225-238
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/0377-2217(94)00187-H
    Download Restriction: Full text for ScienceDirect subscribers only
    ---><---

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

    References listed on IDEAS

    as
    1. 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.
    2. Valadares Tavares, L., 1990. "A multi-stage non-deterministic model for project scheduling under resources constraints," European Journal of Operational Research, Elsevier, vol. 49(1), pages 92-101, November.
    3. D. R. Fulkerson, 1961. "A Network Flow Computation for Project Cost Curves," Management Science, INFORMS, vol. 7(2), pages 167-178, January.
    4. 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.
    5. Jeffrey B. Sidney & George Steiner, 1986. "Optimal Sequencing by Modular Decomposition: Polynomial Algorithms," Operations Research, INFORMS, vol. 34(4), pages 606-612, August.
    6. Marshall L. Fisher, 1985. "An Applications Oriented Guide to Lagrangian Relaxation," Interfaces, INFORMS, vol. 15(2), pages 10-21, April.
    7. Don R. Robinson, 1975. "A Dynamic Programming Solution to Cost-Time Tradeoff for CPM," Management Science, INFORMS, vol. 22(2), pages 158-166, October.
    8. Elmaghraby, Salah E., 1993. "Resource allocation via dynamic programming in activity networks," European Journal of Operational Research, Elsevier, vol. 64(2), pages 199-215, January.
    9. Shailendra C. Parikh & William S. Jewell, 1965. "Decomposition of Project Networks," Management Science, INFORMS, vol. 11(3), pages 444-459, January.
    10. James E. Kelley, 1961. "Critical-Path Planning and Scheduling: Mathematical Basis," Operations Research, INFORMS, vol. 9(3), pages 296-320, June.
    11. Hermann Buer & Rolf H. Möhring, 1983. "A Fast Algorithm for the Decomposition of Graphs and Posets," Mathematics of Operations Research, INFORMS, vol. 8(2), pages 170-184, May.
    Full references (including those not matched with items on IDEAS)

    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. 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.
    3. 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.
    4. 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.
    5. 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.
    6. 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.
    7. 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.
    8. 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.
    9. 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.
    10. 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.
    11. 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.
    12. 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.
    13. Martin Skutella, 1998. "Approximation Algorithms for the Discrete Time-Cost Tradeoff Problem," Mathematics of Operations Research, INFORMS, vol. 23(4), pages 909-929, November.
    14. Hajdu M. & Isaac S., 2016. "Sixty years of project planning: history and future," Organization, Technology and Management in Construction, Sciendo, vol. 8(1), pages 1499-1510, December.
    15. Herroelen, Willy & Leus, Roel, 2004. "The construction of stable project baseline schedules," European Journal of Operational Research, Elsevier, vol. 156(3), pages 550-565, August.
    16. 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.
    17. Siqian Shen & J. Cole Smith & Shabbir Ahmed, 2010. "Expectation and Chance-Constrained Models and Algorithms for Insuring Critical Paths," Management Science, INFORMS, vol. 56(10), pages 1794-1814, October.
    18. Perrone, G. & Roma, P. & Lo Nigro, G., 2010. "Designing multi-attribute auctions for engineering services procurement in new product development in the automotive context," International Journal of Production Economics, Elsevier, vol. 124(1), pages 20-31, March.
    19. Kaiyue Zheng & Laura A. Albert, 2019. "Interdiction models for delaying adversarial attacks against critical information technology infrastructure," Naval Research Logistics (NRL), John Wiley & Sons, vol. 66(5), pages 411-429, August.
    20. Kolisch, R. & Padman, R., 2001. "An integrated survey of deterministic project scheduling," Omega, Elsevier, vol. 29(3), pages 249-272, June.

    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:eee:ejores:v:81:y:1995:i:2:p:225-238. 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: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/eor .

    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.