Restless bandits, partial conservation laws and indexability

We show that if performance measures in a stochastic scheduling problem satisfy a set of so-called partial conservation laws (PCL), which extend previously studied generalized conservation laws (GCL), then the problem is solved optimally by a priority-index policy for an appropriate range of linear performance objectives, where the optimal indices are computed by a one-pass adaptive-greedy algorithm, based on Klimov's. We further apply this framework to investigate the indexability property of restless bandits introduced by Whittle, obtaining the following results: (1) we identify a class of restless bandits (PCL-indexable) which are indexable; membership in this class is tested through a single run of the adaptive-greedy algorithm, which also computes the Whittle indices when the test is positive; this provides a tractable sufficient condition for indexability; (2) we further indentify the class of GCL-indexable bandits, which includes classical bandits, having the property that they are indexable under any linear reward objective. The analysis is based on the so-called achievable region method, as the results follow fromnew linear programming formulations for the problems investigated.

Optimization of multiclass queueing networks with changeover times via the achievable region approach: Part I, the single-station case

We address the performance optimization problem in a single-stationmulticlass queueing network with changeover times by means of theachievable region approach. This approach seeks to obtainperformance bounds and scheduling policies from the solution of amathematical program over a relaxation of the system's performanceregion. Relaxed formulations (including linear, convex, nonconvexand positive semidefinite constraints) of this region are developedby formulating equilibrium relations satisfied by the system, withthe help of Palm calculus. Our contributions include: (1) newconstraints formulating equilibrium relations on server dynamics;(2) a flow conservation interpretation of the constraintspreviously derived by the potential function method; (3) newpositive semidefinite constraints; (4) new work decomposition lawsfor single-station multiclass queueing networks, which yield newconvex constraints; (5) a unified buffer occupancy method ofperformance analysis obtained from the constraints; (6) heuristicscheduling policies from the solution of the relaxations.

Restless bandits, linear programming relaxations and a primal-dual index heuristic

We develop a mathematical programming approach for the classicalPSPACE - hard restless bandit problem in stochastic optimization.We introduce a hierarchy of n (where n is the number of bandits)increasingly stronger linear programming relaxations, the lastof which is exact and corresponds to the (exponential size)formulation of the problem as a Markov decision chain, while theother relaxations provide bounds and are efficiently computed. Wealso propose a priority-index heuristic scheduling policy fromthe solution to the first-order relaxation, where the indices aredefined in terms of optimal dual variables. In this way wepropose a policy and a suboptimality guarantee. We report resultsof computational experiments that suggest that the proposedheuristic policy is nearly optimal. Moreover, the second-orderrelaxation is found to provide strong bounds on the optimalvalue.

Optimization of multiclass queueing networks with changeover times via the achievable region method: Part II, the multi-station case

We address the problem of scheduling a multi-station multiclassqueueing network (MQNET) with server changeover times to minimizesteady-state mean job holding costs. We present new lower boundson the best achievable cost that emerge as the values ofmathematical programming problems (linear, semidefinite, andconvex) over relaxed formulations of the system's achievableperformance region. The constraints on achievable performancedefining these formulations are obtained by formulatingsystem's equilibrium relations. Our contributions include: (1) aflow conservation interpretation and closed formulae for theconstraints previously derived by the potential function method;(2) new work decomposition laws for MQNETs; (3) new constraints(linear, convex, and semidefinite) on the performance region offirst and second moments of queue lengths for MQNETs; (4) a fastbound for a MQNET with N customer classes computed in N steps; (5)two heuristic scheduling policies: a priority-index policy, anda policy extracted from the solution of a linear programmingrelaxation.

Exploiting fitness distance correlation of set covering problems

The set covering problem is an NP-hard combinatorial optimization problemthat arises in applications ranging from crew scheduling in airlines todriver scheduling in public mass transport. In this paper we analyze searchspace characteristics of a widely used set of benchmark instances throughan analysis of the fitness-distance correlation. This analysis shows thatthere exist several classes of set covering instances that have a largelydifferent behavior. For instances with high fitness distance correlation,we propose new ways of generating core problems and analyze the performanceof algorithms exploiting these core problems.

Tenda Virtual orientada a compres per escaneig amb el telèfon mòbil

CMS (Sistema Gestor de Continguts) és una tecnologia en ple auge que permet implantar solucions web d'una manera senzilla, econòmica i amb un fàcil manteniment per part dels usuaris que en fan ús. Aquest projecte és un estudi que pretén analitzar i escollir el millor CMS dirigit a comerç electrònic d'entre el ventall existent actualment al mercat, creant un document que serveixi de referent o guia a qualsevol persona interessada en implantar un sistema d'aquestes característiques. A més, es centrarà a la programació d'un component instal·lable pel CMS escollit que permeti introduir-nos a la creació d'extensions i ens formi en l'àmbit de la programació web. Aquest component el podrem afegir al CMS i permetrà realitzar compres escanejant codis amb el telèfon mòbil.

Optimal management of microgrids

