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

Date

2025-01-01

Author

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

Metadata

Show full item record

This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.

Item Usage Stats

25
views

0
downloads

Cite This

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.

URI

https://www.inderscience.com/info/inarticle.php?artid=144728
https://hdl.handle.net/11511/113908

Collections

Department of Business Administration, Article