A planning algorithm in a class of discrete event systems

In this article, we will propose an approach to generate a planning based on the concepts of k-interaction and consensus, showing for this an algorithm that couples the plant with these concepts. In this sense, the resulting models will be reduced and, consequently the computational complexity En es...

Full description

Saved in:
Bibliographic Details
Published in:Dyna (Medellín, Colombia) Colombia), 2018-07, Vol.85 (206), p.283-293
Main Authors: Ruiz, Bladismir, Muñoz, Sergio, Camacho, Claudia, Mata, Guelvis, Méndez, Arnaldo, Zambrano, Hicher
Format: Article
Language:English
Subjects:
discrete event systems
interacciones y consenso
interactions and consensus
planificación
planning
sistemas de eventos discretos
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:In this article, we will propose an approach to generate a planning based on the concepts of k-interaction and consensus, showing for this an algorithm that couples the plant with these concepts. In this sense, the resulting models will be reduced and, consequently the computational complexity En este artículo, nosotros proponemos un enfoque para generar una planificación fundamentada en los conceptos de k-interacción y consenso, mostrando para ello un algoritmo que acopla la planta con dichos conceptos. En este sentido, se reducirán los modelos resultantes y en consecuencia la complejidad computacional
ISSN:0012-7353
DOI:10.15446/dyna.v85n206.69034