Towards realistic core-failure-resilient scheduling and analysis

Presented at IEEE Real-Time Systems Symposium (RTSS 2015). 1 to 4, Dec, 2015. San Antonio, U.S.A..

A multi-objective optimization of the active and reactive resource scheduling at a distribution level in a smart grid context

In the traditional paradigm, the large power plants supply the reactive power required at a transmission level and the capacitors and transformer tap changer were also used at a distribution level. However, in a near future will be necessary to schedule both active and reactive power at a distribution level, due to the high number of resources connected in distribution levels. This paper proposes a new multi-objective methodology to deal with the optimal resource scheduling considering the distributed generation, electric vehicles and capacitor banks for the joint active and reactive power scheduling. The proposed methodology considers the minimization of the cost (economic perspective) of all distributed resources, and the minimization of the voltage magnitude difference (technical perspective) in all buses. The Pareto front is determined and a fuzzy-based mechanism is applied to present the best compromise solution. The proposed methodology has been tested in the 33-bus distribution network. The case study shows the results of three different scenarios for the economic, technical, and multi-objective perspectives, and the results demonstrated the importance of incorporating the reactive scheduling in the distribution network using the multi-objective perspective to obtain the best compromise solution for the economic and technical perspectives.

Project scheduling and cost minimization with multiple availability constrained resources under stochastic conditions

The authors propose a mathematical model to minimize the project total cost where there are multiple resources constrained by maximum availability. They assume the resources as renewable and the activities can use any subset of resources requiring any quantity from a limited real interval. The stochastic nature is inferred by means of a stochastic work content defined per resource within an activity and following a known distribution and the total cost is the sum of the resource allocation cost with the tardiness cost or earliness bonus in case the project finishes after or before the due date, respectively. The model was computationally implemented relying upon an interchange of two global optimization metaheuristics – the electromagnetism-like mechanism and the evolutionary strategies. Two experiments were conducted testing the implementation to projects with single and multiple resources, and with or without maximum availability constraints. The set of collected results shows good behavior in general and provide a tool to further assist project manager decision making in the planning phase.

Dental Treatment Services Scheme (DTSS) - Service Utilisation and Treatment Need (Lot 9)

Dental Treatment Services Scheme (DTSS) – Service Utilisation and Treatment Need (Lot 9) Since 2002, following agreement between the Department of Health and Children and the GMS Payments Board, data from the DTSS payments database has been transferred routinely to the Oral Health Services Research Centre (OHSRC), in University College, Cork for analysis. Queries have been developed in the OHSRC to provide individual level data on the treatments provided to patients, such as examinations, extractions, fillings, scale and polish, removal/amputation of roots, root treatment (upper and lower anterior teeth), radiographs, partial dentures and full dentures, and also data on the characteristics of the dentist providing services. Click here to download PDF 2.4mb

On Certain Greedoid Polyhedra, Partially Indexable Scheduling Problems, and Extended Restless Bandit Allocation Indices

