|
|
Caniupan, M., Bravo, L., & Hurtado, C. A. (2012). Repairing inconsistent dimensions in data warehouses. Data Knowl. Eng., 79-80, 17–39.
Abstract: A dimension in a data warehouse (DW) is a set of elements connected by a hierarchical relationship. The elements are used to view summaries of data at different levels of abstraction. In order to support an efficient processing of such summaries, a dimension is usually required to satisfy different classes of integrity constraints. In scenarios where the constraints properly capture the semantics of the DW data, but they are not satisfied by the dimension, the problem of repairing (correcting) the dimension arises. In this paper, we study the problem of repairing a dimension in the context of two main classes of integrity constraints: strictness and covering constraints. We introduce the notion of minimal repair of a dimension: a new dimension that is consistent with respect to the set of integrity constraints, which is obtained by applying a minimal number of updates to the original dimension. We study the complexity of obtaining minimal repairs, and show how they can be characterized using Datalog programs with weak constraints under the stable model semantics. (c) 2012 Elsevier B.V. All rights reserved.
|
|
|
|
Fernandez, M., Munoz, F. D., & Moreno, R. (2020). Analysis of imperfect competition in natural gas supply contracts for electric power generation: A closed-loop approach. Energy Econ., 87, 15 pp.
Abstract: The supply of natural gas is generally based on contracts that are signed prior to the use of this fuel for power generation. Scarcity of natural gas in systems where a share of electricity demand is supplied with gas turbines does not necessarily imply demand rationing, because most gas turbines can still operate with diesel when natural gas is not available. However, scarcity conditions can lead to electricity price spikes, with welfare effects for consumers and generation firms. We develop a closed-loop equilibrium model to evaluate if generation firms have incentives to contract or import the socially-optimal volumes of natural gas to generate electricity. We consider a perfectly-competitive electricity market, where all firms act as price-takers in the short term, but assume that only a small number of firms own gas turbines and procure natural gas from, for instance, foreign suppliers in liquefied form. We illustrate an application of our model using a network reduction of the electric power system in Chile, considering two strategic firms that make annual decisions about natural gas imports in discrete quantities. We also assume that strategic firms compete in the electricity market with a set of competitive firms do not make strategic decisions about natural gas imports (i.e., a competitive fringe). Our results indicate that strategic firms could have incentives to sign natural gas contracts for volumes that are much lower than the socially-optimal ones, which leads to supernormal profits for these firms in the electricity market. Yet, this effect is rather sensitive to the price of natural gas. A high price of natural gas eliminates the incentives of generation firms to exercise market power through natural gas contracts. (C) 2020 Elsevier B.V. All rights reserved.
|
|
|
|
Osorio-Valenzuela, L., Pereira, J., Quezada, F., & Vasquez, O. C. (2019). Minimizing the number of machines with limited workload capacity for scheduling jobs with interval constraints. Appl. Math. Model., 74, 512–527.
Abstract: In this paper, we consider a parallel machine scheduling problem in which machines have a limited workload capacity and jobs have deadlines and release dates. The problem is motivated by the operation of energy storage management systems for microgrids under emergency conditions and generalizes some problems that have already been studied in the literature for their theoretical value. In this work, we propose heuristic and exact algorithms to solve the problem. The heuristics are adaptations of classical bin packing heuristics in which additional conditions on the feasibility of a solution are imposed, whereas the exact method is a branch-and-price approach. The results show that the branch-andprice approach is able to optimally solve random instances with up to 250 jobs within a time limit of one hour, while the heuristic procedures provide near optimal solution within reduced running times. Finally, we also provide additional complexity results for a special case of the problem. (C) 2019 Elsevier Inc. All rights reserved.
|
|
|
|
Pereira, J. (2016). Procedures for the bin packing problem with precedence constraints. Eur. J. Oper. Res., 250(3), 794–806.
Abstract: The bin packing problem with precedence constraints (BPP-P) is a recently proposed variation of the classical bin packing problem (BPP), which corresponds to a basic model featuring many underlying characteristics of several scheduling and assembly line balancing problems. The formulation builds upon the BPP by incorporating precedence constraints among items, which force successor items to be packed into later bins than their predecessors. In this paper we propose a dynamic programming based heuristic, and a modified exact enumeration procedure to solve the problem. These methods make use of several new lower bounds and dominance rules tailored for the problem in hand. The results of a computational experiment show the effectiveness of the proposed methods, which are able to close all of the previous open instances from the benchmark instance set within very reduced running times. (C) 2015 Elsevier B.V. and Association of European Operational Research Societies (EURO) within the International Federation of Operational Research Societies (IFORS). All rights reserved.
|
|
