Abstract
ABSTRACT The first objective of this study is to update a capacity constraint to the mixed integer programming model of the unrelated parallel machines scheduling problem. Then, a new proposed algorithm is developed based on the combination between the genetic algorithm with the so-called ISETP heuristics (Initial Sequence based on Earliness-Tardiness criterion on Parallel machine). The new Genetic Algorithm with Initial Sequence based on Earliness-Tardiness criterion on Parallel machine (GAISETP) generates job sequences and allocates them to the machines subject to capacity constraint. A case of automobile component manufacturing company is investigated to test the performance of the proposed method for both small-sized and large-sized problems. The obtained results are very promising both in terms of makespan and earliness-tardiness.
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.
