@article{Caballero-Villalobos_Alvarado-Valencia_2011, title={Greedy randomized adaptive search procedure (GRASP): A valuable alternative for minimizing machine total weighted tardiness}, volume={14}, url={https://revistas.javeriana.edu.co/index.php/iyu/article/view/1126}, DOI={10.11144/Javeriana.iyu14-2.gras}, abstractNote={<p>A GRASP algorithm was implemented in a common spreadsheet for single machine scheduling total weighted tardiness problem, and was tested with OR-Library instances. Results were compared with optimum or best known schedules for each instance, yielding less than 1% of difference in 93% of the cases, which results in an excellent tradeoff among results quality, computational effort and implementation easiness. Local search was performed on the post-optimization phase, based on dominancy rules, which yielded even better results with little implementation effort.</p>}, number={2}, journal={Ingenieria y Universidad}, author={Caballero-Villalobos, Juan Pablo and Alvarado-Valencia, Jorge Andrés}, year={2011}, month={Mar.}, pages={275} }