Techniques to effectively buffer schedules in the face of uncertainties

Resource assignment and scheduling is a difficult task when job processing times are stochastic, and resources are to be used for both known and unknown demand. To operate effectively within such an environment, several novel strategies are investigated. The first focuses upon the creation of a robust schedule, and utilises the concept of strategically placed idle time (i.e. buffering). The second approach introduces the idea of maintaining a number of free resources at each time, and culminates in another form of strategically placed buffering. The attraction of these approaches is that they are easy to grasp conceptually, and mimic what practitioners already do in practice. Our extensive numerical testing has shown that these techniques ensure more prompt job processing, and reduced job cancellations and waiting time. They are effective in the considered setting and could easily be adapted for many real life problems, for instance those in health care. This article has more importantly demonstrated that integrating the two approaches is a better strategy and will provide an effective stochastic scheduling approach.

New graph-based algorithms to efficiently solve large scale open pit mining optimisation problems

In the mining optimisation literature, most researchers focused on two strategic-level and tactical-level open-pit mine optimisation problems, which are respectively termed ultimate pit limit (UPIT) or constrained pit limit (CPIT). However, many researchers indicate that the substantial numbers of variables and constraints in real-world instances (e.g., with 50-1000 thousand blocks) make the CPIT’s mixed integer programming (MIP) model intractable for use. Thus, it becomes a considerable challenge to solve the large scale CPIT instances without relying on exact MIP optimiser as well as the complicated MIP relaxation/decomposition methods. To take this challenge, two new graph-based algorithms based on network flow graph and conjunctive graph theory are developed by taking advantage of problem properties. The performance of our proposed algorithms is validated by testing recent large scale benchmark UPIT and CPIT instances’ datasets of MineLib in 2013. In comparison to best known results from MineLib, it is shown that the proposed algorithms outperform other CPIT solution approaches existing in the literature. The proposed graph-based algorithms leads to a more competent mine scheduling optimisation expert system because the third-party MIP optimiser is no longer indispensable and random neighbourhood search is not necessary.

Application of simulated annealing to data distribution for all-to-all comparison problems in homogeneous systems

Distributed systems are widely used for solving large-scale and data-intensive computing problems, including all-to-all comparison (ATAC) problems. However, when used for ATAC problems, existing computational frameworks such as Hadoop focus on load balancing for allocating comparison tasks, without careful consideration of data distribution and storage usage. While Hadoop-based solutions provide users with simplicity of implementation, their inherent MapReduce computing pattern does not match the ATAC pattern. This leads to load imbalances and poor data locality when Hadoop's data distribution strategy is used for ATAC problems. Here we present a data distribution strategy which considers data locality, load balancing and storage savings for ATAC computing problems in homogeneous distributed systems. A simulated annealing algorithm is developed for data distribution and task scheduling. Experimental results show a significant performance improvement for our approach over Hadoop-based solutions.

A Strength Pareto Evolutionary Algorithm for live migration of multiple interdependent virtual machines in data centers

Although live VM migration has been intensively studied, the problem of live migration of multiple interdependent VMs has hardly been investigated. The most important problem in the live migration of multiple interdependent VMs is how to schedule VM migrations as the schedule will directly affect the total migration time and the total downtime of those VMs. Aiming at minimizing both the total migration time and the total downtime simultaneously, this paper presents a Strength Pareto Evolutionary Algorithm 2 (SPEA2) for the multi-VM migration scheduling problem. The SPEA2 has been evaluated by experiments, and the experimental results show that the SPEA2 can generate a set of VM migration schedules with a shorter total migration time and a shorter total downtime than an existing genetic algorithm, namely Random Key Genetic Algorithm (RKGA). This paper also studies the scalability of the SPEA2.

A new open-pit multi-stage mine production timetabling model for drilling, blasting and excavating operations

