Title: Bi-objective scheduling on two dedicated processors

Authors: Adel Kacem; Abdelaziz Dammak

Addresses: Modeling and Optimization for Decisional, Industrial and Logistic Systems Laboratory, Faculty of Economics and Management, University of Sfax, Airport Street, km 4, Post Office Box 1088, 3018 Sfax, Tunisia ' Faculty of Economics and Management, University of Sfax, Airport Street, km 4, Post Office Box 1088, 3018 Sfax, Tunisia

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]

Keywords: scheduling; total of tardiness; tasks; makespan; dedicated processors; genetic algorithms; lower bound; bi-objective; Pareto front; NSGA-II.

DOI: 10.1504/EJIE.2019.102165

European Journal of Industrial Engineering, 2019 Vol.13 No.5, pp.681 - 700

Received: 08 May 2021
Accepted: 12 May 2021

Published online: 02 Aug 2019 *

Full-text access for editors Access for subscribers Purchase this article Comment on this article