IDEAS home Printed from https://ideas.repec.org/a/ids/eujine/v19y2025i2p162-189.html
   My bibliography  Save this article

Discrete time/cost trade-off project scheduling problem with tardiness bounds - an application to the Ministry of Health in Turkey

Author

Listed:
  • Özlem Akbudak
  • GülÅŸah Karakaya
  • Meral AzizoÄŸlu

Abstract

We consider a discrete time/cost trade-off problem with due dates and an upper bound on the total tardiness. Our motivation stems from information technology projects held in the Ministry of Health in Turkey. Our primary objective is to minimise the total cost while obeying the total tardiness bound. We formulate the problem as a mixed integer linear program and propose a heuristic approach that leverages the optimal solutions from the linear programming relaxation of the model. To assess the performances, we conduct tests on instances from relevant literature and the Ministry of Health projects, and report favourable results. We employ the optimal solutions to the constrained optimisation problem to generate the exact non-dominated objective vectors' set with respect to total tardiness and total cost. Additionally, we present an evolutionary algorithm to find an approximate set. The algorithms are demonstrated using the projects of the Ministry of Health in Turkey. [Received: 5 February 2023; Accepted: 10 September 2023]

Suggested Citation

  • Özlem Akbudak & GülÅŸah Karakaya & Meral AzizoÄŸlu, 2025. "Discrete time/cost trade-off project scheduling problem with tardiness bounds - an application to the Ministry of Health in Turkey," European Journal of Industrial Engineering, Inderscience Enterprises Ltd, vol. 19(2), pages 162-189.
    • Handle: RePEc:ids:eujine:v:19:y:2025:i:2:p:162-189
    as

    Download full text from publisher

    File URL: http://www.inderscience.com/link.php?id=144728
    Download Restriction: Access to full text is restricted to subscribers.
    ---><---

    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:ids:eujine:v:19:y:2025:i:2:p:162-189. 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: Sarah Parker (email available below). General contact details of provider: http://www.inderscience.com/browse/index.php?journalID=210 .

    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.