Artículos
URI permanente para esta colección
Examinar
Examinando Artículos por Materia "ALGORITMOS GENÉTICOS"
Mostrando 1 - 2 de 2
Resultados por página
Opciones de ordenación
Ítem Makespan minimization in a job shop with a BPM using simulated annealing(Springer London, 2013-03-08) Rojas Santiago, Miguel; Vélez Gallego, Mario César; Damodaran, Purushothaman; Muthuswamy, Shanthi; Rojas Santiago, Miguel; Vélez Gallego, Mario César; Damodaran, Purushothaman; Muthuswamy, Shanthi; Universidad EAFIT. Departamento de Ingeniería de Producción; marvelez@eafit.edu.co; Gestión de Producción y LogísticaA scheduling problem commonly observed in the metal working industry has been studied in this research effort -- A job shop equipped with one batch processing machine (BPM) and several unit-capacity machines has been considered. Given a set of jobs, their process routes,processing requirements, and size, the objective is to schedule the jobs such that the makespan is minimized -- The BPM can process a batch of jobs as long as its capacity is not exceeded -- The batch processing time is equal to the longest processing job in the batch -- If no batches were to be formed, the scheduling problem under study reduces to the classicaljob shop problem with makespan objective, which is known to be nondeterministic polynomial time-hard -- A network representation of the problem using disjunctive and conjunctive arcs, and a simulated annealing (SA) algorithm are proposed to solve the problem. The solution quality and run time of SA are compared with CPLEX, a commercial solver used to solve the mathematical formulation and with four dispatching rules -- Experimental study clearly highlights the advantages, in terms of solution quality and run time, of using SA to solve large-scale problemsÍtem Metaheurísticos: una alternativa para la solución de problemas combinatorios en Administración de Operaciones(Revista EIA, 2007-12) Vélez, Mario César; Montoya, José Alejandro; Universidad EAFIT. Departamento de Ingeniería de Producción; marvelez@ eafit.edu.co; jmonto36@eafit.edu.co; Gestión de Producción y LogísticaThe scarce diffusion given to the newest techniques for solving complex operations management problems has as a direct consequence that companies lose opportunities to operate at lower costs and higher efficiency -- The objective of this article is to introduce and explain the fundamental ideas behind metaheuristics, a solution technique for combinatorial problems that has received the most attention from the academiccommunity in the last few years -- In order to illustrate these ideas, an example of a classical combinatorial problem in the sequencing of operations area is presented, and a solution algorithm making use of some of these techniques is proposed