An improved genetic algorithm for multidimensional optimization of precedence-constrained production planning and scheduling

Abstract

Integration of production planning and scheduling is a class of problems commonly found in manufacturing industry. This class of problems associated with precedence constraint has been previously modeled and optimized by the authors, in which, it requires a multidimensional optimization at the same time: what to make, how many to make, where to make and the order to make. It is a combinatorial, NP-hard problem, for which no polynomial time algorithm is known to produce an optimal result on a random graph. In this paper, the further development of Genetic Algorithm (GA) for this integrated optimization is presented. Because of the dynamic nature of the problem, the size of its solution is variable. To deal with this variability and find an optimal solution to the problem, GA with new features in chromosome encoding, crossover, mutation, selection as well as algorithm structure is developed herein. With the proposed structure, the proposed GA is able to ''learn'' from its experience. Robustness of the proposed GA is demonstrated by a complex numerical example in which performance of the proposed GA is compared with those of three commercial optimization solvers.

Suitable Production Tools Selection With the Use of Evolutionary Algorithms

“…This is because the proposed genetic algorithm allows "learning" from its own experience. [2] Running a simulation to support production planning can be used for an early issue detection [3]. Simulations are commonly used for a design valuation during the late stages of product development [4].…”

Collaboration space division in collaborative product development based on a genetic algorithm

“…For every problem, there is no universal GA capable of solving problems superiorly. Meanwhile, the specific problems in chromosome encoding and genetic operation are always needed (Dao et al 2017) . The main characteristic of the GA is that they can search for the optimal solution by point-cluster, rather than point-by-point.…”

Digital twin-based production scheduling system for heavy truck frame shop

“…Liang et al studied the flexible job shop scheduling problem and solved the corresponding model by using an improved genetic algorithm. [13][14][15][16][17] Nugraheni et al 18 investigated the potential use of hyper-heuristics and a multi-agent approach for the solution of the real single machine production scheduling problem. Pakpahan et al 19 proposed an algorithm based on the ant colony optimization method.…”