Abstract
This paper propounds the bi-criteria scheduling problem with identical parallel machines, volatile due dates and processing times. A robust and simple structured nature inspired approach has been applied for minimisation of maximum tardiness as the primary and the number of tardy jobs as the secondary criteria. The optimal values of both criteria are evaluated on the trot confined with a constraint that optimal value of secondary criteria does not infringe the primary criteria in the opposite sense of the requirement. To unfold such kind of NP hard optimisation problems, genetic algorithm (GA) has shown a great advantage in solving the combinatorial optimisation problems in view of its characteristic that has high efficiency and is the best fit for practical application. In this paper, a multi-step crossover fusion operator of genetic algorithms (MSXF) has been introduced and applied to a set of randomly generated problems of different sizes. The results obtained are correlated with the other crossover operators. Computational results show that MSXF operator outperforms all the most every time on randomly generated problems analogous to the parameter under consideration.
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 callMore From: International Journal of Mathematics in Operational Research
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.
