A theory of constraints service systems improvement method: Case of the airline turnaround problem

This dissertation develops a process improvement method for service operations based on the Theory of Constraints (TOC), a management philosophy that has been shown to be effective in manufacturing for decreasing WIP and improving throughput. While TOC has enjoyed much attention and success in the manufacturing arena, its application to services in general has been limited. The contribution to industry and knowledge is a method for improving global performance measures based on TOC principles. The method proposed in this dissertation will be tested using discrete event simulation based on the scenario of the service factory of airline turnaround operations. To evaluate the method, a simulation model of aircraft turn operations of a U.S. based carrier was made and validated using actual data from airline operations. The model was then adjusted to reflect an application of the Theory of Constraints for determining how to deploy the scarce resource of ramp workers. The results indicate that, given slight modifications to TOC terminology and the development of a method for constraint identification, the Theory of Constraints can be applied with success to services. Bottlenecks in services must be defined as those processes for which the process rates and amount of work remaining are such that completing the process will not be possible without an increase in the process rate. The bottleneck ratio is used to determine to what degree a process is a constraint. Simulation results also suggest that redefining performance measures to reflect a global business perspective of reducing costs related to specific flights versus the operational local optimum approach of turning all aircraft quickly results in significant savings to the company. Savings to the annual operating costs of the airline were simulated to equal 30% of possible current expenses for misconnecting passengers with a modest increase in utilization of the workers through a more efficient heuristic of deploying them to the highest priority tasks. This dissertation contributes to the literature on service operations by describing a dynamic, adaptive dispatch approach to manage service factory operations similar to airline turnaround operations using the management philosophy of the Theory of Constraints.

Multiple evolutionary rate classes in animal genome evolution

The proportion of functional sequence in the human genome is currently a subject of debate. The most widely accepted figure is that approximately 5% is under purifying selection. In Drosophila, estimates are an order of magnitude higher, though this corresponds to a similar quantity of sequence. These estimates depend on the difference between the distribution of genomewide evolutionary rates and that observed in a subset of sequences presumed to be neutrally evolving. Motivated by the widening gap between these estimates and experimental evidence of genome function, especially in mammals, we developed a sensitive technique for evaluating such distributions and found that they are much more complex than previously apparent. We found strong evidence for at least nine well-resolved evolutionary rate classes in an alignment of four Drosophila species and at least seven classes in an alignment of four mammals, including human. We also identified at least three rate classes in human ancestral repeats. By positing that the largest of these ancestral repeat classes is neutrally evolving, we estimate that the proportion of nonneutrally evolving sequence is 30% of human ancestral repeats and 45% of the aligned portion of the genome. However, we also question whether any of the classes represent neutrally evolving sequences and argue that a plausible alternative is that they reflect variable structure-function constraints operating throughout the genomes of complex organisms.

Gender differences in recreational and transport cycling : a cross-sectional mixed-methods comparison of cycling patterns, motivators, and constraints

Background: Gender differences in cycling are well-documented. However, most analyses of gender differences make broad comparisons, with few studies modeling male and female cycling patterns separately for recreational and transport cycling. This modeling is important, in order to improve our efforts to promote cycling to women and men in countries like Australia with low rates of transport cycling. The main aim of this study was to examine gender differences in cycling patterns and in motivators and constraints to cycling, separately for recreational and transport cycling. Methods: Adult members of a Queensland, Australia, community bicycling organization completed an online survey about their cycling patterns; cycling purposes; and personal, social and perceived environmental motivators and constraints (47% response rate). Closed and open-end questions were completed. Using the quantitative data, multivariable linear, logistic and ordinal regression models were used to examine associations between gender and cycling patterns, motivators and constraints. The qualitative data were thematically analysed to expand upon the quantitative findings. Results: In this sample of 1862 bicyclists, men were more likely than women to cycle for recreation and for transport, and they cycled for longer. Most transport cycling was for commuting, with men more likely than women to commute by bicycle. Men were more likely to cycle on-road, and women off-road. However, most men and women did not prefer to cycle on-road without designed bicycle lanes, and qualitative data indicated a strong preference by men and women for bicycle-only off-road paths. Both genders reported personal factors (health and enjoyment related) as motivators for cycling, although women were more likely to agree that other personal, social and environmental factors were also motivating. The main constraints for both genders and both cycling purposes were perceived environmental factors related to traffic conditions, motorist aggression and safety. Women, however, reported more constraints, and were more likely to report as constraints other environmental factors and personal factors. Conclusion: Differences found in men’s and women’s cycling patterns, motivators and constraints should be considered in efforts to promote cycling, particularly in efforts to increase cycling for transport.

