Abstract
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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
