Examinando por Materia "Algoritmos computacionales"
Mostrando 1 - 1 de 1
- Resultados por página
- Opciones de ordenación
Ítem Propuesta de una Metodología de Programación de Operaciones Detallada para Órdenes de Trabajo en Operaciones Secuenciales a Través de Algoritmos Heurísticos Basados en Lógica Proposicional Articulados Sobre una Serie de Autómatas ProgramablesRincón Chaparro, Miguel Ángel; Soriano Méndez, José JairoThe approach to scheduling operations in the short term has become a critical aspect in the current environment by keeping inventories down and delivery times short, and therefore obtaining a sequence of jobs warrants a way To be able to visualize it in the time, based on which the traditional systems of MRP and MRPII do not emphasize the real programming of the finite capacity. The sequencing of works is an enumeration problem of combinatorial character and being represented in different production scenarios with work centers in their distribution; The choice of a sequence between all the options becomes increasingly complex to obtain as the number of jobs increases and the number of machines and refers to working with optimization methods and heuristic algorithms to find a possible solution. When proposing a methodological proposal to determine heuristics based on propositional logic systems at different levels; Where logical reasoning and performance metrics are considered in order to be able to evaluate it as a work sequencing problem in operations programming, taking into account that sequencing problems are considered of great NP-complete algorithmic complexity, can be expressed as A Boolean SAT satisfiability problem. In other words, an optimization problem can be expressed in a decision problem and can be dealt with. To obtain expressions or atomic formulas (fbf well-formed formulas), through concepts of discrete and combinatorial mathematics (set, relations and functions) and mainly the study of propositional logic (called first order logic LPO), to perform operations With the logical variables, fulfilling the properties of the boolean algebra. Once these formulas are obtained, the different process flows are aligned to the flow of information with reasoning in the logical and sequential systems and logical subsystems. With these elements the operation of a finite state machine is modeled, which is considered a more powerful automaton to model the obtained logical functions. The following elements are necessary to start up the finite state machine: the tape (sequence of binary registers {0,1} of the logic system), the head (state transition function in BDD binary decision diagrams) And the program (algorithms performed with concepts of Boolean algebra and switching functions: selectors, encoders, summers, magnitude comparators, etc.) that interprets a transition function over time to obtain a binary type output, representing the Sequence of operations to be programmed in a production plant associated with work centers and related to the inherent resources for the transformation of products