PartSS : An efficient partition-based filtering for edit distance constraints

This paper introduces PartSS, a new partition-based fil- tering for tasks performing string comparisons under edit distance constraints. PartSS offers improvements over the state-of-the-art method NGPP with the implementation of a new partitioning scheme and also improves filtering abil- ities by exploiting theoretical results on shifting and scaling ranges, thus accelerating the rate of calculating edit distance between strings. PartSS filtering has been implemented within two major tasks of data integration: similarity join and approximate membership extraction under edit distance constraints. The evaluation on an extensive range of real-world datasets demonstrates major gain in efficiency over NGPP and QGrams approaches.

Life-history constraints in grassland plant species : a growth-defence trade-off is the norm

Plant growth can be limited by resource acquisition and defence against consumers, leading to contrasting trade-off possibilities. The competition-defence hypothesis posits a trade-off between competitive ability and defence against enemies (e.g. herbivores and pathogens). The growth-defence hypothesis suggests that strong competitors for nutrients are also defended against enemies, at a cost to growth rate. We tested these hypotheses using observations of 706 plant populations of over 500 species before and following identical fertilisation and fencing treatments at 39 grassland sites worldwide. Strong positive covariance in species responses to both treatments provided support for a growth-defence trade-off: populations that increased with the removal of nutrient limitation (poor competitors) also increased following removal of consumers. This result held globally across 4 years within plant life-history groups and within the majority of individual sites. Thus, a growth-defence trade-off appears to be the norm, and mechanisms maintaining grassland biodiversity may operate within this constraint.

GNSS ambiguity resolution with controllable failure rate for long baseline network RTK

Many large-scale GNSS CORS networks have been deployed around the world to support various commercial and scientific applications. To make use of these networks for real-time kinematic positioning services, one of the major challenges is the ambiguity resolution (AR) over long inter-station baselines in the presence of considerable atmosphere biases. Usually, the widelane ambiguities are fixed first, followed by the procedure of determination of the narrowlane ambiguity integers based on the ionosphere-free model in which the widelane integers are introduced as known quantities. This paper seeks to improve the AR performance over long baseline through efficient procedures for improved float solutions and ambiguity fixing. The contribution is threefold: (1) instead of using the ionosphere-free measurements, the absolute and/or relative ionospheric constraints are introduced in the ionosphere-constrained model to enhance the model strength, thus resulting in the better float solutions; (2) the realistic widelane ambiguity precision is estimated by capturing the multipath effects due to the observation complexity, leading to improvement of reliability of widelane AR; (3) for the narrowlane AR, the partial AR for a subset of ambiguities selected according to the successively increased elevation is applied. For fixing the scalar ambiguity, an error probability controllable rounding method is proposed. The established ionosphere-constrained model can be efficiently solved based on the sequential Kalman filter. It can be either reduced to some special models simply by adjusting the variances of ionospheric constraints, or extended with more parameters and constraints. The presented methodology is tested over seven baselines of around 100 km from USA CORS network. The results show that the new widelane AR scheme can obtain the 99.4 % successful fixing rate with 0.6 % failure rate; while the new rounding method of narrowlane AR can obtain the fix rate of 89 % with failure rate of 0.8 %. In summary, the AR reliability can be efficiently improved with rigorous controllable probability of incorrectly fixed ambiguities.

A multi-hierarchical motorway ramp signalling strategy

