Scheduling a flow-shop with combined buffer conditions

In this paper, No-Wait, No-Buffer, Limited-Buffer, and Infinite-Buffer conditions for the flow-shop problem (FSP) have been investigated. These four different buffer conditions have been combined to generate a new class of scheduling problem, which is significant for modelling many real-world scheduling problems. A new heuristic algorithm is developed to solve this strongly NP-hard problem. Detailed numerical implementations have been analysed and promising results have been achieved.

Modelling and solving train scheduling problems under capacity constraints

Many large coal mining operations in Australia rely heavily on the rail network to transport coal from mines to coal terminals at ports for shipment. Over the last few years, due to the fast growing demand, the coal rail network is becoming one of the worst industrial bottlenecks in Australia. As a result, this provides great incentives for pursuing better optimisation and control strategies for the operation of the whole rail transportation system under network and terminal capacity constraints. This PhD research aims to achieve a significant efficiency improvement in a coal rail network on the basis of the development of standard modelling approaches and generic solution techniques. Generally, the train scheduling problem can be modelled as a Blocking Parallel- Machine Job-Shop Scheduling (BPMJSS) problem. In a BPMJSS model for train scheduling, trains and sections respectively are synonymous with jobs and machines and an operation is regarded as the movement/traversal of a train across a section. To begin, an improved shifting bottleneck procedure algorithm combined with metaheuristics has been developed to efficiently solve the Parallel-Machine Job- Shop Scheduling (PMJSS) problems without the blocking conditions. Due to the lack of buffer space, the real-life train scheduling should consider blocking or hold-while-wait constraints, which means that a track section cannot release and must hold a train until the next section on the routing becomes available. As a consequence, the problem has been considered as BPMJSS with the blocking conditions. To develop efficient solution techniques for BPMJSS, extensive studies on the nonclassical scheduling problems regarding the various buffer conditions (i.e. blocking, no-wait, limited-buffer, unlimited-buffer and combined-buffer) have been done. In this procedure, an alternative graph as an extension of the classical disjunctive graph is developed and specially designed for the non-classical scheduling problems such as the blocking flow-shop scheduling (BFSS), no-wait flow-shop scheduling (NWFSS), and blocking job-shop scheduling (BJSS) problems. By exploring the blocking characteristics based on the alternative graph, a new algorithm called the topological-sequence algorithm is developed for solving the non-classical scheduling problems. To indicate the preeminence of the proposed algorithm, we compare it with two known algorithms (i.e. Recursive Procedure and Directed Graph) in the literature. Moreover, we define a new type of non-classical scheduling problem, called combined-buffer flow-shop scheduling (CBFSS), which covers four extreme cases: the classical FSS (FSS) with infinite buffer, the blocking FSS (BFSS) with no buffer, the no-wait FSS (NWFSS) and the limited-buffer FSS (LBFSS). After exploring the structural properties of CBFSS, we propose an innovative constructive algorithm named the LK algorithm to construct the feasible CBFSS schedule. Detailed numerical illustrations for the various cases are presented and analysed. By adjusting only the attributes in the data input, the proposed LK algorithm is generic and enables the construction of the feasible schedules for many types of non-classical scheduling problems with different buffer constraints. Inspired by the shifting bottleneck procedure algorithm for PMJSS and characteristic analysis based on the alternative graph for non-classical scheduling problems, a new constructive algorithm called the Feasibility Satisfaction Procedure (FSP) is proposed to obtain the feasible BPMJSS solution. A real-world train scheduling case is used for illustrating and comparing the PMJSS and BPMJSS models. Some real-life applications including considering the train length, upgrading the track sections, accelerating a tardy train and changing the bottleneck sections are discussed. Furthermore, the BPMJSS model is generalised to be a No-Wait Blocking Parallel- Machine Job-Shop Scheduling (NWBPMJSS) problem for scheduling the trains with priorities, in which prioritised trains such as express passenger trains are considered simultaneously with non-prioritised trains such as freight trains. In this case, no-wait conditions, which are more restrictive constraints than blocking constraints, arise when considering the prioritised trains that should traverse continuously without any interruption or any unplanned pauses because of the high cost of waiting during travel. In comparison, non-prioritised trains are allowed to enter the next section immediately if possible or to remain in a section until the next section on the routing becomes available. Based on the FSP algorithm, a more generic algorithm called the SE algorithm is developed to solve a class of train scheduling problems in terms of different conditions in train scheduling environments. To construct the feasible train schedule, the proposed SE algorithm consists of many individual modules including the feasibility-satisfaction procedure, time-determination procedure, tune-up procedure and conflict-resolve procedure algorithms. To find a good train schedule, a two-stage hybrid heuristic algorithm called the SE-BIH algorithm is developed by combining the constructive heuristic (i.e. the SE algorithm) and the local-search heuristic (i.e. the Best-Insertion- Heuristic algorithm). To optimise the train schedule, a three-stage algorithm called the SE-BIH-TS algorithm is developed by combining the tabu search (TS) metaheuristic with the SE-BIH algorithm. Finally, a case study is performed for a complex real-world coal rail network under network and terminal capacity constraints. The computational results validate that the proposed methodology would be very promising because it can be applied as a fundamental tool for modelling and solving many real-world scheduling problems.

