Zobrazeno 1 - 4
of 4
pro vyhledávání: '"Ye Jieran"'
Publikováno v:
E3S Web of Conferences, Vol 95, p 04007 (2019)
To deal with the job-shop scheduling problem (JSP), a tabu-genetic hybrid search algorithm is proposed. The algorithm generates several initial solutions distributed in the whole solution space for tabu search by genetic algorithm, which avoids the o
Externí odkaz:
https://doaj.org/article/79fb0862c0574add899c1afcfe8d7339
Publikováno v:
2020 IEEE 11th International Conference on Mechanical and Intelligent Manufacturing Technologies (ICMIMT).
In order to satisfy better the actual situation of modern manufacturing enterprise workshop scheduling and the need of lean production, this paper considers the job shop scheduling problem with inventories and batch size of each job. In this problem,
Publikováno v:
2020 IEEE 11th International Conference on Mechanical and Intelligent Manufacturing Technologies (ICMIMT).
For the flexible job-shop scheduling problem, an optimal scheduling model with the objective of minimum completion time is established, and an improved grey wolf optimizer is proposed. The algorithm improves the coding method based on Largest Order V
Publikováno v:
2019 IEEE 10th International Conference on Mechanical and Intelligent Manufacturing Technologies (ICMIMT).
To deal with the flexible job-shop scheduling problem (FJSP), an improved genetic algorithm based on neighborhood search is proposed. The algorithm adds the design of neighborhood search compared with the traditional GA, which makes the general indiv