A hybrid algorithm for flexible job-shop scheduling problem with setup times

  • Azzouz A
  • Ennigrou M
  • Ben Said L
N/ACitations
Citations of this article
8Readers
Mendeley users who have this article in their library.

Abstract

Job-shop scheduling problem is one of the most important fields in manufacturing optimization where a set of n jobs must be processed on a set of m specified machines. Each job consists of a specific set of operations, which have to be processed according to a given order. The Flexible Job Shop problem (FJSP) is a generalization of the above-mentioned problem, where each operation can be processed by a set of resources and has a processing time depending on the resource used. The FJSP problems cover two difficulties, namely, machine assignment problem and operation sequencing problem. This paper addresses the flexible job-shop scheduling problem with sequence-dependent setup times to minimize two kinds of objectives function: makespan and bi-criteria objective function. For that, we propose a hybrid algorithm based on genetic algorithm (GA) and variable neighbourhood search (VNS) to solve this problem. To evaluate the performance of our algorithm, we compare our results with other methods existing in literature. All the results show the superiority of our algorithm against the available ones in terms of solution quality.

Cite

CITATION STYLE

APA

Azzouz, A., Ennigrou, M., & Ben Said, L. (2017). A hybrid algorithm for flexible job-shop scheduling problem with setup times. International Journal of Production Management and Engineering, 5(1), 23. https://doi.org/10.4995/ijpme.2017.6618

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