The sensitive sequence of operations with precedence constraints by an adaptive evolutionary algorithm

The precedence relationships between the operations are important constraints in planning and scheduling of manufacturing systems and project management. This paper presents a method to obtain a global solution for operation sequencing with precedence constraints which are one of the most influential factors in the performance of planning and scheduling problems. An adaptive evolutionary approach for the problem is developed by employing the adaptive evolutionary operation functions to obtain a sturdy and good solution for relatively large problems in a reasonable amount of computational time. Sensitivity of solutions that imply a degree of sturdiness is considered by a modified fitness function. Computational experiments for the model are performed and the results are analyzed.