Discrete time/cost trade-off project scheduling problem with tardiness bounds - an application to the Ministry of Health in Turkey Online publication date: Fri, 28-Feb-2025
by Özlem Akbudak; Gülşah Karakaya; Meral Azizoğlu
European J. of Industrial Engineering (EJIE), Vol. 19, No. 2, 2025
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]
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the European J. of Industrial Engineering (EJIE):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email subs@inderscience.com