Documento de conferencia

URI permanente para esta colección

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

Examinar

Examinando Documento de conferencia por Materia "Combinatorial optimization"

Mostrando 1 - 2 de 2
  • No hay miniatura disponible
    Ítem
    An approach for printing the maximum possible number of images
    (Institute of Industrial Engineers, 2017-01-01) Rojas-Santiago M.; Barbosa R.C.; Muthuswamy S.; Hulett M.; Velez-Gallego M.C.; Universidad EAFIT. Departamento de Ingeniería de Producción; Gestión de Producción y Logística
    This paper considers a real life application of a printing process in a lithographic company that manufactures food packaging bags. The focus area of this problem is to print a variety of 2D images of bags on a surface area for maximum press layouts, with a constraint that the orientation of all bags is fixed and they should be placed parallel to the edges of the impression material. The problem under study is NP-hard and is an extension of the classical knapsack problem. An algorithm to maximize the number of rectangular images of bags that can be placed within the printing material is proposed. The results were compared with a Particle Swarm Optimization (PSO) metaheuristic. Several numerical experiments show that our procedure outperforms the PSO algorithm and improves the lithography's performance.
  • No hay miniatura disponible
    Ítem
    Heuristic to allocate intermediate buffer storage capacities in a production line subject to machine breakdowns
    (Production and Operations Management Society (POMS), 2013-05-03) Vélez Gallego, Mario César; Jaramillo Jiménez, Jhull Breynner; Universidad EAFIT. Departamento de Ingeniería de Producción; marvelez@eafit.edu.co; Gestión de Producción y Logística
    In this research proposal we consider a production line subject to random failures at each workstation and operating under a make-to-stock policy -- Every time a workstation fails, a corrective maintenance activity is triggered to repair the workstation -- In order to palliate the effect of the random failures in the performance of the system, intermediate buffers are placed in-between workstations -- An inventory holding cost is associated to eachbuffer -- The research objective in this work is to allocate capacity to each intermediate buffer in the line so that the average cost per time unit is minimized while the average service level is kept above a minimum pre-specified value -- In this paper we assume that unsatisfied demand is lost and the service level is defined as the long term proportion of satisfied demand -- A greedy simulation–based heuristic is presented to find a feasible solution to the problem