Desenvolupament dels models matemàtics necessaris per a controlar de forma òptima la microxarxa existent als laboratoris del Institut de Recerca en Energia de Catalunya. Els algoritmes s'implementaran per tal de simular el comportament i posteriorment es programaran directament sobre els elements de la microxarxa per verificar el seu correcte funcionament.. Desenvolupament dels models matemàtics necessaris per a controlar de forma òptima la microxarxa existent als laboratoris del Institut de Recerca en Energia de Catalunya. Els algoritmes s'implementaran per tal de simular el comportament i posteriorment es programaran directament sobre els elements de la microxarxa per verificar el seu correcte funcionament.

Note on the blocking flow shop problem

We present some results attained with different algorithms for the Fm|block|Cmax problem using as experimental data the well-known Taillard instances.

Circadian and circaseptan patterns of natality and perinatal mortality of infants with different birth weights

OBJECTIVE. Data on human natality, stillbirth and perinatal mortality from Switzerland (1979-1987), available in four birthweight categories, are reexamined to assess any about-weekly (circaseptan) and changes in about-daily (circadian) patterns in central Europe over a century and a halfDESIGN. Retrospective analyses on archived data.SETTING. Federal Office of Statistics for Switzerland.RESULTS. In addition to prominent circadians, weekly patterns are also documented.CONCLUSION. Exogenous variations, prominent in early extrauterine life, such as changes of scheduling in obstetrics, may contribute to circadian and cireaseptan natality patterns. Information on these patterns serves in the optimization of neonatal care. Partly endogenous, partly physical environmental aspects, at least of about-weekly patterns, remain to be elucidated in series consisting exclusively of spontaneous parturitions.

Estimation of water retention and availability in soils of Rio Grande do Sul

Dispersed information on water retention and availability in soils may be compiled in databases to generate pedotransfer functions. The objectives of this study were: to generate pedotransfer functions to estimate soil water retention based on easily measurable soil properties; to evaluate the efficiency of existing pedotransfer functions for different geographical regions for the estimation of water retention in soils of Rio Grande do Sul (RS); and to estimate plant-available water capacity based on soil particle-size distribution. Two databases were set up for soil properties, including water retention: one based on literature data (725 entries) and the other with soil data from an irrigation scheduling and management system (239 entries). From the literature database, pedotransfer functions were generated, nine pedofunctions available in the literature were evaluated and the plant-available water capacity was calculated. The coefficient of determination of some pedotransfer functions ranged from 0.56 to 0.66. Pedotransfer functions generated based on soils from other regions were not appropriate for estimating the water retention for RS soils. The plant-available water content varied with soil texture classes, from 0.089 kg kg-1 for the sand class to 0.191 kg kg-1 for the silty clay class. These variations were more related to sand and silt than to clay content. The soils with a greater silt/clay ratio, which were less weathered and with a greater quantity of smectite clay minerals, had high water retention and plant-available water capacity.

Production Flow Analysis - cases from manufacturing and service industry

Production flow analysis (PFA) is a well-established methodology used for transforming traditional functional layout into product-oriented layout. The method uses part routings to find natural clusters of workstations forming production cells able to complete parts and components swiftly with simplified material flow. Once implemented, the scheduling system is based on period batch control aiming to establish fixed planning, production and delivery cycles for the whole production unit. PFA is traditionally applied to job-shops with functional layouts, and after reorganization within groups lead times reduce, quality improves and motivation among personnel improves. Several papers have documented this, yet no research has studied its application to service operations management. This paper aims to show that PFA can well be applied not only to job-shop and assembly operations, but also to back-office and service processes with real cases. The cases clearly show that PFA reduces non-value adding operations, introduces flow by evening out bottlenecks and diminishes process variability, all of which contribute to efficient operations management.

Thermoplastic Pavement Markings, HR-172, 1975

It is difficult to maintain reflectorized lane markings on high-traffic, multi-lane highways. This is particularly true of sections in urban areas where there are frequent lane changes, such as on the Des Moines Freeway, I-235. In spite of the fact that the lane markings are painted on an average of three times a year, they are frequently absent during a considerable portion of the winter period. In the summer of 1973, the office of Highway Maintenance suggested a research project using a new thermoplastic paint developed by the Prismo Universal Corporation. Because of difficulties in scheduling the work, a definite proposal was not submitted until 1974. Upon the recommendation of the Iowa Highway Research Board, the project was approved by the Iowa State Highway Commission on August 7, 1974.

Infrared thermometry to schedule irrigation of common bean

The objective of this work was to determine the critical irrigation time for common bean (Phaseolus vulgaris L. cv. Carioca) using infrared thermometry. Five treatments were analyzed. Canopy temperature differences between plants and a well-watered control about 1, 2, 3, 4, and 5±0.5ºC were tested. Physiological variables and plant growth were analyzed to establish the best time to irrigate. There was a significant linear correlation between the index and stomatal resistance, transpiration rate, and leaf water potential. Although significant linear correlation between the index and mean values of total dry matter, absolute growth rate, and leaf area index was found, no correlation was found with other growth index like relative growth rate, net assimilation rate, and leaf area ratio. Plants irrigated when their canopy temperature was 3±0.5ºC above the control had their relative growth rate mean value increased up to 59.7%, yielding 2,260.2 kg ha-1, with a reduction of 38.0% in the amount of water used. Plants irrigated when their canopy temperature was 4±0.5ºC yielded 1,907.6 kg ha-1, although their relative growth rate mean value was 4.0% below the control. These results show that the best moment to irrigate common bean is when their canopy temperature is between 3ºC and 4±0.5ºC above the control.