scholarly journals Job Shop Scheduling with Fuzzy Duedate and Fuzzy Processing Time through Genetic Algorithms

1997 ◽  
Vol 9 (2) ◽  
pp. 231-238 ◽  
Author(s):  
Masatoshi SAKAWA ◽  
Tetsuya MORI
Keyword(s):  
Genetic Algorithms ◽  
Processing Time ◽  
Job Shop ◽  
Job Shop Scheduling ◽  
Shop Scheduling ◽  
Fuzzy Processing Time

A flower pollination algorithm for flexible job shop scheduling with fuzzy processing time

2018 ◽  
Vol 32 (34n36) ◽  
pp. 1840113 ◽  
Author(s):  
Wenhao Xu ◽  
Zhicheng Ji ◽  
Yan Wang
Keyword(s):  
Processing Time ◽  
Job Shop ◽  
Job Shop Scheduling ◽  
Triangular Fuzzy Number ◽  
Flower Pollination Algorithm ◽  
Flexible Job Shop ◽  
Flexible Job Shop Scheduling ◽  
Shop Scheduling ◽  
Flower Pollination ◽  
Fuzzy Processing Time

Considering the uncertainty in real manufacturing workshops, the fuzzy flexible job shop scheduling problem (fFJSP) is addressed, in which the triangular fuzzy number is used to represent the processing time. A discrete flower pollination algorithm (DFPA) is proposed in this paper to minimize the maximum fuzzy completion time. Flower pollination algorithm (FPA) is inspired by the pollination process of flowering plants, which realizes global search and local search by means of cross-pollination and self-pollination of flowers in nature. DFPA extends to FPA by introducing discrete operator during iterations. Simulation results on instances validate the effectiveness and feasibility of this algorithm compared with particle swarm optimization.

Sign in / Sign up

Export Citation Format

Share Document