This paper proposes a new multi-resource multi-stage mine production timetabling problem for optimising the open-pit drilling, blasting and excavating operations under equipment capacity constraints. The flow process is analysed based on the real-life data from an Australian iron ore mine site. The objective of the model is to maximise the throughput and minimise the total idle times of equipment at each stage. The following comprehensive mining attributes and constraints are considered: types of equipment; operating capacities of equipment; ready times of equipment; speeds of equipment; block-sequence-dependent movement times; equipment-assignment-dependent operational times; etc. The model also provides the availability and usage of equipment units at multiple operational stages such as drilling, blasting and excavating stages. The problem is formulated by mixed integer programming and solved by ILOG-CPLEX optimiser. The proposed model is validated with extensive computational experiments to improve mine production efficiency at the operational level.

Tracking the patient journey by combining multiple hospital database systems

With new national targets for patient flow in public hospitals designed to increase efficiencies in patient care and resource use, better knowledge of events affecting length of stay will support improved bed management and scheduling of procedures. This paper presents a case study involving the integration of material from each of three databases in operation at one tertiary hospital and demonstrates it is possible to follow patient journeys from admission to discharge. What is known about this topic? At present, patient data at one Queensland tertiary hospital are assembled in three information systems: (1) the Hospital Based Corporate Information System (HBCIS), which tracks patients from in-patient admission to discharge; (2) the Emergency Department Information System (EDIS) containing patient data from presentation to departure from the emergency department; and (3) Operation Room Management Information System (ORMIS), which records surgical operations. What does this paper add? This paper describes how a new enquiry tool may be used to link the three hospital information systems for studying the hospital journey through different wards and/or operating theatres for both individual and groups of patients. What are the implications for practitioners? An understanding of the patients’ journeys provides better insight into patient flow and provides the tool for research relating to access block, as well as optimising the use of physical and human resources.

Hybrid metaheuristic techniques for optimising sugarcane rail operations

Mixed integer programming and parallel-machine job shop scheduling are used to solve the sugarcane rail transport scheduling problem. Constructive heuristics and metaheuristics were developed to produce a more efficient scheduling system and so reduce operating costs. The solutions were tested on small and large size problems. High-quality solutions and improved CPU time are the result of developing new hybrid techniques which consist of different ways of integrating simulated annealing and Tabu search techniques.

A new load distribution strategy for linear network with communication delays

In this paper, we propose a new load distribution strategy called `send-and-receive' for scheduling divisible loads, in a linear network of processors with communication delay. This strategy is designed to optimally utilize the network resources and thereby minimizes the processing time of entire processing load. A closed-form expression for optimal size of load fractions and processing time are derived when the processing load originates at processor located in boundary and interior of the network. A condition on processor and link speed is also derived to ensure that the processors are continuously engaged in load distributions. This paper also presents a parallel implementation of `digital watermarking problem' on a personal computer-based Pentium Linear Network (PLN) topology. Experiments are carried out to study the performance of the proposed strategy and results are compared with other strategies found in literature.

Laboratory investigation on the effects of overburden pressure, water, and time on slaking induced material property degradation of coal mine spoil

In open-cut strip mining, waste material is placed in-pit to minimise operational mine costs. Slope failures in these spoil piles pose a significant safety risk to personnel, along with a financial risk from loss of equipment and scheduling delays. It has been observed that most spoil pile failures occur when the pit has been previously filled with water and then subsequently dewatered. The failures are often initiated at the base of spoil piles where the material can undergo significant slaking (disintegration) over time due to overburden pressure and water saturation. It is important to understand how the mechanical properties of base spoil material are affected by slaking when designing safe spoil pile slope angles, heights, and dewatering rates. In this study, fresh spoil material collected from a coal mine in Brown Basin Coalfield of Queensland, Australia was subjected to high overburden pressure (0 – 900 kPa) under saturated condition and maintained over a period of time (0 – 6 months) allowing the material to slake. To create the above conditions, laboratory designed pressure chambers were used. Once a spoil sample was slaked under certain overburden pressure over a period of time, it was tested for classification, permeability, and strength properties. Results of this testing program suggested that the slaking of saturated coal mine spoil increase with overburden pressure and the time duration over which the overburden pressure was maintained. Further, it was observed that shear strength and permeability of spoil decreased with increase in spoil slaking.

