Research on Flexible Job Shop Scheduling Optimization Based on Segmented AGV
نویسندگان
چکیده
As a typical transportation tool in the intelligent manufacturing system, Automatic Guided Vehicle (AGV) plays an indispensable role automatic production process of workshop. Therefore, integrating AGV resources into scheduling has become research hotspot. For problem flexible job shop adopting segmented AGV, dual-resource optimization mathematical model machine tools and AGVs is established by minimizing maximum completion time as objective function, improved genetic algorithm designed to solve this study. The designs two-layer coding method based on embeds task allocation decoding realize real dual resource integrated scheduling. When initializing population, three strategies are ensure diversity population. In order improve local search ability quality solution algorithm, neighborhood structures for variable search. superiority influence location number transfer stations results verified two cases.
منابع مشابه
Flexible Assembly Job Shop Scheduling Based on Tabu Search
Flexible assembly job shop scheduling has been proved to be an NP-hard problem. To reduce the complexity, it is always divided into 2 sub-problems: routing sub-problem and sequencing sub-problem. In this paper, in order to develop a solution with high accuracy, we propose a method that can deal with these two sub-problems concurrently. Tabu search, one of the meta-heuristics, is adopted. Some e...
متن کاملFlexible job shop scheduling under availability constraints
In this paper, an exact geometric algorithm is presented for solving two-job sequencing and scheduling problems in flexible flow shop and job shop environments while the resources are (un)available in some time periods and processors (un)availability is the same in all work centers. This study seems utterly new and it is applicable to any performance measure based on the completion time. The in...
متن کاملAn integrated approach for scheduling flexible job-shop using teaching–learning-based optimization method
In this paper, teaching–learning-based optimization (TLBO) is proposed to solve flexible job shop scheduling problem (FJSP) based on the integrated approach with an objective to minimize makespan. An FJSP is an extension of basic job-shop scheduling problem. There are two sub problems in FJSP. They are routing problem and sequencing problem. If both the sub problems are solved simultaneously, t...
متن کاملOptimality of the flexible job shop scheduling system based on Gravitational Search Algorithm
The Flexible Job Shop Scheduling Problem (FJSP) is one of the most general and difficult of all traditional scheduling problems. The Flexible Job Shop Problem (FJSP) is an extension of the classical job shop scheduling problem which allows an operation to be processed by any machine from a given set. The problem is to assign each operation to a machine and to order the operations on the machine...
متن کاملOptimality of the flexible job shop scheduling system based on Gravitational Search Algorithm
The Flexible Job Shop Scheduling Problem (FJSP) is one of the most general and difficult of all traditional scheduling problems. The Flexible Job Shop Problem (FJSP) is an extension of the classical job shop scheduling problem which allows an operation to be processed by any machine from a given set. The problem is to assign each operation to a machine and to order the operations on the machine...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Cmes-computer Modeling in Engineering & Sciences
سال: 2023
ISSN: ['1526-1492', '1526-1506']
DOI: https://doi.org/10.32604/cmes.2022.021433