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

Optimal procedures for the discrete time/cost trade-off problem in project networks

Author

Listed:
  • Demeulemeester, Erik L.
  • Herroelen, Willy S.
  • Elmaghraby, Salah E.

Abstract

No abstract is available for this item.

Suggested Citation

  • 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.
    • Handle: RePEc:eee:ejores:v:88:y:1996:i:1:p:50-68
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/0377-2217(94)00181-2
    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. Jeffrey B. Sidney & George Steiner, 1986. "Optimal Sequencing by Modular Decomposition: Polynomial Algorithms," Operations Research, INFORMS, vol. 34(4), pages 606-612, August.
    2. E. Demeulemeester & B. Dodin & W. Herroelen, 1993. "A Random Activity Network Generator," Operations Research, INFORMS, vol. 41(5), pages 972-980, October.
    3. Don R. Robinson, 1975. "A Dynamic Programming Solution to Cost-Time Tradeoff for CPM," Management Science, INFORMS, vol. 22(2), pages 158-166, October.
    4. B. Rothfarb & H. Frank & D. M. Rosenbaum & K. Steiglitz & D. J. Kleitman, 1970. "Optimal Design of Offshore Natural-Gas Pipeline Systems," Operations Research, INFORMS, vol. 18(6), pages 992-1020, December.
    5. 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. 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.
    2. 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.
    3. 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.
    4. 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.
    5. Guelpa, Elisa & Bischi, Aldo & Verda, Vittorio & Chertkov, Michael & Lund, Henrik, 2019. "Towards future infrastructures for sustainable multi-energy systems: A review," Energy, Elsevier, vol. 184(C), pages 2-21.
    6. Aniruddha Dutta, 2019. "Capacity Allocation of Game Tickets Using Dynamic Pricing," Data, MDPI, vol. 4(4), pages 1-12, October.
    7. Drexl, Andreas & Nissen, Rudiger & Patterson, James H. & Salewski, Frank, 2000. "ProGen/[pi]x - An instance generator for resource-constrained project scheduling problems with partially renewable resources and further extensions," European Journal of Operational Research, Elsevier, vol. 125(1), pages 59-72, August.
    8. 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.
    9. Mori, Masao & Tseng, Ching Chih, 1997. "A genetic algorithm for multi-mode resource constrained project scheduling problem," European Journal of Operational Research, Elsevier, vol. 100(1), pages 134-141, July.
    10. Dayal Madhukar & Verma, Sanjay, 2015. "Multi-processor Exact Procedures for Regular Measures of the Multi-mode RCPSP," IIMA Working Papers WP2015-03-25, Indian Institute of Management Ahmedabad, Research and Publication Department.
    11. Zhou, Jun & Zhao, Yunxiang & Fu, Tiantian & Zhou, Xuan & Liang, Guangchuan, 2022. "Dimension optimization for underground natural gas storage pipeline network coupling injection and production conditions," Energy, Elsevier, vol. 256(C).
    12. Dodin, B. & Elimam, A.A., 2008. "Integration of equipment planning and project scheduling," European Journal of Operational Research, Elsevier, vol. 184(3), pages 962-980, February.
    13. Healy, Patrick & Moll, Robert, 1995. "A new extension of local search applied to the Dial-A-Ride Problem," European Journal of Operational Research, Elsevier, vol. 83(1), pages 83-104, May.
    14. Vanhoucke, Mario & Coelho, Jose & Debels, Dieter & Maenhout, Broos & Tavares, Luis V., 2008. "An evaluation of the adequacy of project network generators with systematically sampled networks," European Journal of Operational Research, Elsevier, vol. 187(2), pages 511-524, June.
    15. Jack Reilly & Samitha Samaranayake & Maria Laura Delle Monache & Walid Krichene & Paola Goatin & Alexandre M. Bayen, 2015. "Adjoint-Based Optimization on a Network of Discretized Scalar Conservation Laws with Applications to Coordinated Ramp Metering," Journal of Optimization Theory and Applications, Springer, vol. 167(2), pages 733-760, November.
    16. Terrence W. K. Mak & Pascal Van Hentenryck & Anatoly Zlotnik & Russell Bent, 2019. "Dynamic Compressor Optimization in Natural Gas Pipeline Systems," INFORMS Journal on Computing, INFORMS, vol. 31(1), pages 40-65, February.
    17. Nicholas G. Hall & Marc E. Posner, 2001. "Generating Experimental Data for Computational Testing with Machine Scheduling Applications," Operations Research, INFORMS, vol. 49(6), pages 854-865, December.
    18. Rummel, Jeffrey L. & Walter, Zhiping & Dewan, Rajiv & Seidmann, Abraham, 2005. "Activity consolidation to improve responsiveness," European Journal of Operational Research, Elsevier, vol. 161(3), pages 683-703, March.
    19. Guillermo Durán & Martín Safe & Xavier Warnes, 2020. "Neighborhood covering and independence on $$P_4$$P4-tidy graphs and tree-cographs," Annals of Operations Research, Springer, vol. 286(1), pages 55-86, March.
    20. Robbert Fokkink & Thomas Lidbetter & László A. Végh, 2019. "On Submodular Search and Machine Scheduling," Management Science, INFORMS, vol. 44(4), pages 1431-1449, November.

    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:88:y:1996:i:1:p:50-68. 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.