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.

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.

A continuous-time MILP model for short-term scheduling of make-and-pack production processes

In process industries, make-and-pack production is used to produce food and beverages, chemicals, and metal products, among others. This type of production process allows the fabrication of a wide range of products in relatively small amounts using the same equipment. In this article, we consider a real-world production process (cf. Honkomp et al. 2000. The curse of reality – why process scheduling optimization problems are diffcult in practice. Computers & Chemical Engineering, 24, 323–328.) comprising sequence-dependent changeover times, multipurpose storage units with limited capacities, quarantine times, batch splitting, partial equipment connectivity, and transfer times. The planning problem consists of computing a production schedule such that a given demand of packed products is fulfilled, all technological constraints are satisfied, and the production makespan is minimised. None of the models in the literature covers all of the technological constraints that occur in such make-and-pack production processes. To close this gap, we develop an efficient mixed-integer linear programming model that is based on a continuous time domain and general-precedence variables. We propose novel types of symmetry-breaking constraints and a preprocessing procedure to improve the model performance. In an experimental analysis, we show that small- and moderate-sized instances can be solved to optimality within short CPU times.

Heuristic decomposition and LP-based scheduling in make-and-pack production

In this paper, we are concerned about the short-term scheduling of industrial make-and-pack production processes. The planning problem consists in minimizing the production makespan while meeting given end-product demands. Sequence-dependent changeover times, multi-purpose storage units with finite capacities, quarantine times, batch splitting, partial equipment connectivity, material transfer times, and a large number of operations contribute to the complexity of the problem. Known MILP formulations cover all technological constraints of such production processes, but only small problem instances can be solved in reasonable CPU times. In this paper, we develop a heuristic in order to tackle large instances. Under this heuristic, groups of batches are scheduled iteratively using a novel MILP formulation; the assignment of the batches to the groups and the scheduling sequence of the groups are determined using a priority rule. We demonstrate the applicability by means of a real-world production process.

Analysis Of The Fluorescence Of Body Fluids On Different Surfaces And Times.

The use of screening techniques, such as an alternative light source (ALS), is important for finding biological evidence at a crime scene. The objective of this study was to evaluate whether biological fluid (blood, semen, saliva, and urine) deposited on different surfaces changes as a function of the age of the sample. Stains were illuminated with a Megamaxx™ ALS System and photographed with a Canon EOS Utility™ camera. Adobe Photoshop™ was utilized to prepare photographs for analysis, and then ImageJ™ was used to record the brightness values of pixels in the images. Data were submitted to analysis of variance using a generalized linear mixed model with two fixed effects (surface and fluid). Time was treated as a random effect (through repeated measures) with a first-order autoregressive covariance structure. Means of significant effects were compared by the Tukey test. The fluorescence of the analyzed biological material varied depending on the age of the sample. Fluorescence was lower when the samples were moist. Fluorescence remained constant when the sample was dry, up to the maximum period analyzed (60 days), independent of the substrate on which the fluid was deposited, showing the novelty of this study. Therefore, the forensic expert can detect biological fluids at the crime scene using an ALS even several days after a crime has occurred.

Análise do desempenho muscular do quadríceps e dos isquiotibiais em função da série temporal e da amplitude de movimento de atletas amadoras de futsal feminino = : Analysis of muscle performance of the quadriceps and hamstrings as a function of the times series and range of motion of amateurfemale futsal athletes

Universidade Estadual de Campinas . Faculdade de Educação Física

Influence of separate and mixed experimental designs on reaction times to two simple visual stimuli

Testing contexts have been shown to critically influence experimental results in psychophysical studies. One of these contexts that show important modulation of the behavioral effects of different stimulatory conditions is the separate (blocked) or mixed presentation of these stimulatory conditions. The study presents evidence that the apparent discriminabilities of two target stimuli can change according to which of these two testing contexts is used. A cross inside a ring and a vertical line inside a ring were presented as go stimuli in a go/no-go reaction time task. In one experiment, each of these stimuli was presented to a different group of volunteers and in another experiment they were presented to the same group of volunteers, randomly mixed in the blocks of trials. Similar reaction times were obtained for the two stimuli in the first experiment, and different reaction times (faster for the cross) in the second experiment. The latter result indicates that the two stimuli have different discriminabilities from the no-go stimulus; the cross having greater discriminability. This difference is however masked, presumably by the adoption of specific compensatory attentional sets, in a separate testing context.

Dating minerals by ID-TIMS geochronology at times of in situ analysis: selected case studies from the CPGeo-IGc-USP laboratory

Since 1964, the Center for Geochronological Research - CPGeo, one of the interdepartmental centers of the Instituto de Geociências (IG) of São Paulo University, has developed studies related to several geological processes associated with different rock types. Thermal Ionization Mass Spectrometry Isotopic Dilution (ID-TIMS) has been the technique widely used in the CPGeo U-Pb Laboratory. It provides reliable and accurate results in age determination of superposed events. However, the open-system behavior such as Pb-loss, the inheritance problem and metamictization processes allow and impel us to a much richer understanding of the power and limitations of U-Pb geochronology and thermochronology. In this article, we present the current methodology used at the CPGeo-IGc-USP U-Pb laboratory, the improvements on ID-TIMS method, and report high-precision U-Pb data from zircon, monazite, epidote, titanite, baddeleyite and rutile from different rock types of several domains of the Brazilian south-southeast area, Argentina and Uruguay.

Exceptional times for the dynamical discrete web

The dynamical discrete web (DyDW), introduced in the recent work of Howitt and Warren, is a system of coalescing simple symmetric one-dimensional random walks which evolve in an extra continuous dynamical time parameter tau. The evolution is by independent updating of the underlying Bernoulli variables indexed by discrete space-time that define the discrete web at any fixed tau. In this paper, we study the existence of exceptional (random) values of tau where the paths of the web do not behave like usual random walks and the Hausdorff dimension of the set of such exceptional tau. Our results are motivated by those about exceptional times for dynamical percolation in high dimension by Haggstrom, Peres and Steif, and in dimension two by Schramm and Steif. The exceptional behavior of the walks in the DyDW is rather different from the situation for the dynamical random walks of Benjamini, Haggstrom, Peres and Steif. For example, we prove that the walk from the origin S(0)(tau) violates the law of the iterated logarithm (LIL) on a set of tau of Hausdorff dimension one. We also discuss how these and other results should extend to the dynamical Brownian web, the natural scaling limit of the DyDW. (C) 2009 Elsevier B.V. All rights reserved.

Industrial apiculture in the Jordan valley during Biblical times with Anatolian honeybees

Although texts and wall paintings suggest that bees were kept in the Ancient Near East for the production of precious wax and honey, archaeological evidence for beekeeping has never been found. The Biblical term ""honey"" commonly was interpreted as the sweet product of fruits, such as dates and figs. The recent discovery of unfired clay cylinders similar to traditional hives still used in the Near East at the site of Tel Rehov in the Jordan valley in northern Israel suggests that a large-scale apiary was located inside the town, dating to the 10th-early 9th centuries B.C.E. This paper reports the discovery of remains of honeybee workers, drones, pupae, and larvae inside these hives. The exceptional preservation of these remains provides unequivocal identification of the clay cylinders as the most ancient beehives yet found. Morphometric analyses indicate that these bees differ from the local subspecies Apis mellifera syriaca and from all subspecies other than A. m. anatoliaca, which presently resides in parts of Turkey. This finding suggests either that the Western honeybee subspecies distribution has undergone rapid change during the last 3,000 years or that the ancient inhabitants of Tel Rehov imported bees superior to the local bees in terms of their milder temper and improved honey yield.