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]
Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
