Abstract
In this paper, we present a popular machine scheduling problem with resource constraints in manufacturing engineering. A genetic algorithm based approach is put forward and illustrated, including a specialised encoding and two kinds of decoding greedy schemes. Compared with both several kinds of lower bounds we present in this paper and the results from ILOG OPL software package, it is shown that our rapid genetic algorithm achieved significant results with stable and near-optimal performance.
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 callMore From: International Journal of Computer Applications in Technology
Disclaimer: 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.
