Abstract
This paper presents a scheduling method using a genetic algorithm for LSI assembling processes. The new method uses a new mutation named block exchange for reducing the number of exchanging tools for assembling machines. The new mutation directly handles schedules on the gantt chart. A performance index which considers both the total operating time and the number of tool exchange is introduced. The proposed scheduling method can handle multiple assembling processes with such constraints as minimum number of exchanging tools and/or minimum operating time.Simulations using actual data of LSI assembling processes are done to verify the feasibility of the new method, and the results show that the new scheduling method is highly potential for field use.
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.
