Bi-objective scheduling on two dedicated processors
Adel Kacem and
European Journal of Industrial Engineering, 2019, vol. 13, issue 5, 681-700
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. (search for similar items in EconPapers)
References: Add references at CitEc
Citations: Track citations by RSS feed
Downloads: (external link)
Access to full text is restricted to subscribers.
This item may be available elsewhere in EconPapers: Search for items with the same title.
Export reference: BibTeX
RIS (EndNote, ProCite, RefMan)
Persistent link: https://EconPapers.repec.org/RePEc:ids:eujine:v:13:y:2019:i:5:p:681-700
Access Statistics for this article
More articles in European Journal of Industrial Engineering from Inderscience Enterprises Ltd
Bibliographic data for series maintained by Sarah Parker ().