A bi-objective optimisation approach for the critical chain project scheduling problem
by Wuliang Peng; Jiali Lin; Xueli Ma
International Journal of Computing Science and Mathematics (IJCSM), Vol. 13, No. 4, 2021

Abstract: Since time and cost are two important issues in real-life project scheduling applications, the optimisation problems about project make-span and cost have been extensively studied over the last few decades. This study addresses the bi-objective critical chain project scheduling problem aiming at minimising both project make-span and cost. We formulate the conceptual model considering project make-span and cost under both the resource-constraints and precedence relations. In the model, the promised delivery time is used as project make-span, and the discounted cost is used to measure project cost. To solve the problem, an evolutionary algorithm based on greedy randomised adaptive search procedure (GRASP) is proposed to search for the non-dominated solutions of the problem. Several neighbourhood search methods are investigated and compared with each other regarding four multi-objective performance measures: optimal ratio, hyper-volume indicator, epsilon metric and average distance. The computational tests have indicated the algorithm with variable neighbourhood appears to be superior to others.

Online publication date: Wed, 15-Sep-2021

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
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 International Journal of Computing Science and Mathematics (IJCSM):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your 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