Setting Inventory Levels of CONWIP Flow Lines via Linear Programming

This paper treats the problem of setting the inventory level and optimizing the buffer allocation of closed-loop flow lines operating under the constant-work-in-process (CONWIP) protocol. We solve a very large but simple linear program that models an entire simulation run of a closed-loop flow line in discrete time to determine a production rate estimate of the system. This approach introduced in Helber, Schimmelpfeng, Stolletz, and Lagershausen (2011) for open flow lines with limited buffer capacities is extended to closed-loop CONWIP flow lines. Via this method, both the CONWIP level and the buffer allocation can be optimized simultaneously. The first part of a numerical study deals with the accuracy of the method. In the second part, we focus on the relationship between the CONWIP inventory level and the short-term profit. The accuracy of the method turns out to be best for such configurations that maximize production rate and/or short-term profit.

Unified model for performance analysis of IEEE 802.11 ad hoc networks in unsaturated conditions

IEEE 802.11 standard has achieved huge success in the past decade and is still under development to provide higher physical data rate and better quality of service (QoS). An important problem for the development and optimization of IEEE 802.11 networks is the modeling of the MAC layer channel access protocol. Although there are already many theoretic analysis for the 802.11 MAC protocol in the literature, most of the models focus on the saturated traffic and assume infinite buffer at the MAC layer. In this paper we develop a unified analytical model for IEEE 802.11 MAC protocol in ad hoc networks. The impacts of channel access parameters, traffic rate and buffer size at the MAC layer are modeled with the assistance of a generalized Markov chain and an M/G/1/K queue model. The performance of throughput, packet delivery delay and dropping probability can be achieved. Extensive simulations show the analytical model is highly accurate. From the analytical model it is shown that for practical buffer configuration (e.g. buffer size larger than one), we can maximize the total throughput and reduce the packet blocking probability (due to limited buffer size) and the average queuing delay to zero by effectively controlling the offered load. The average MAC layer service delay as well as its standard deviation, is also much lower than that in saturated conditions and has an upper bound. It is also observed that the optimal load is very close to the maximum achievable throughput regardless of the number of stations or buffer size. Moreover, the model is scalable for performance analysis of 802.11e in unsaturated conditions and 802.11 ad hoc networks with heterogenous traffic flows. © 2012 KSI.

Development of a sewerage infrastructure buffer assessment tool for local authorities

Urban expansion continues to encroach on existing or newly implemented sewerage infrastructure. In this context, legislation and guidelines, both national and international, provide limited direction to the amenity allocation of appropriate buffering distances for land use planners and infrastructure providers. A review of published literature suggests the dominant influences include topography, wind speed and direction, temperature, humidity, existing land uses and vegetation profiles. A statistical criteria review of these factors against six years of sewerage odour complaint data was undertaken to ascertain their influence and a complaint severity hierarchy was established. These hierarchical results suggested the main criteria were: topographical location, elevation relative to the odour source and wind speed. Establishing a justifiable criterion for buffer zone allocations will assist in analytically determining a basis for buffer separations and will assist planners and infrastructure designers in assessing lower impact sewerage infrastructure locations.

Preliminary development of a sewerage infrastructure buffer assessment tool for engineering risk and strategic land use planning

