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

ε-constraint procedures for Pareto front optimization of large size discrete time/cost trade-off problem

Author

Listed:
  • Aminbakhsh, Saman
  • Sönmez, Rifat
  • Atan, Tankut

Abstract

The discrete time/cost trade-off problem (DTCTP) optimizes the project duration and/or cost while considering the trade-off between activity durations and their direct costs. The complete and non-dominated time-cost profile over the set of feasible project durations is achieved within the framework of Pareto front problem. Despite the importance of Pareto front optimization in project and portfolio management, exact procedures have achieved very limited success in solving the problem for large size instances. This study develops exact procedures based on combinations of mixed-integer linear programming (MILP), ε-constraint method, network and problem reduction techniques, and present new bounding strategies to solve the Pareto problem for large size instances. This study also provides new large size benchmark problem instances aiming to represent the size of real-life projects for the DTCTP. The new instances, therefore, are generated to include up to 990 activities and nine execution modes. Computational experiments reveal that the procedures presented herein can remarkably outperform the state-of-the-art exact methods. The new exact procedures enabled obtaining the optimal Pareto front for instances with serial networks that include more than 200 activities for the first time.

Suggested Citation

  • Aminbakhsh, Saman & Sönmez, Rifat & Atan, Tankut, 2025. "ε-constraint procedures for Pareto front optimization of large size discrete time/cost trade-off problem," European Journal of Operational Research, Elsevier, vol. 322(3), pages 753-769.
    • Handle: RePEc:eee:ejores:v:322:y:2025:i:3:p:753-769
    DOI: 10.1016/j.ejor.2024.11.032
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377221724009019
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.ejor.2024.11.032?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.

    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:322:y:2025:i:3:p:753-769. 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: 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.