Flowering levels, harvest season and yields of cupuassu (Theobroma grandiflorum)

Cupuassu (Theobroma grandiflorum), a specie native to Amazonia, has been planted commercially in Brazil to satisfy the demand for the flavorful juice obtained from the pulp around its seeds. The trees are notorious for low and irregular fruit production. Data gathered over two seasons from trees in a germplasm collection in Pará, Brazil, showed that some of them fruited more regularly than others. Differences in fruit production correlated to differences in flower production. Tree-to-tree variation in flower production, fruit production, and consistency of both over time suggest considerable scope for improving yields by selection. Hand pollinations resulted in a much higher frequency of fruit set than open pollinations, indicating that lack of effective pollination is also a reason for low yield. However, attempts to increase the level of effective pollination are handicapped by low knowledge about the pollinators of cupuassu and their behavior.

Effects of selected post harvest processes on brown crab (Cancerpagurus L.) and European lobster (Homarus gammarus L.) from Irish Crustacean Fisheries

The crustacean fishery is important to the socio economics of rural and island communities around Ireland; with brown crab (Cancer pagurus) and European lobster (.Homarus gammarus) being the most valuable shellfish species. Brown crab and lobster are marketed live with the majority being exported from Ireland to southern Europe. Post capture processes used in Ireland are very subjective but promote fresh, live products. Common practices used in the crustacean fishery include nicking of brown crab and long term storage of lobster. This study showed that nicking resulted in elevated mean lactate levels of 17.90% (StDev ± 1.74) and elevated mean glucose levels of 120.55 % (StDev ± 0.26) with mean circulating bacteria levels 9 times greater in nicked crab. Nicking resulted in 96.3% increase in tissue necrosis and a subsequent reduction in product quality. These factors possibly compromise the host’s defense system, which may ultimately reduce the animal’s ability to cope with additional stressors caused by post-harvest processes. Long term storage allows lobster to be stored until the market is less saturated and prices are higher. This investigation found that some lobsters contracted bacterial biofilms as a result of long term storage. Bacteria isolated from biofilms were identified as Arcobacter and Campylobacterales with identity and alignment scores of 80% andd 88% respectively.

Optimal scheduling with uncertainty in the numerical data on the basis of a stability analysis

Scheduling, job shop, uncertainty, mixed (disjunctive) graph, stability analysis

A new harvest mouse from Wisconsin, by Harold C. Hanson.

v.29:no.14(1944)

Scheduling of straddle carriers in a container terminal

Report for the scientific sojourn at the University of California at Berkeley between September 2007 to February 2008. The globalization combined with the success of containerization has brought about tremendous increases in the transportation of containers across the world. This leads to an increasing size of container ships which causes higher demands on seaport container terminals and their equipment. In this situation, the success of container terminals resides in a fast transhipment process with reduced costs. For these reasons it is necessary to optimize the terminal’s processes. There are three main logistic processes in a seaport container terminal: loading and unloading of containerships, storage, and reception/deliver of containers from/to the hinterland. Moreover there is an additional process that ensures the interconnection between previous logistic activities: the internal transport subsystem. The aim of this paper is to optimize the internal transport cycle in a marine container terminal managed by straddle carriers, one of the most used container transfer technologies. Three sub-systems are analyzed in detail: the landside transportation, the storage of containers in the yard, and the quayside transportation. The conflicts and decisions that arise from these three subsystems are analytically investigated, and optimization algorithms are proposed. Moreover, simulation has been applied to TCB (Barcelona Container Terminal) to test these algorithms and compare different straddle carrier’s operation strategies, such as single cycle versus double cycle, and different sizes of the handling equipment fleet. The simulation model is explained in detail and the main decision-making algorithms from the model are presented and formulated.

Effects of timber harvest on phlebotomine sand flies (Diptera: Psychodidae) in a production forest: abundance of species on tree trunks and prevalence of trypanosomatids

The Amazon forest is being exploited for timber production. The harvest removes trees, used by sand flies as resting sites, and decreases the canopy, used as refuges by some hosts. The present study evaluated the impact of the timber harvest, the abundance of sand flies, and their trypanosomatid infection rates before and after selective logging. The study was accomplished in terra-firme production forest in an area of timber harvest, state of Amazonas, Brazil. Sand fly catches were carried out in three areas: one before and after the timber harvest, and two control areas, a nature preservation area and a previously exploited area. The flies were caught by aspiration on tree trunks. Samples of sand flies were dissected for parasitological examination. In the site that suffered a harvest, a larger number of individuals was caught before the selective extraction of timber, showing significant difference in relation to the number of individuals and their flagellate infection rates after the logging. The other two areas did not show differences among their sand fly populations. This fact is suggestive of a fauna sensitive to the environmental alterations associated with selective logging.

Algorithm optimization for solving crew scheduling problems

In this paper, we are proposing a methodology to determine the most efficient and least costly way of crew pairing optimization. We are developing a methodology based on algorithm optimization on Eclipse opensource IDE using the Java programming language to solve the crew scheduling problems.

Comparison of Work Scheduling Using Constraint Programming or Auctions

Business processes designers take into account the resources that the processes would need, but, due to the variable cost of certain parameters (like energy) or other circumstances, this scheduling must be done when business process enactment. In this report we formalize the energy aware resource cost, including time and usage dependent rates. We also present a constraint programming approach and an auction-based approach to solve the mentioned problem including a comparison of them and a comparison of the proposed algorithms for solving them

