Abstract
It’s an NP problem for distributing tools for job-shop tasks when the schedules were formulated, and it belongs to multiple-constrained and multiple-objective problem. Based on adaptive weight approach, the restriction and multiple objective problems were solved. The optimization dynamic distribution model for this problem was established. Then heuristic and self-adaptive genetic algorithm was presented. In order to express the dynamic of the distribution result, Two-dimensional coding technology was adopted, a new coding rule combining dispatching rule was designed. The results show that hybrid self-adaptive genetic algorithm based on adaptive weight approach forms well for multiple-constrained and multiple-objective job-shop tool dynamic distribution.
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.
