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

Özlem Akbudak, Gülşah Karakaya and Meral Azizoğlu

European Journal of Industrial Engineering, 2025, vol. 19, issue 2, 162-189

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]

Keywords: discrete time/cost trade-off project scheduling problem; mixed integer linear program; heuristic approach; evolutionary algorithm. (search for similar items in EconPapers)
Date: 2025
References: Add references at CitEc
Citations:

Downloads: (external link)
http://www.inderscience.com/link.php?id=144728 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:ids:eujine:v:19:y:2025:i:2:p:162-189

Access Statistics for this article

More articles in European Journal of Industrial Engineering from Inderscience Enterprises Ltd
Bibliographic data for series maintained by Sarah Parker ().