A self-adaptive hybrid algorithm for solving flexible job-shop problem with sequence dependent setup time

1Citations
Citations of this article
10Readers
Mendeley users who have this article in their library.

Abstract

The flexible job shop problem (FJSP) has an important significance in both fields of production management and combinatorial optimization. This problem covers two main difficulties, namely, machine assignment problem and operation sequencing problem. To reflect as close as possible the reality of this problem, the sequence dependent setup time is taken into consideration. For solving such a complex problem, we propose a hybrid algorithm based on a genetic algorithm (GA) combined with iterated local search (ILS). It is well known that the performance of an algorithm is heavily dependent on the setting of control parameters. For that, our algorithm uses a self-adaptive strategy based on: (1) the current specificity of the search space, (2) the preceding results of already applied algorithms (GA and ILS) and (3) their associated parameter settings. We adopt this strategy in order to detect the next promising search direction and maintain the balance between exploration and exploitation. Computational results show that our algorithm provides better solutions than other well known algorithms.

Cite

CITATION STYLE

APA

Azzouz, A., Ennigrou, M., & Said, L. B. (2017). A self-adaptive hybrid algorithm for solving flexible job-shop problem with sequence dependent setup time. In Procedia Computer Science (Vol. 112, pp. 457–466). Elsevier B.V. https://doi.org/10.1016/j.procs.2017.08.023

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