A Bayesian-Grouping Based Hybrid Distributed Cooperative Evolutionary Optimization for Large-Scale Flexible Job-Shop Scheduling Problem
نویسندگان
چکیده
منابع مشابه
A Bayesian Optimization-based Evolutionary Algorithm for Flexible Job Shop Scheduling
Flexible Job-shop Scheduling Problem (fJSP) is a typical and important scheduling problem in Flexible Manufacturing System (FMS). The fJSP is an extended version of Job-shop Scheduling (JSP) that is NP hard problem. Due to it according with the real production system, we adopt a hybrid evolutionary computation algorithm to solve the fJSP problems. Among them, the Bayesian Optimization Algorithm...
متن کاملPareto-based Hybrid Multi-Objective Evolutionary Algorithm for Flexible Job-shop Scheduling Problem
In this paper, flexible job-shop scheduling problem (FJSP) is studied in the case of optimizing different contradictory objectives consisting of: (1) minimizing makespan, (2) minimizing total workload, and (3) minimizing workload of the most loaded machine. As the problem belongs to the class of NP-Hard problems, a new hybrid evolutionary algorithm is proposed to obtain a large set of Pareto-op...
متن کاملSingle Objective Evolutionary Algorithm for Flexible Job-shop Scheduling Problem
A meta-heuristic approach for solving the flexible job-shop scheduling problem (FJSP) is presented in this study. This problem consists of two sub-problems, the routing problem and the sequencing problem and is among the hardest combinatorial optimization problems. We propose a Evolutionary Algorithm (EA) for the FJSP. Our algorithm uses several different rules for generating the initial popula...
متن کاملA Study of Cooperative Co-evolutionary Genetic Algorithm for Solving Flexible Job Shop Scheduling Problem
Flexible Job Shop Problem (FJSP) is an extension of classical Job Shop Problem (JSP). The FJSP extends the routing flexibility of the JSP, i.e assigning machine to an operation. Thus it makes it more difficult than the JSP. In this study, Cooperative Coevolutionary Genetic Algorithm (CCGA) is presented to solve the FJSP. Makespan (time needed to complete all jobs) is used as the performance eva...
متن کاملHybrid evolutionary algorithm-based real-world flexible job shop scheduling problem: application service provider approach
This paper presents an approach for scheduling of customers’ orders in factories of plastic injection machines (FPIM) as a case of real-world flexible job shop scheduling problem. The objective of discussed work is to provide FPIM with high business speed which implies (a) providing a customers with convenient way for remote online access to the factory’s database and (b) developing an efficien...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Access
سال: 2021
ISSN: 2169-3536
DOI: 10.1109/access.2021.3076732