Abstract
Based on Genetic Algorithm and schedule theory, a two dimension coding Genetic Algorithm is presented for solving the NP-hard single machine total weighted completion time problem with controllable processing times. When the mathematic model is given, the two dimension coding method is proposed to describe the job sequence and actual processing time. Because of the problem's characters, the new crossover and mutation operations of GA are defined. The two dimension coding GA not only can start with better initial populations, but also can reach the solutions more precise and faster. Applying it to the example, the simulation results show that satisfactory performance is obtained.
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.
