Scheduling and shop floor control by means of the modified algorithm of Kaspi-Montreuil and queues theory for an job shop ambient

Abstract

The efficient operation of manufacturing system of a factory requires that operational information system for the scheduling and Shop Floor Control, allow the taking of decisions in minimum scales of time. It is for this reason that the key of success of any scheduling system, it is that this allows to the management to make decisions in short time it has more than enough about operations scheduling, machines and tasks. In this context, some techniques of scheduling they are a coherent tool, that for the type of information end the result they allow in a reliable way to schedule and to evaluate the level of performing of the system. However, they should incorporate more and better techniques hat allow to the administration to have a bigger range of tools that improve the process of taking of decisions in the short time. In this paper the objective is incorporate the sequence algorithm Kaspi-Montreuil modified by the author of the present article, as a technique that allows to obtain results in very quick form, as well as the effective evaluation of the shop floor control system. In a same way, the evaluation of performing will be developed in a parallel way by means of procedures of queues theory in qualitative and quantitative form, keeping in mind fundamental aspects as the times of wait in line, times of wait in the system, the number of works in queue and the time mean of process flow. The reference mark is the state of the art on the problem of sequence of n works in m machines in a Job shop system.