A near Optimal Cane Rail Scheduler under Limited and Unlimited Capacity Constraints

Australia is the world’s third largest exporter of raw sugar after Brazil and Thailand, with around $2.0 billion in export earnings. Transport systems play a vital role in the raw sugar production process by transporting the sugarcane crop between farms and mills. In 2013, 87 per cent of sugarcane was transported to mills by cane railway. The total cost of sugarcane transport operations is very high. Over 35% of the total cost of sugarcane production in Australia is incurred in cane transport. A cane railway network mainly involves single track sections and multiple track sections used as passing loops or sidings. The cane railway system performs two main tasks: delivering empty bins from the mill to the sidings for filling by harvesters; and collecting the full bins of cane from the sidings and transporting them to the mill. A typical locomotive run involves an empty train (locomotive and empty bins) departing from the mill, traversing some track sections and delivering bins at specified sidings. The locomotive then, returns to the mill, traversing the same track sections in reverse order, collecting full bins along the way. In practice, a single track section can be occupied by only one train at a time, while more than one train can use a passing loop (parallel sections) at a time. The sugarcane transport system is a complex system that includes a large number of variables and elements. These elements work together to achieve the main system objectives of satisfying both mill and harvester requirements and improving the efficiency of the system in terms of low overall costs. These costs include delay, congestion, operating and maintenance costs. An effective cane rail scheduler will assist the traffic officers at the mill to keep a continuous supply of empty bins to harvesters and full bins to the mill with a minimum cost. This paper addresses the cane rail scheduling problem under rail siding capacity constraints where limited and unlimited siding capacities were investigated with different numbers of trains and different train speeds. The total operating time as a function of the number of trains, train shifts and a limited number of cane bins have been calculated for the different siding capacity constraints. A mathematical programming approach has been used to develop a new scheduler for the cane rail transport system under limited and unlimited constraints. The new scheduler aims to reduce the total costs associated with the cane rail transport system that are a function of the number of bins and total operating costs. The proposed metaheuristic techniques have been used to find near optimal solutions of the cane rail scheduling problem and provide different possible solutions to avoid being stuck in local optima. A numerical investigation and sensitivity analysis study is presented to demonstrate that high quality solutions for large scale cane rail scheduling problems are obtainable in a reasonable time. Keywords: Cane railway, mathematical programming, capacity, metaheuristics

Effect of timing of a deficit-irrigation allocation on corn evapotranspiration, yield, water use efficiency and dry mass

Water regulations have decreased irrigation water supplies in Nebraska and some other areas of the USA Great Plains. When available water is not enough to meet crop water requirements during the entire growing cycle, it becomes critical to know the proper irrigation timing that would maximize yields and profits. This study evaluated the effect of timing of a deficit-irrigation allocation (150 mm) on crop evapotranspiration (ETc), yield, water use efficiency (WUE = yield/ETc), irrigation water use efficiency (IWUE = yield/irrigation), and dry mass (DM) of corn (Zea mays L.) irrigated with subsurface drip irrigation in the semiarid climate of North Platte, NE. During 2005 and 2006, a total of sixteen irrigation treatments (eight each year) were evaluated, which received different percentages of the water allocation during July, August, and September. During both years, all treatments resulted in no crop stress during the vegetative period and stress during the reproductive stages, which affected ETc, DM, yield, WUE and IWUE. Among treatments, ETc varied by 7.2 and 18.8%; yield by 17 and 33%; WUE by 12 and 22%, and IWUE by 18 and 33% in 2005 and 2006, respectively. Yield and WUE both increased linearly with ETc and with ETc/ETp (ETp = seasonal ETc with no water stress), and WUE increased linearly with yield. The yield response factor (ky) averaged 1.50 over the two seasons. Irrigation timing affected the DM of the plant, grain, and cob, but not that of the stover. It also affected the percent of DM partitioned to the grain (harvest index), which increased linearly with ETc and averaged 56.2% over the two seasons, but did not affect the percent allocated to the cob or stover. Irrigation applied in July had the highest positive coefficient of determination (R2) with yield. This high positive correlation decreased considerably for irrigation applied in August, and became negative for irrigation applied in September. The best positive correlation between the soil water deficit factor (Ks) and yield occurred during weeks 12-14 from crop emergence, during the "milk" and "dough" growth stages. Yield was poorly correlated to stress during weeks 15 and 16, and the correlation became negative after week 17. Dividing the 150 mm allocation about evenly among July, August and September was a good strategy resulting in the highest yields in 2005, but not in 2006. Applying a larger proportion of the allocation in July was a good strategy during both years, and the opposite resulted when applying a large proportion of the allocation in September. The different results obtained between years indicate that flexible irrigation scheduling techniques should be adopted, rather than relying on fixed timing strategies.

