Paper Info
Title
Flexible Job-shop Scheduling Problem with Sequence-dependent Setup Times using Genetic Algorithm.
Abstract
Job shop scheduling problems (JSSP) are among the most intensive combinatorial problems studied in literature. The flexible job shop problem (FJSP) is a generalization of the classical JSSP where each operation can be processed by more than one resource. The FJSP problems cover two difficulties, namely, machine assignment problem and operation sequencing problem. This paper investigates 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 genetic algorithm (GA) 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 GA against the available ones in terms of solution quality.
Year
DOI
Venue
2016
10.5220/0005821900470053
ICEIS
Keywords
Field
DocType
Job-shop Scheduling Problem, Flexible Manufacturing Systems, Sequence-dependent Setup Times, Genetic Algorithms
Mathematical optimization,Job shop scheduling,Job shop scheduling problem,Sequence-dependent setup,Computer science,Job shop,Flow shop scheduling,Assignment problem,Genetic algorithm
Conference
Citations 
PageRank 
References 
1
0.36
3
Authors
3
Name
Order
Citations
PageRank
Ameni Azzouz1204.18
Meriem Ennigrou2466.66
Lamjed Ben Said333548.22