Journal
SYMMETRY-BASEL
Volume 11, Issue 2, Pages -Publisher
MDPI
DOI: 10.3390/sym11020165
Keywords
Dynamic job-shop; Parallel Machines; Maximum flow-time of components; Genetic Algorithm
Categories
Funding
- National Natural Science Foundation of China [61772454, 61811530332, 61811540410, U1836208]
Ask authors/readers for more resources
In a real manufacturing environment, the set of tasks that should be scheduled is changing over the time, which means that scheduling problems are dynamic. Also, in order to adapt the manufacturing systems with fluctuations, such as machine failure and create bottleneck machines, various flexibilities are considered in this system. For the first time, in this research, we consider the operational flexibility and flexibility due to Parallel Machines (PM) with non-uniform speed in Dynamic Job Shop (DJS) and in the field of Flexible Dynamic Job-Shop with Parallel Machines (FDJSPM) model. After modeling the problem, an algorithm based on the principles of Genetic Algorithm (GA) with dynamic two-dimensional chromosomes is proposed. The results of proposed algorithm and comparison with meta-heuristic data in the literature indicate the improvement of solutions by 1.34 percent for different dimensions of the problem.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available