Evaluation de la qualité de vie après prélèvement de la veine fémorale superficielle lors de reconstructions infra-inguinales [Quality of life after superficial femoral vein harvest for infra-inguinal reconstructions]

BACKGROUND: The superficial femoral vein (SFV) is a well-established alternative conduit for infra-inguinal reconstructivenous hypertension after SFV harvest may however result in significant morbidity. This study reports the efficiency of SFV as conduit for infra-inguinal reconstructions and characterize the anatomic and physiologic changes in harvest limbs and their relationship to the development of venous complications. METHODS: From May 1999 through November 2003, 23 SFV were harvested from 21 patients undergoing infra-inguinal reconstructions. Bypasses were controlled by regular duplex-ultrasound. The venous morbidity was assessed by measurements of leg circumferences, strain-gauge plethysmography and quality of life, investigated by the VEINES-QOL scale. RESULTS: At a mean follow-up of 10.4 months (range 1-56), primary, secondary patency and limb salvage rates of infra-inguinal bypasses using SFV are 71.4%, 76.2% and 85.7% respectively. No patient had major venous claudication. Oedema was significantly present in nine patients. Strain-gauge plethysmography showed outflow obstruction in all patients. The VEINES-QOL assessment showed no limitation in social and domestic activity, moderate complain about leg heaviness despite presence of oedema. CONCLUSION: The SFV harvest is a reliable conduit for infra-inguinal reconstructions and results in moderate venous morbidity in terms of functional consequences and quality of life.

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.

A polynomial algorithm for special case of the one-machine scheduling problem with time-lags

The standard one-machine scheduling problem consists in schedulinga set of jobs in one machine which can handle only one job at atime, minimizing the maximum lateness. Each job is available forprocessing at its release date, requires a known processing timeand after finishing the processing, it is delivery after a certaintime. There also can exists precedence constraints between pairsof jobs, requiring that the first jobs must be completed beforethe second job can start. An extension of this problem consistsin assigning a time interval between the processing of the jobsassociated with the precedence constrains, known by finish-starttime-lags. In presence of this constraints, the problem is NP-hardeven if preemption is allowed. In this work, we consider a specialcase of the one-machine preemption scheduling problem with time-lags, where the time-lags have a chain form, and propose apolynomial algorithm to solve it. The algorithm consist in apolynomial number of calls of the preemption version of the LongestTail Heuristic. One of the applicability of the method is to obtainlower bounds for NP-hard one-machine and job-shop schedulingproblems. We present some computational results of thisapplication, followed by some conclusions.

Beyond Smith's rule: An optimal dynamic index, rule for single machine stochastic scheduling with convex holding costs

Most research on single machine scheduling has assumedthe linearity of job holding costs, which is arguablynot appropriate in some applications. This motivates ourstudy of a model for scheduling $n$ classes of stochasticjobs on a single machine, with the objective of minimizingthe total expected holding cost (discounted or undiscounted). We allow general holding cost rates that are separable,nondecreasing and convex on the number of jobs in eachclass. We formulate the problem as a linear program overa certain greedoid polytope, and establish that it issolved optimally by a dynamic (priority) index rule,whichextends the classical Smith's rule (1956) for the linearcase. Unlike Smith's indices, defined for each class, ournew indices are defined for each extended class, consistingof a class and a number of jobs in that class, and yieldan optimal dynamic index rule: work at each time on a jobwhose current extended class has larger index. We furthershow that the indices possess a decomposition property,as they are computed separately for each class, andinterpret them in economic terms as marginal expected cost rate reductions per unit of expected processing time.We establish the results by deploying a methodology recentlyintroduced by us [J. Niño-Mora (1999). "Restless bandits,partial conservation laws, and indexability. "Forthcomingin Advances in Applied Probability Vol. 33 No. 1, 2001],based on the satisfaction by performance measures of partialconservation laws (PCL) (which extend the generalizedconservation laws of Bertsimas and Niño-Mora (1996)):PCL provide a polyhedral framework for establishing theoptimality of index policies with special structure inscheduling problems under admissible objectives, which weapply to the model of concern.

Solving two production scheduling problems with sequence-dependent set-up times

In today’s competitive markets, the importance of goodscheduling strategies in manufacturing companies lead to theneed of developing efficient methods to solve complexscheduling problems.In this paper, we studied two production scheduling problemswith sequence-dependent setups times. The setup times areone of the most common complications in scheduling problems,and are usually associated with cleaning operations andchanging tools and shapes in machines.The first problem considered is a single-machine schedulingwith release dates, sequence-dependent setup times anddelivery times. The performance measure is the maximumlateness.The second problem is a job-shop scheduling problem withsequence-dependent setup times where the objective is tominimize the makespan.We present several priority dispatching rules for bothproblems, followed by a study of their performance. Finally,conclusions and directions of future research are presented.

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.

The crew-scheduling module in the GIST system

The public transportation is gaining importance every year basically duethe population growth, environmental policies and, route and streetcongestion. Too able an efficient management of all the resources relatedto public transportation, several techniques from different areas are beingapplied and several projects in Transportation Planning Systems, indifferent countries, are being developed. In this work, we present theGIST Planning Transportation Systems, a Portuguese project involving twouniversities and six public transportation companies. We describe indetail one of the most relevant modules of this project, the crew-scheduling module. The crew-scheduling module is based on the application of meta-heuristics, in particular GRASP, tabu search and geneticalgorithm to solve the bus-driver-scheduling problem. The metaheuristicshave been successfully incorporated in the GIST Planning TransportationSystems and are actually used by several companies.