Hybrid genetic algorithm to minimize scheduling cost with unequal and job dependent earliness tardiness cost

• Bari, Prasad ^[1] ; Karande, Prasad ^[2] ; Bag, Vaidehi ^[1]
  1. [1] Fr. C. Rodrigues Institute of Technology
  2. [2] Veermata Jijabai Technological Institute
• Localización: International Journal of Production Management and Engineering (IJPME), ISSN-e 2340-4876, ISSN 2340-5317, Vol. 12, Nº. 1, 2024, págs. 19-30
• Idioma: inglés
• Enlaces
  • Texto completo
• Resumen

  • This article presents two combinatorial genetic algorithms (GA), unequal earliness tardiness-GA (UET-GA) and job-dependent earliness tardiness-GA (JDET-GA) for the single-machine scheduling problem to minimize earliness tardiness (ET) cost. The sequence of jobs produced in basic UET and JDET as a chromosome is added to the random population of GA. The best sequence from each epoch is also injected as a population member in the subsequent epoch. The proposed improvement seeks to achieve convergence in less time to search for an optimal solution. Although the GA has been implemented very successfully on many different types of optimization problems, it has been learnt that the algorithm has a search ability difficulty that makes computations NP-hard for types of optimization problems, such as permutation-based optimization problems. The use of a plain random population initialization results in this flaw. To reinforce the random population initialization, the proposed enhancement is utilized to obtain convergence and find a promising solution. The cost is further significantly lowered offering the due date as a decision variable with JDET-GA. Multiple tests were run on well-known single-machine benchmark examples to demonstrate the efficacy of the proposed methodology, and the results are displayed by comparing them with the fundamental UET and JDET approaches with a notable improvement in cost reduction.