Ramp signalling is an access control for motorways, in which a traffic signal is placed at on-ramps to regulate the rate of vehicles entering the motorway and thus to preserve the motorway capacity. In general, ramp signalling algorithms fall into two categories: local control and coordinated control by their effective scope. Coordinated ramp signalling strategies make use of measurements from the entire motorway network to operate individual ramp signals for the optimal performances at the network level. This study proposes a multi-hierarchical strategy for coordinated ramp signalling. The strategy is structured in two layers. At the higher layer with a longer update interval, coordination group is assembled and disassembled based on the location of high-risk breakdown flow. At the lower layer with a shorter update interval, individual ramps are hired to serve the coordination and are also released based on the prevailing congestion level on the ramp. This strategy is modelled and applied to the northbound Pacific Motorway micro-simulation platform (AIMSUN). The simulation results show an effective congestion mitigation of the proposed strategy.

A ramp metering strategy for rapid congestion recovery

Recurrent congestion caused by high commuter traffic is an irritation to motorway users. Ramp metering (RM) is the most effective motorway control means (M Papageorgiou & Kotsialos, 2002) for significantly reducing motorway congestion. However, given field constraints (e.g. limited ramp space and maximum ramp waiting time), RM cannot eliminate recurrent congestion during the increased long peak hours. This paper, therefore, focuses on rapid congestion recovery to further improve RM systems: that is, to quickly clear congestion in recovery periods. The feasibility of using RM for recovery is analyzed, and a zone recovery strategy (ZRS) for RM is proposed. Note that this study assumes no incident and demand management involved, i.e. no re-routing behavior and strategy considered. This strategy is modeled, calibrated and tested in the northbound model of the Pacific Motorway, Brisbane, Australia in a micro-simulation environment for recurrent congestion scenario, and evaluation results have justified its effectiveness.

A multi-hierarchical strategy for on-ramp coordination

Ramp metering (RM) is an access control for motorways, in which a traffic signal is placed at on-ramps to regulate the rate of vehicles entering the motorway and thus to preserve the motorway capacity. In general, RM algorithms fall into two categories by their effective scope: local control and coordinated control. Local control algorithm determines the metering rate based on the traffic condition on adjacent motorway mainline and the on-ramp. Conversely, coordinated RM strategies make use of measurements from the entire motorway network to operate individual ramp signals for optimal performance at the network level. This study proposes a multi-hierarchical strategy for on-ramp coordination. The strategy is structured in two layers. At the higher layer, a centralised, predictive controller plans the coordination control within a long update interval based on the location of high-risk breakdown flow. At the lower layer, reactive controllers determine the metering rates of those ramps involved in the ramp coordination with a short update interval. This strategy is modelled and applied to the northbound model of the Pacific Motorway in a micro-simulation platform (AIMSUN). The simulation results show that the proposed strategy effectively delays the onset of congestion and reduces total congestion with better managed on-ramp queues.

Nutritional constraints on displacement of Fusarium pseudograminearum from cereal straw by antagonists.

Displacement of the fungus Fusarium pseudograminearum from stubble by antagonists is a potential means of biocontrol of crown rot in cereals. The role of carbon and nitrogen nutrition in interactions between the pathogen and the antagonists Fusarium equiseti, Fusarium nygamai, Trichoderma harzianum and the non-antagonistic straw fungus Alternaria infectoria was investigated. Sole carbon source utilization patterns on Biolog plates were similar among the three Fusarium species, suggesting a possible role for competition. However, carbon niche overlap was unlikely to be important in antagonism by T. harzianum. Straw medium supplemented with sugars generally reduced the inhibitory effect of antagonists on growth of F. pseudograminearum in dual culture, indicating that availability of simple carbon sources does not limit antagonism. Adding nitrogen as urea, nitrate or ammonium to straw medium had little effect on antagonism by F. equiseti and F. nygamai, but ammonium addition removed the inhibitory effect of T. harzianum on growth of F. pseudograminearum. Displacement of F. pseudograminearum from straw by all fungi in a Petri dish assay was greater when urea or nitrate was used as a nitrogen source than with ammonium. All forms of nitrogen significantly increased displacement of F. pseudograminearum from straw under simulated field conditions when straws were either inoculated with T. harzianum or exposed to resident soil microbes. However, in 2 out of 3 experiments urea and nitrate were more effective than ammonium. The results suggest that availability of nitrogen, but not carbon, is limiting the activities of antagonists of F. pseudograminearum in straw, and the way nitrogen is applied can influence the rate of displacement and mortality of the pathogen in host residues.

