Bi-objective scheduling on two dedicated processors Online publication date: Mon, 09-Sep-2019
by Adel Kacem; Abdelaziz Dammak
European J. of Industrial Engineering (EJIE), Vol. 13, No. 5, 2019
Abstract: In this work, we study a bi-objective scheduling problem on two dedicated processors. The aim is to minimise the makespan and the total tardiness. This NPhard problem in the strong sense requires the use of well-adapted methods. Our contribution includes lower bounds for each studied criterion and a genetic algorithm adapted for the multi-criteria context. The lower bounds allows us to evaluate the quality of feasible solutions and the genetic algorithm incorporates the optimisation part. We implemented our approach by considering the aggregative, NSGA-II and the Pareto scenarios on a large set of instances. The obtained results show the effectiveness of the proposed algorithms. [Received: 27 August 2018; Revised: 25 January 2019; Accepted: 12 March 2019]
Online publication date: Mon, 09-Sep-2019
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 firstname.lastname@example.org