Artículos

URI permanente para esta colección

https://hdl.handle.net/10784/4314

Examinar

Examinando Artículos por Autor "López Jiménez, Juan Diego"

Mostrando 1 - 1 de 1
  • No hay miniatura disponible
    Ítem
    A variable neighborhood search algorithm to minimize the total weighted tardiness on a batch processing machine
    (Revista Ingeniería Industrial, 2011-08-11) López Jiménez, Juan Diego; Vélez Gallego, Mario César; López Jiménez, Juan Diego; Vélez Gallego, Mario César; Universidad EAFIT. Grupo de Investigación Gestión de Producción y Logística; Universidad EAFIT. Departamento de Ingeniería de Producción; marvelez@eafit.edu.co; Gestión de Producción y Logística
    This paper presents the results of a research project conducted to solve a production scheduling problem observed in a system in which meeting customer due dates is the primary objective -- Each job to be scheduled is defined by its processing time, ready time, due date, weight and size -- The Batch Processing Machine (BPM) can process several jobs simultaneously as a batch as long as its capacity is not violated -- The processing time of a batch is the largest processing time among the jobs in the batch, and the batch ready time is the largest ready time among the jobs in the batch -- Given that the problem is NP-hard we propose a Variable Neighborhood Search (VNS) heuristic to minimize the total weighted tardiness on a single BPM -- The computational experiments conducted to assess the quality of the solutions found show that in a computational time restricted to a maximum of 30 minutes, the proposed heuristic finds solutions considerably better than the solutions obtained after implementing a mixed integer programming model available in the literature in a commercial solver