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 integer programming model is proposed for the operation sequencing with precedence constraints. And an adaptive evolutionary approach for the problem is developed by employing the adaptive genetic operation functions to obtain a good solution for relatively large problems in a reasonable computational time. Computational experiments for the model are performed and the results are analyzed.