Paper Info
Title
Solving flexible job-shop problem with sequence dependent setup time and learning effects using an adaptive genetic algorithm
Abstract
AbstractFor the most schedulling problems studied in literature, job processing times are assumed to be known and constant over time. However, this assumption is not appropriate for many realistic situations where the employees and the machines execute the same task in a repetitive manner. They learn how to perform more efficiently. As a result, the processing time of a given job is shorter if it is scheduled later, rather than earlier in the sequence. In this paper, we consider the flexible job-shop problem (FJSP) with two kinds of constraint, namely, the sequence-dependent setup times (SDST) and the learning effects. Makespan is specified as the objective function to be minimised. To solve this problem, an adaptive genetic algorithm (AGA) is proposed. Our algorithm uses an adaptive strategy based on: 1) the current specificity of the search space; 2) the preceding results of already used operators; 3) their associated parameter settings. We adopt this strategy in order to maintain the balance between exploration and exploitation. Experimental studies are presented to assess and validate the benefit of the incorporation of the learning process to the SDST-FJSP over the original problem.
Year
DOI
Venue
2020
10.1504/ijcistudies.2020.106486
Periodicals
DocType
Volume
Issue
Journal
9
1-2
ISSN
Citations 
PageRank 
1755-4977
0
0.34
References 
Authors
0
3
Name
Order
Citations
PageRank
Ameni Azzouz1204.18
Meriem Ennigrou2466.66
Lamjed Ben Said333548.22