Amenity grasses for salt-affected parks in coastal Australia

In February 2004, Redland Shire Council with help from a Horticulture Australia research project was able to establish a stable grass cover of seashore paspalum (Paspalum vaginatum) on a Birkdale park where the soil had previously proved too salty to grow anything else. Following on from their success with this small 0.2 ha demonstration area, Redland Shire has since invested hundreds of thousands of dollars in successfully turfing other similarly “impossible” park areas with seashore paspalum. Urban salinity can arise for different reasons in different places. In inland areas such as southern NSW and the WA wheatbelt, the usual cause is rising groundwater bringing salt to the surface. In coastal sites, salt spray or periodic tidal inundation can result in problems. In Redland Shire’s case, the issue was compacted marine sediments (mainly mud) dug up and dumped to create foreshore parkland in the course of artificial canal developments. At Birkdale, this had created a site that was both strongly acid and too salty for most plants. Bare saline scalds were interspersed by areas of unthrifty grass. Finding a salt tolerant grass is no “silver bullet” or easy solution to salinity problems. Rather, it buys time to implement sustainable long-term establishment and maintenance practices, which are even more critical than with conventional turfgrasses. These practices include annual slicing or coring in conjunction with gypsum/dolomite amendment and light topdressing with sandy loam soil (to about 1 cm depth), adequate maintenance fertiliser, weed control measures, regular leaching irrigation was applied to flush salts below the root zone, and irrigation scheduling to maximise infiltration and minimise run off. Three other halophytic turfgrass species were also identified, each of them adapted to different environments, management regimes and uses. These have been shortlisted for larger-scale plantings in future work.

Quantifying surfactant interaction effects on soil moisture and turf quality

Soil water repellency occurs widely in horticultural and agricultural soils when very dry. The gradual accumulation and breakdown of surface organic matter over time produces wax-like organic acids, which coat soil particles preventing uniform entry of water into the soil. Water repellency is usually managed by regular surfactant applications. Surfactants, literally, are surface active agents (SURFace ACTive AgeNTS). Their mode of action is to reduce the surface tension of water, allowing it to penetrate and wet the soil more easily and completely. This practice improves water use efficiency (by requiring less water to wet the soil and by capturing rainfall and irrigation more effectively and rapidly). It also reduces nutrient losses through run-off erosion or leaching. These nutrients have the potential to pollute the surrounding environment and water courses. This project investigated potential improvements to standard practices (product combination and scheduling) for surfactant use to overcome localised dry spots on water repellent soils and thus improve turf quality and water use efficiency. Weather conditions for the duration of the trial prevented the identification of improved practices in terms of combination and scheduling. However, the findings support previous research that the use of soil surfactants decreased the time for water to infiltrate dry soil samples taken from a previously severely hydrophobic site. Data will be continually collected from this trial site on a private contractual basis, with the hope that improvements to standard practices will be observed during the drier winter months when moisture availability is a limiting factor for turfgrass growth and quality.

Increasing Adoption of Irrigation and Water Recycling Technologies in Australia

