Uso combinado de GRASP y Path-Relinking en la programación de producción para minimizar la tardanza total ponderada en una máquina

This paper shows the results of integrating two meta-heuristic techniques, GRASP and Path-Relinking, which have not been widely used to solve production-scheduling problems despite of their proved efficiency. These techniques were used to solve the problem of minimizing total weighted tardiness problem in a machine, 1 Σ W_jT_j, and good results in short time were obtained. Experiment outcomes show that the use of Path-Relinking as a final step for GRASP can result in qualitysequence improvements. In order to use GRASP in the solution to this problem, a dynamic utility function for the jobs to process, bearing in mind its descriptive parameters, is proposed. Additionally, this work offers a clear implementation proposal for ventures of different sizes, so they are able to overcome this problem by using MS Excel, instead of specialized scheduling software.