Incorporating voltage/reactive representation to short-term generation scheduling models

This paper proposes a methodology to incorporate voltage/reactive representation to Short Term Generation Scheduling (STGS) models, which is based on active/reactive decoupling characteristics of power systems. In such approach STGS is decoupled in both Active (AGS) and Reactive (RGS) Generation Scheduling models. AGS model establishes an initial active generation scheduling through a traditional dispatch model. The scheduling proposed by AGS model is evaluated from the voltage/reactive points of view, through the proposed RGS model. RGS is formulated as a sequence of T nonlinear OPF problems, solved separately but taking into account load tracking between consecutive time intervals. This approach considerably reduces computational effort to perform the reactive analysis of the RGS problem as a whole. When necessary, RGS model is capable to propose active generation redispatches, such that critical reactive problems (in which all reactive variables have been insufficient to control the reactive problems) can be overcome. The formulation and solution methodology proposed are evaluated in the IEEE30 system in two case studies. These studies show that the methodology is robust enough to incorporate reactive aspects to STGS problem.

Relax and fix heuristics to solve one-stage one-machine lot-scheduling models for small-scale soft drink plants

Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)

Solution approaches for the soft drink integrated production lot sizing and scheduling problem

Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)

Weekly Self-Scheduling, Forward Contracting, and Offering Strategy for a Producer

Within a weekly market horizon, this paper considers a power producer that sells its energy both in the pool and through weekly forward contracts. The paper provides a methodology that allows the producer to derive the self-scheduling of its production units, to select weekly forward contracts, and to obtain the offering strategy for Monday's pool. The proposed technique is based on stochastic programming and allows the producer to maximize its expected profit while controlling the risk of profit variability. A comprehensive case study is used to illustrate the characteristics of the proposed methodology. Appropriate conclusions are finally drawn.

Effect of soil moisture content and the irrigation frequency on the sugarcane germination

The aim of this work was to observe the interaction between soil moisture and irrigation time intervals on the germination of sugarcane cv. RB785148 sets in semi-controlled conditions. One-bud sets of the variety RB785148 were germinated in ceramic pots filled with soil under a transparent PVC cover using soil humidity levels of 22, 25 and 30%, that were restored at intervals of 7, 14 and 21 days. The experiment was carried out at three different periods of the year: May-June/94; Oct.-Nov./94; and Mar.-Apr./95. The results indicate that the germination decreased mainly in function of the decrease in soil humidity, whereas irrigation interval have no statistical effect on germination. An interaction between humidity level and irrigation interval was observed. A variation of the timecourse of the germination could be observed when the results of the experiments installed at different dates were compared.

Digital image analysis of root distribution towards improved irrigation water and soil management: Grapevine and date palm study cases

It is presented two study cases about the approach in root analysis at field and laboratory conditions based on digital image analysis. Grapevine (Vitis vinifera L.) and date palm (Phoenix dactylifera L.) root systems were analyzed by both the monolith and trench wall method aided by digital image analysis. Correlation between root parameters and their fractional distribution over the soil profile were obtained, as well as the root diameter estimation. Results have shown the feasibility of digital image analysis for evaluation of root distribution.

Economic viability and selection of irrigation systems using simulation and stochastic dominance

Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)

Smear layer removal capacity of disinfectant solutions used with and without EDTA for the irrigation of canals: a SEM study.