Urban expansion continues to encroach on once isolated sewerage infrastructure. In this context,legislation and guidelines provide limited direction to the amenity allocation of appropriate buffer distances for land use planners and infrastructure providers. Topography, wind speed and direction,temperature, humidity, existing land uses and vegetation profiles are some of the factors that require investigation in analytically determining a basis for buffer separations. This paper discusses the compilation and analysis of six years of Logan sewerage odour complaint data. Graphically,relationships between the complaints, topographical features and meteorological data are presented. Application of a buffer sizing process could assist planners and infrastructure designers alike, whilst automatically providing extra green spaces. Establishing a justifiable criterion for buffer zone allocations can only assist in promoting manageable growth for healthier and more sustainable communities.

MOCVD growth of InN using a GaN buffer

We have investigated MOCVD growth of InN oil sapphire with and without a GaN buffer between 490 and 520 degrees C. The buffer significantly improves the surface morphological uniformity and electrical properties of InN epilayers. Characterization of the as-grown epilayers with the buffer reveals that kinetics-limited islands are formed at lower temperatures, whereas islands with equilibrium shape are obtained at higher temperatures. Below 520 degrees C, increasing temperature improves structural quality but degrades electrical properties. Hall data from this study Suggest that V-N-related defects/impurities are the possible donor species and compensation varies with charged dislocation acceptors. We believe that reducing carrier concentration and dislocation density is effective to increase the Hall mobility of InN. (C) 2007 Elsevier Ltd. All rights reserved.

Enzymatic degradation of poly(epsilon-caprolactone) film in phosphate buffer solution containing lipases

The enzymatic degradation of poly(epsilon-caprolactone) (PCL) films in phosphate buffer solution containing lipases has been studied by DSC, WAXD and SEM. Three lipases, pseudomonas lipase (PS), porcine pancreatic lipase (PP), and candida cylindracea lipase (AY), were used. The results showed that the degradation of PCL films in phosphate buffer solution containing PP or AY was very slow: no weight loss could be found within 1 week. However, PCL film could degrade rapidly and completely within 4 days in phosphate buffer solution containing PS lipase. (C) 1997 Elsevier Science Limited.

GreedyDual-Join: Locality-Aware Buffer Management for Approximate Join Processing Over Data Streams

We investigate adaptive buffer management techniques for approximate evaluation of sliding window joins over multiple data streams. In many applications, data stream processing systems have limited memory or have to deal with very high speed data streams. In both cases, computing the exact results of joins between these streams may not be feasible, mainly because the buffers used to compute the joins contain much smaller number of tuples than the tuples contained in the sliding windows. Therefore, a stream buffer management policy is needed in that case. We show that the buffer replacement policy is an important determinant of the quality of the produced results. To that end, we propose GreedyDual-Join (GDJ) an adaptive and locality-aware buffering technique for managing these buffers. GDJ exploits the temporal correlations (at both long and short time scales), which we found to be prevalent in many real data streams. We note that our algorithm is readily applicable to multiple data streams and multiple joins and requires almost no additional system resources. We report results of an experimental study using both synthetic and real-world data sets. Our results demonstrate the superiority and flexibility of our approach when contrasted to other recently proposed techniques.

New tools to boost butterfly habitat quality in existing grass buffer strips

There are approximately 29,000 ha of grass buffer strips in the UK under Agri-Environment Schemes; however, typically they are floristically poor and as such are of limited biodiversity value. Introducing a sown wildflower component has the potential to increase dramatically the value of these buffer strips for a suite of native species, including butterflies. This study investigates management practices aiming to promote the establishment and maintenance of wildflowers in existing buffer strips. The effectiveness of two methods used to increase the establishment of wildflowers for the benefit of native butterfly species were tested, both individually and in combination. The management practices were: (1) the application of a selective graminicide (fluazifop-P-butyl) which reduces the dominance of competitive grasses; and (2) scarification of the soil which creates germination niches for sown wildflower seeds. A wildflower seed mix consisting of nine species was sown in conjunction with the scarification treatment. Responses of wildflowers and butterflies were monitored for two years after establishment. Results indicate that the combined scarification and graminicide treatment produced the greatest cover and species richness of sown wildflowers. Butterfly abundance, species richness and diversity were positively correlated with sown wildflower species richness, with the highest values in the combined scarification and graminicide treatment. These findings have confirmed the importance of both scarification as a means of introducing wildflower seed into existing buffer strips, and subsequent management using graminicides, for the benefit of butterflies. Application of this approach could provide tools to help butterfly conservation on farmland in the future.

Can site and landscape-scale environmental attributes buffer bird populations against weather events?