When and why threats go undetected: Impacts of event rate and shift length on threat detection accuracy during airport baggage screening

Objective: We aimed to assess the impact of task demands and individual characteristics on threat detection in baggage screeners. Background: Airport security staff work under time constraints to ensure optimal threat detection. Understanding the impact of individual characteristics and task demands on performance is vital to ensure accurate threat detection. Method: We examined threat detection in baggage screeners as a function of event rate (i.e., number of bags per minute) and time on task across 4 months. We measured performance in terms of the accuracy of detection of Fictitious Threat Items (FTIs) randomly superimposed on X-ray images of real passenger bags. Results: Analyses of the percentage of correct FTI identifications (hits) show that longer shifts with high baggage throughput result in worse threat detection. Importantly, these significant performance decrements emerge within the first 10 min of these busy screening shifts only. Conclusion: Longer shift lengths, especially when combined with high baggage throughput, increase the likelihood that threats go undetected. Application: Shorter shift rotations, although perhaps difficult to implement during busy screening periods, would ensure more consistently high vigilance in baggage screeners and, therefore, optimal threat detection and passenger safety.

Starburst in the ultraluminous galaxy Arp 220: Constraints from observations of radio recombination lines and continuum

We present observations of radio recombination lines (RRL) from the starburst galaxy Arp 220 at 8.1 GHz (H92 alpha) and 1.4 GHz (H167 alpha and H165 alpha) and at 84 GHz (H42 alpha), 96 GHz (H40 alpha) and 207 GHz (H31 alpha) using the Very Large Array and the IRAM 30 m telescope, respectively. RRLs were detected at all the frequencies except 1.4 GHz, where a sensitive upper limit was obtained. We also present continuum flux measurements at these frequencies as well as at 327 MHz made with the VLA. The continuum spectrum, which has a spectral index alpha similar to -0.6 (S-nu proportional to nu(alpha)) between 5 and 10 GHz, shows a break near 1.5 GHz, a prominent turnover below 500 MHz, and a flatter spectral index above 50 GHz. We show that a model with three components of ionized gas with different densities and area covering factors can consistently explain both RRL and continuum data. The total mass of ionized gas in the three components is 3.2 x 10(7) M., requiring 3 x 10(5) O5 stars with a total Lyman continuum production rate N-Lyc similar to 1.3 x 10(55) photons s(-1). The ratio of the expected to observed Br alpha and Br gamma fluxes implies a dust extinction A(V) similar to 45 mag. The derived Lyman continuum photon production rate implies a continuous star formation rate (SFR) averaged over the lifetime of OB stars of similar to 240 M yr(-1). The Lyman continuum photon Production rate of similar to 3% associated with the high-density H II regions implies a similar SFR at recent epochs (t < 10(5) yr). An alternative model of high-density gas, which cannot be excluded on the basis of the available data, predicts 10 times higher SFR at recent epochs. If confirmed, this model implies that star formation in Arp 220 consists of multiple starbursts of very high SFR (few times 10(3) M. yr(-1)) and short duration (similar to 10(5) yr). The similarity of IR excess, L-IR/L-Ly alpha similar to 24, in Arp 220 to values observed in starburst galaxies shows that most of the high luminosity of Arp 220 is due to the ongoing starburst rather than to a hidden active galactic nucleus (AGN). A comparison of the IR excesses in Arp 220, the Galaxy, and M33 indicates that the starburst in Arp 220 has an initial mass function that is similar to that in normal galaxies and has a duration longer than 107 yr. If there was no infall of gas during this period, then the star formation efficiency (SFE) in Arp 220 is similar to 50%. The high SFR and SFE in Arp 220 is consistent with their known dependences on mass and density of gas in star-forming regions of normal galaxies.

