1,721,008 research outputs found

    A Set Covering Formulation of the Matrix Equipartition Problem

    No full text
    This paper is concerned with a certain matrix decomposition problem which has been shown to be NP-hard (MATRIX EQUIPARTITION). Given a (0, 1)-matrix M with row-set R. MATRIX EQUIPARTITION consists in finding two equicardinality subsets R1 and R2 of R with maximum size, such that every row of R1 is disjoint from every row of R2. In addition to its theoretical significance, the problem arises also in applicative contexts like, for example, the design of Very Large Scale Integrated circuits (VLSI-design) and Flexible Manufacturing Systems (FMS). We prove that MATRIX EQUIPARTITION admits a Set Covering formulation. Although such formulation contains exponentially many constraints, it is easy to check implicitly whether a (0, 1)-vector satisfies all of them and, if not, to generate a set of violated constraints from the formulation. Such property is used to design an incremental algorithm to solve the problem to optimality. We tested the algorithm on several test problems and compared it to a standard Branch & Bound strategy

    A Multi Agents Model for Extended Factory Production Management

    No full text
    In this paper, we study the problem of managing a supply chain by using a supervised multi-agent model, where autonomous agents correspond to facilities. The discussed model is suitable when the supply chain is composed by a set of enterprises which, on one hand, are integrated in a so called extended factory to cooperate in producing a certain product, and, on the other hand, have to satisfy demands coming from some external clients. Our study is aimed to modeling the supply chain formed by a set of Italian factories cooperating in producing refrigerator's compressors. The problem we deal with is to minimize the total production cost of the extended factory while satisfying a certain degree of quality of service to its customers
    corecore