Projected impacts of climate change on the populations and distributions of species pose a challenge for conservationists. In response, a number of adaptation strategies to enable species to persist in a changing climate have been proposed. Management to maximise the quality of habitat at existing sites may reduce the magnitude or frequency of climate-driven population declines. In addition large-scale management of landscapes could potentially improve the resilience of populations by facilitating inter-population movements. A reduction in the obstacles to species’ range expansion, may also allow species to track changing conditions better through shifts to new locations, either regionally or locally. However, despite a strong theoretical base, there is limited empirical evidence to support these management interventions. This makes it difficult for conservationists to decide on the most appropriate strategy for different circumstances. Here extensive data from long-term monitoring of woodland birds at individual sites are used to examine the two-way interactions between habitat and both weather and population count in the previous year. This tests the extent to which site-scale and landscape-scale habitat attributes may buffer populations against variation in winter weather (a key driver of woodland bird population size) and facilitate subsequent population growth. Our results provide some support for the prediction that landscape-scale attributes (patch isolation and area of woodland habitat) may influence the ability of some woodland bird species to withstand weather-mediated population declines. These effects were most apparent among generalist woodland species. There was also evidence that several, primarily specialist, woodland species are more likely to increase following population decline where there is more woodland at both site and landscape scales. These results provide empirical support for the concept that landscape-scale conservation efforts may make the populations of some woodland bird species more resilient to climate change. However in isolation, management is unlikely to provide a universal benefit to all species.

Development of an ultra mini-oxygenator for use in low-volume, buffer-perfused preparations

Introduction: Small animal models are widely used in basic research. However, experimental systems requiring extracorporeal circuits are frequently confronted with limitations related to equipment size. This is particularly true for oxygenators in systems with limited volumes. Thus we aimed to develop and validate an ultra mini-oxygenator for low-volume, buffer-perfused systems. Methods: We have manufactured a series of ultra mini-oxygenators with approximately 175 aligned, microporous, polypropylene hollow fibers contained inside a shell, which is sealed at each of the two extremities to isolate perfusate and gas compartments. With this construction, gas passes through hollow fibers, while perfusate circulates around fibers. Performance of ultra mini-oxygenators (oxygen partial pressure (PO2 ), gas and perfusate flow, perfusate pressure and temperature drop) were assessed with modified Krebs-Henseleit buffer in an in vitro perfusion circuit and an ex vivo rat heart preparation. Results: Mean priming volume of ultra mini-oxygenators was 1.2±0.5 mL and, on average, 86±6% of fibers were open (n=17). In vitro, effective oxygenation (PO2=400-500 mmHg) was achieved for all flow rates up to 50 mL/min and remained stable for at least 2 hours (n=5). Oxygenation was also effective and stable (PO2=456±40 mmHg) in the isolated heart preparation for at least 60 minutes ("venous" PO2=151±11 mmHg; n=5). Conclusions: We have established a reproducible procedure for fabrication of ultra mini-oxygenators, which provide reliable and stable oxygenation for at least 60-120 min. These oxygenators are especially attractive for pre-clinical protocols using small, rather than large, animals.

Predator species identification from saliva at kill sites with limited remains

Thesis (Master's)--University of Washington, 2016-06

The effect of gender context on children's social behaviour in a limited resources situation : an observational study

Knowing when to compete and when to cooperate to maximize opportunities for equal access to activities and materials in groups is critical to children's social and cognitive development. The present study examined the individual (gender, social competence) and contextual factors (gender context) that may determine why some children are more successful than others. One hundred and fifty-six children (M age=6.5 years) were divided into 39 groups of four and videotaped while engaged in a task that required them to cooperate in order to view cartoons. Children within all groups were unfamiliar to one another. Groups varied in gender composition (all girls, all boys, or mixed-sex) and social competence (high vs. low). Group composition by gender interaction effects were found. Girls were most successful at gaining viewing time in same-sex groups, and least successful in mixed-sex groups. Conversely, boys were least successful in same-sex groups and most successful in mixed-sex groups. Similar results were also found at the group level of analysis; however, the way in which the resources were distributed differed as a function of group type. Same-sex girl groups were inequitable but efficient whereas same-sex boy groups were more equitable than mixed groups but inefficient compared to same-sex girl groups. Social competence did not influence children's behavior. The findings from the present study highlight the effect of gender context on cooperation and competition and the relevance of adopting an unfamiliar peer paradigm when investigating children's social behavior.