Retrofitting nurseries to increase water use efficiency and evaluate 4 soil moisture sensors for irrigation scheduling.

Oncolytic adenoviruses for treatment of ovarian cancer

Virotherapy, the use of oncolytic properties of viruses for eradication of tumor cells, is an attractive strategy for treating cancers resistant to traditional modalities. Adenoviruses can be genetically modified to selectively replicate in and destroy tumor cells through exploitation of molecular differences between normal and cancer cells. The lytic life cycle of adenoviruses results in oncolysis of infected cells and spreading of virus progeny to surrounding cells. In this study, we evaluated different strategies for improving safety and efficacy of oncolytic virotherapy against human ovarian adenocarcinoma. We examined the antitumor efficacy of Ad5/3-Δ24, a serotype 3 receptor-targeted pRb-p16 pathway-selective oncolytic adenovirus, in combination with conventional chemotherapeutic agents. We observed synergistic activity in ovarian cancer cells when Ad5/3-Δ24 was given with either gemcitabine or epirubicin, common second-line treatment options for ovarian cancer. Our results also indicate that gemcitabine reduces the initial rate of Ad5/3-Δ24 replication without affecting the total amount of virus produced. In an orthotopic murine model of peritoneally disseminated ovarian cancer, combining Ad5/3-Δ24 with either gemcitabine or epirubicin resulted in greater therapeutic benefit than either agent alone. Another useful approach for increasing the efficacy of oncolytic agents is to arm viruses with therapeutic transgenes such as genes encoding prodrug-converting enzymes. We constructed Ad5/3-Δ24-TK-GFP, an oncolytic adenovirus encoding the thymidine kinase (TK) green fluorescent protein (GFP) fusion protein. This novel virus replicated efficiently on ovarian cancer cells, which correlated with increased GFP expression. Delivery of prodrug ganciclovir (GCV) immediately after infection abrogated viral replication, which might have utility as a safety switch mechanism. Oncolytic potency in vitro was enhanced by GCV in one cell line, and the interaction was not dependent on scheduling of the treatments. However, in murine models of metastatic ovarian cancer, administration of GCV did not add therapeutic benefit to this highly potent oncolytic agent. Detection of tumor progression and virus replication with bioluminescence and fluorescence imaging provided insight into the in vivo kinetics of oncolysis in living mice. For optimizing protocols for upcoming clinical trials, we utilized orthotopic murine models of ovarian cancer to analyze the effect of dose and scheduling of intraperitoneally delivered Ad5/3-Δ24. Weekly administration of Ad5/3-Δ24 did not significantly enhance antitumor efficacy over a single treatment. Our results also demonstrate that even a single intraperitoneal injection of only 100 viral particles significantly increased the survival of mice compared with untreated animals. Improved knowledge of adenovirus biology has resulted in creation of more effective oncolytic agents. However, with more potent therapy regimens an increase in unwanted side-effects is also possible. Therefore, inhibiting viral replication when necessary would be beneficial. We evaluated the antiviral activity of chlorpromazine and apigenin on adenovirus replication and associated toxicity in fresh human liver samples, normal cells, and ovarian cancer cells. Further, human xenografts in mice were utilized to evaluate antitumor efficacy, viral replication, and liver toxicity. Our data suggest that these agents can reduce replication of adenoviruses, which could provide a safety switch in case of replication-associated side-effects. In conclusion, we demonstrate that Ad5/3-Δ24 is a useful oncolytic agent for treatment of ovarian cancer either alone or in combination with conventional chemotherapeutic drugs. Insertion of genes encoding prodrug-converting enzymes into the genome of Ad5/3-Δ24 might not lead to enhanced antitumor efficacy with this highly potent oncolytic virus. As a safety feature, viral activity can be inhibited with pharmacological substances. Clinical trials are however needed to confirm if these preclinical results can be translated into efficacy in humans. Promising safety data seen here, and in previous publications suggest that clinical evaluation of the agent is feasible.