The purpose of this study was to carry out a scanning electron microscopic (SEM) analysis of the cleaning qualities and smear layer removal from root canal walls, instrumented and irrigated with 2.5% NaOCl, 2.0% chlorhexidine and saline solutions. Fifty extracted teeth were used in this study. All teeth were radiographed to determine the existence of a single canal. The crowns were cut at the cervical limit and the root canals were instrumented with K-type files up to size 45. During root canal preparation, irrigations were made with the different solutions being evaluated: Group 1: 2.5% NaOCl (10 roots); Group 2: 2.5% NaOCl and 17% EDTA for 2 minute (10 roots); Group 3: 2.0% chlorhexidine (10 roots); Group 4: 2.0% chlorhexidine and 17% EDTA for 2 minutes (10 roots); Group 5: saline solution (5 roots); Group 6: saline solution and 17% EDTA for 2 minutes (5 roots). After instrumentation, the canals were irrigated with each one of the solutions and the roots were cut in the buccolingual direction for SEM analysis, at the cervical, middle and apical thirds, to ascertain the presence or absence of smear layer and debris. SEM analysis was performed by three calibrated examiners and scores were submitted to Kruskal-Wallis test at the significance level of p = 5%. Results showed that the use of 17% EDTA decreased the smear layer significantly (p < 0.05) for all evaluated solutions in all thirds. When EDTA was not used, a significantly higher quantity of smear layer on the apical third was observed only in the NaOCl groups. The use of 17% EDTA was significant for debris removal except for the chlorhexidine groups. The following conclusion could be drawn: the use of 17% EDTA was necessary to enhance cleanness of the root canals.

Lot sizing and furnace scheduling in small foundries

A lot sizing and scheduling problem prevalent in small market-driven foundries is studied. There are two related decision levels: (1) the furnace scheduling of metal alloy production, and (2) moulding machine planning which specifies the type and size of production lots. A mixed integer programming (MIP) formulation of the problem is proposed, but is impractical to solve in reasonable computing time for non-small instances. As a result, a faster relax-and-fix (RF) approach is developed that can also be used on a rolling horizon basis where only immediate-term schedules are implemented. As well as a MIP method to solve the basic RF approach, three variants of a local search method are also developed and tested using instances based on the literature. Finally, foundry-based tests with a real-order book resulted in a very substantial reduction of delivery delays and finished inventory, better use of capacity, and much faster schedule definition compared to the foundry's own practice. © 2006 Elsevier Ltd. All rights reserved.

Heuristics and meta-heuristics for lot sizing and scheduling in the soft drinks industry: A comparison study

This chapter studies a two-level production planning problem where, on each level, a lot sizing and scheduling problem with parallel machines, capacity constraints and sequence-dependent setup costs and times must be solved. The problem can be found in soft drink companies where the production process involves two interdependent levels with decisions concerning raw material storage and soft drink bottling. Models and solution approaches proposed so far are surveyed and conceptually compared. Two different approaches have been selected to perform a series of computational comparisons: an evolutionary technique comprising a genetic algorithm and its memetic version, and a decomposition and relaxation approach. © 2008 Springer-Verlag Berlin Heidelberg.

Evaluating genetic algorithms with different population structures on a lot sizing and scheduling problem

This paper studies the use of different population structures in a Genetic Algorithm (GA) applied to lot sizing and scheduling problems. The population approaches are divided into two types: single-population and multi-population. The first type has a non-structured single population. The multi-population type presents non-structured and structured populations organized in binary and ternary trees. Each population approach is tested on lot sizing and scheduling problems found in soft drink companies. These problems have two interdependent levels with decisions concerning raw material storage and soft drink bottling. The challenge is to simultaneously determine the lot sizing and scheduling of raw materials in tanks and products in lines. Computational results are reported allowing determining the better population structure for the set of problem instances evaluated. Copyright 2008 ACM.

A nonlinear model for the long-term hydro-thermal generation scheduling problem over multiple areas with transmission constraints

This paper presents a nonlinear model with individual representation of plants for the centralized long-term hydrothermal scheduling problem over multiple areas. In addition to common aspects of long-term scheduling, this model takes transmission constraints into account. The ability to optimize hydropower exchange among multiple areas is important because it enables further minimization of complementary thermal generation costs. Also, by considering transmission constraints for long-term scheduling, a more precise coupling with shorter horizon schedules can be expected. This is an important characteristic from both operational and economic viewpoints. The proposed model is solved by a sequential quadratic programming approach in the form of a prototype system for different case studies. An analysis of the benefits provided by the model is also presented. ©2009 IEEE.

Simulation of computational grids scheduling politics

Computational grids allow users to share resources of distributed machines, even if those machines belong to different corporations. The scheduling of applications must be performed aiming at performance goals, and focusing on choose which processes can have access to specif resources, and which resources. In this article we discuss aspects of scheduling of application in grid computing environment. We also present a tool for scheduling simulation along with test scenarios and results.