REVISTA DYNA NEW TECHNOLOGIES

Key words:

problema de distribución de planta, problema de programación de trabajos en un ambiente de fabricación de taller, el problema concurrente de distribución de planta y programación de trabajos, heurístico

Article type:

ARTICULO DE INVESTIGACION / RESEARCH ARTICLE

Section:

RESEARCH ARTICLES

ABSTRACT:
In this paper we propose a new approach that jointly addresses the facility layout problem and the scheduling of a sequence of jobs. In real production these two problems are interrelated; however, they are treated separately in the literature. Our approach is an extension of the job shop problem with transportation delays, where the location of the machines is selected among possible sites. The model minimizes the makespan, using the short processing times rule with best fit. Three approaches derived from a proposed heuristic are compared; the first one considers all the permutations for the location of machines, the second takes into account just some specific arrangements, the third one is a heuristic that utilizes random search which reduces computational time. In order to validate the obtained results, some instances taken from the literature are tested and compared with our proposed heuristic. From the results, it is noted that algorithm three is better than algorithm two in terms of makespan and also it improves the computational time with respect to algorithm one and the literature. The advantage of this method, is that is ease to be implemented and also because it provides the sequence of operations and the arrangement of machines, including transport, process and dead times.

Key Words: layout , job shop scheduling, short processing time, heuristic