An efficient meta-heuristic based on self-control dominance concept for a bi-objective re-entrant scheduling problem with outsourcing

1Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We study a two-machine re-entrant flowshop scheduling problem in which the jobs have strict due dates. In order to be able to satisfy all customers and avoid any tardiness, scheduler decides which job shall be outsourced and find the best sequence for in-house jobs. Two objective functions are considered: minimizing total completion time for in-house jobs and minimizing outsource cost for others. Since the problem is NP-hard, an efficient genetic algorithm based on modified self-control dominance concept with adaptive generation size is proposed. Non-dominated solutions are compared with classical NSGA-II regarding different metrics. The results indicate the ability of our proposed algorithm to find a good approximation of the middle part of the Pareto front. © 2012 Springer-Verlag.

Cite

CITATION STYLE

APA

Moghaddam, A., Yalaoui, F., & Amodeo, L. (2012). An efficient meta-heuristic based on self-control dominance concept for a bi-objective re-entrant scheduling problem with outsourcing. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7219 LNCS, pp. 467–471). https://doi.org/10.1007/978-3-642-34413-8_46

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free