Optimal Receive Antenna Selection in Time-Varying Fading Channels with Practical Training Constraints

Hardware constraints, which motivate receive antenna selection, also require that various antenna elements at the receiver be sounded sequentially to obtain estimates required for selecting the `best' antenna and for coherently demodulating data thereafter. Consequently, the channel state information at different antennas is outdated by different amounts and corrupted by noise. We show that, for this reason, simply selecting the antenna with the highest estimated channel gain is not optimum. Rather, a preferable strategy is to linearly weight the channel estimates of different antennas differently, depending on the training scheme. We derive closed-form expressions for the symbol error probability (SEP) of AS for MPSK and MQAM in time-varying Rayleigh fading channels for arbitrary selection weights, and validate them with simulations. We then characterize explicitly the optimal selection weights that minimize the SEP. We also consider packet reception, in which multiple symbols of a packet are received by the same antenna. New suboptimal, but computationally efficient weighted selection schemes are proposed for reducing the packet error rate. The benefits of weighted selection are also demonstrated using a practical channel code used in third generation cellular systems. Our results show that optimal weighted selection yields a significant performance gain over conventional unweighted selection.

Minimizing buffer requirements under rate-optimal schedule in regular dataflow networks

Large-grain synchronous dataflow graphs or multi-rate graphs have the distinct feature that the nodes of the dataflow graph fire at different rates. Such multi-rate large-grain dataflow graphs have been widely regarded as a powerful programming model for DSP applications. In this paper we propose a method to minimize buffer storage requirement in constructing rate-optimal compile-time (MBRO) schedules for multi-rate dataflow graphs. We demonstrate that the constraints to minimize buffer storage while executing at the optimal computation rate (i.e. the maximum possible computation rate without storage constraints) can be formulated as a unified linear programming problem in our framework. A novel feature of our method is that in constructing the rate-optimal schedule, it directly minimizes the memory requirement by choosing the schedule time of nodes appropriately. Lastly, a new circular-arc interval graph coloring algorithm has been proposed to further reduce the memory requirement by allowing buffer sharing among the arcs of the multi-rate dataflow graph. We have constructed an experimental testbed which implements our MBRO scheduling algorithm as well as (i) the widely used periodic admissible parallel schedules (also known as block schedules) proposed by Lee and Messerschmitt (IEEE Transactions on Computers, vol. 36, no. 1, 1987, pp. 24-35), (ii) the optimal scheduling buffer allocation (OSBA) algorithm of Ning and Gao (Conference Record of the Twentieth Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, Charleston, SC, Jan. 10-13, 1993, pp. 29-42), and (iii) the multi-rate software pipelining (MRSP) algorithm (Govindarajan and Gao, in Proceedings of the 1993 International Conference on Application Specific Array Processors, Venice, Italy, Oct. 25-27, 1993, pp. 77-88). Schedules generated for a number of random dataflow graphs and for a set of DSP application programs using the different scheduling methods are compared. The experimental results have demonstrated a significant improvement (10-20%) in buffer requirements for the MBRO schedules compared to the schedules generated by the other three methods, without sacrificing the computation rate. The MBRO method also gives a 20% average improvement in computation rate compared to Lee's Block scheduling method.

New Insights into Optimal Discrete Rate Adaptation for Average Power Constrained Single and Multi-Node Systems

The throughput-optimal discrete-rate adaptation policy, when nodes are subject to constraints on the average power and bit error rate, is governed by a power control parameter, for which a closed-form characterization has remained an open problem. The parameter is essential in determining the rate adaptation thresholds and the transmit rate and power at any time, and ensuring adherence to the power constraint. We derive novel insightful bounds and approximations that characterize the power control parameter and the throughput in closed-form. The results are comprehensive as they apply to the general class of Nakagami-m (m >= 1) fading channels, which includes Rayleigh fading, uncoded and coded modulation, and single and multi-node systems with selection. The results are appealing as they are provably tight in the asymptotic large average power regime, and are designed and verified to be accurate even for smaller average powers.