SOLVING A MULTI-OBJECTIVE FLEXIBLE JOB SHOP SCHEDULING PROBLEM WITH TIMED PETRI NETS AND GENETIC ALGORITHM
2010 ◽
Vol 02
(02)
◽
pp. 221-237
◽
Keyword(s):
Job Shop
◽
The method presented in this paper is used to solve flexible job shop scheduling problem (JSP) with multiple objectives, which is much more complex than the classical JSP. Based on timed Petri net model, genetic algorithm is applied to solve the scheduling problems. The chromosomes are composed by sequences of transitions, the crossover and mutation operations are based on transition sequences. The experiment result shows that a definite solution to a specific flexible job shop scheduling problem can be found.
2018 ◽
Vol 2018
◽
pp. 1-32
◽
2013 ◽
Vol 47
(2/3)
◽
pp. 280
◽
2021 ◽
2019 ◽
Vol 612
◽
pp. 042065