We present a polyhedral framework for establishing general structural properties on optimal solutions of stochastic scheduling problems, where multiple job classes vie for service resources: the existence of an optimal priority policy in a given family, characterized by a greedoid (whose feasible class subsets may receive higher priority), where optimal priorities are determined by class-ranking indices, under restricted linear performance objectives (partial indexability). This framework extends that of Bertsimas and Niño-Mora (1996), which explained the optimality of priority-index policies under all linear objectives (general indexability). We show that, if performance measures satisfy partial conservation laws (with respect to the greedoid), which extend previous generalized conservation laws, then the problem admits a strong LP relaxation over a so-called extended greedoid polytope, which has strong structural and algorithmic properties. We present an adaptive-greedy algorithm (which extends Klimov's) taking as input the linear objective coefficients, which (1) determines whether the optimal LP solution is achievable by a policy in the given family; and (2) if so, computes a set of class-ranking indices that characterize optimal priority policies in the family. In the special case of project scheduling, we show that, under additional conditions, the optimal indices can be computed separately for each project (index decomposition). We further apply the framework to the important restless bandit model (two-action Markov decision chains), obtaining new index policies, that extend Whittle's (1988), and simple sufficient conditions for their validity. These results highlight the power of polyhedral methods (the so-called achievable region approach) in dynamic and stochastic optimization.

Parallel scheduling of multiclass M/M/m queues: Approximate and heavy-traffic optimization of achievable performance

We address the problem of scheduling a multiclass $M/M/m$ queue with Bernoulli feedback on $m$ parallel servers to minimize time-average linear holding costs. We analyze the performance of a heuristic priority-index rule, which extends Klimov's optimal solution to the single-server case: servers select preemptively customers with larger Klimov indices. We present closed-form suboptimality bounds (approximate optimality) for Klimov's rule, which imply that its suboptimality gap is uniformly bounded above with respect to (i) external arrival rates, as long as they stay within system capacity;and (ii) the number of servers. It follows that its relativesuboptimality gap vanishes in a heavy-traffic limit, as external arrival rates approach system capacity (heavy-traffic optimality). We obtain simpler expressions for the special no-feedback case, where the heuristic reduces to the classical $c \mu$ rule. Our analysis is based on comparing the expected cost of Klimov's ruleto the value of a strong linear programming (LP) relaxation of the system's region of achievable performance of mean queue lengths. In order to obtain this relaxation, we derive and exploit a new set ofwork decomposition laws for the parallel-server system. We further report on the results of a computational study on the quality of the $c \mu$ rule for parallel scheduling.

On certain greedoid polyhedra, partially indexable scheduling problems and extended restless bandit allocation indices

We present a polyhedral framework for establishing general structural properties on optimal solutions of stochastic scheduling problems, where multiple job classes vie for service resources: the existence of an optimal priority policy in a given family, characterized by a greedoid(whose feasible class subsets may receive higher priority), where optimal priorities are determined by class-ranking indices, under restricted linear performance objectives (partial indexability). This framework extends that of Bertsimas and Niño-Mora (1996), which explained the optimality of priority-index policies under all linear objectives (general indexability). We show that, if performance measures satisfy partial conservation laws (with respect to the greedoid), which extend previous generalized conservation laws, then theproblem admits a strong LP relaxation over a so-called extended greedoid polytope, which has strong structural and algorithmic properties. We present an adaptive-greedy algorithm (which extends Klimov's) taking as input the linear objective coefficients, which (1) determines whether the optimal LP solution is achievable by a policy in the given family; and (2) if so, computes a set of class-ranking indices that characterize optimal priority policies in the family. In the special case of project scheduling, we show that, under additional conditions, the optimal indices can be computed separately for each project (index decomposition). We further apply the framework to the important restless bandit model (two-action Markov decision chains), obtaining new index policies, that extend Whittle's (1988), and simple sufficient conditions for their validity. These results highlight the power of polyhedral methods (the so-called achievable region approach) in dynamic and stochastic optimization.

Linking Real Time and Location in Scheduling Demand-Responsive Transit, September 1996

The role of rural demand-responsive transit is changing, and with that change is coming an increasing need for technology. As long as rural transit was limited to a type of social service transportation for a specific set of clients who primarily traveled in groups to common meal sites, work centers for the disabled, or clinics in larger communities, a preset calendar augmented by notes on a yellow legal pad was sufficient to develop schedules. Any individual trips were arranged at least 24 to 48 hours ahead of time and were carefully scheduled the night before in half-hour or twenty-minute windows by a dispatcher who knew every lane in the service area. Since it took hours to build the schedule, any last-minute changes could wreak havoc with the plans and raise the stress level in the dispatch office. Nevertheless, given these parameters, a manual scheduling system worked for a small demand-responsive operation.

Scheduling forest road maintenance using the analytic hierarchy process and heuristics

Abstract

Production scheduling tools' evaluation in a global telecommunications and electronics company

Tutkimuksen päätavoite on arvioida, ovatko neljä ohjelmistovaihtoehtoa riittäviä tuotannon aikataulutuksen työkaluja ja mikä työkaluista sopii toimeksiantajayritykselle. Alatavoitteena on kuvata tuotannon aikataulutuksen nyky- ja tahtotila prosessimallinnuksen avulla, selvittää työkalun käyttäjätarpeet ja määritellä priorisoidut valintakriteerit työkalulle.Tutkimuksen teoriaosuudessa tutkitaan tuotannon aikataulutuksen logiikkaa ja haasteita. Työssä tarkastellaan aikataulutusohjelmiston valintaa rinnakkain prosessinmallinnuksen kanssa. Aikataulutusohjelmistovaihtoehdot ja metodit käyttäjätarpeiden selvittämiseksi käydään läpi. Empiriaosuudessa selvitetään tutkimuksen suhde toimeksiantajayrityksen strategiaan. Käyttäjätarpeet selvitetään haastattelujen avulla jaanalysoidaan QFD matriisin avulla. Toimeksiantajayrityksen tuotannon aikataulutuksen nyky- ja tahtotilaprosessit mallinnetaan, jotta ohjelmistojen sopivuutta, aikataulutusprosessia tukevana työkaluna voidaan arvioida.Tutkimustuloksena ovatpriorisoidut valintakriteerit aikataulutustyökalulle eli käyttäjätarpeista johdetut tärkeimmät toiminnalliset ominaisuudet, järjestelmätoimittaja-arvio sekä suositukset jatkotoimenpiteistä ja lisätutkimuksesta.

Guidelines for irrigation scheduling of banana crop in São Francisco Valley, Brazil. I - Root distribution and activity

In order to establish guidelines for irrigation water management of banana cv. Pacovan (AAB group, Prata sub-group) in Petrolina County, northeastern Brazil, the root distribution and activity were measured on an irrigated plantation, in a medium texture soil, with plants spaced in a 3 x 3 m grid. Root distribution was evaluated by the soil profile method aided by digital image analysis, while root activity was indirectly determined by the changing of soil water content and by the direction of soil water flux. Data were collected since planting in January 1999 to the 3rd harvest in September 2001. Effective rooting depth increased from 0.4 m at 91 days after planting (dap), to 0.6 m at 370, 510, and 903 dap, while water absorption by roots was predominantly in the top 0,6 m.

Guidelines for irrigation scheduling of banana crop in São Francisco Valley, Brazil. II - Water consumption, crop coefficient, and physiologycal behavior

The water consumption and the crop coefficient of the banana cv. Pacovan were estimated in Petrolina County, northeastern Brazil, in order to establish guidelines to irrigation water management. Evaluations were carried out since planting in January 1999 to the 3rd harvest in September 2001 on a microsprinkler irrigated orchard, with plants spaced in a 3 x 3 m grid. Average daily water consumption was 3.9, 4.0, and 3.3 mm in the 1st, 2nd and 3rd growing seasons, respectively. Crop coefficient values increased from 0.7 (vegetative growth) to 1.1 (flowering). Even with high soil water availability, transpiration was reduced due to high evaporative demand.

Correcting Interdevice Bias of Horizontal White-to-White and Sulcus-to-Sulcus Measures Used for Implantable Collamer Lens Sizing.

PURPOSE: To assess the agreement and repeatability of horizontal white-to-white (WTW) and horizontal sulcus-to-sulcus (STS) diameter measurements and use these data in combination with available literature to correct for interdevice bias in preoperative implantable collamer lens (ICL) size selection. DESIGN: Interinstrument reliability and bias assessment study. METHODS: A total of 107 eyes from 56 patients assessed for ICL implantation at our institution were included in the study. This was a consecutive series of all patients with suitable available data. The agreement and bias between WTW (measured with the Pentacam and BioGraph devices) and STS (measured with the HiScan device) were estimated. RESULTS: The mean spherical equivalent was -8.93 ± 5.69 diopters. The BioGraph measures of WTW were wider than those taken with the Pentacam (bias = 0.26 mm, P < .01), and both horizontal WTW measures were wider than the horizontal STS measures (bias >0.91 mm, P < .01). The repeatability (Sr) of STS measured with the HiScan was 0.39 mm, which was significantly reduced (Sr = 0.15 mm) when the average of 2 measures was used. Agreement between the horizontal WTW measures and horizontal STS estimates when bias was accounted for was г = 0.54 with the Pentacam and г = 0.64 with the BioGraph. CONCLUSIONS: Large interdevice bias was observed for WTW and STS measures. STS measures demonstrated poor repeatability, but the average of repeated measures significantly improved repeatability. In order to conform to the US Food and Drug Administration's accepted guidelines for ICL sizing, clinicians should be aware of and account for the inconsistencies between devices.