Abstract
In this paper, we focused on a real-life, large-scale problem of loom scheduling, which has 1100 independent jobs and 133 unrelated parallel machines with machine eligibility constraint. The authors focused on the scheduling problems that includes sequence-dependent setup times and the job splitting property to minimize the makespan. An adapted version of hybrid genetic algorithm in this study, incorporated a machine eligibility constraint. Adding this constraint complicated the problem, but doing so is compulsory to solve a real-life problem. To simplify the problem, we used the typesetting structure of the weaving industry. Utilizing random key numbers provided feasible chromosomes for each generation. Flexible chromosome structures and local search adaptation into the genetic algorithm were some of the other factors that allowed us to improve the makespan by up to 14% in this application.
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.
