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.

Metaheuristics for minimizing the makespan of the dynamic shop scheduling problem

For the shop scheduling problems such as flow-shop, job-shop, open-shop, mixed-shop, and group-shop, most research focuses on optimizing the makespan under static conditions and does not take into consideration dynamic disturbances such as machine breakdown and new job arrivals. We regard the shop scheduling problem under static conditions as the static shop scheduling problem, while the shop scheduling problem with dynamic disturbances as the dynamic shop scheduling problem. In this paper, we analyze the characteristics of the dynamic shop scheduling problem when machine breakdown and new job arrivals occur, and present a framework to model the dynamic shop scheduling problem as a static group-shop-type scheduling problem. Using the proposed framework, we apply a metaheuristic proposed for solving the static shop scheduling problem to a number of dynamic shop scheduling benchmark problems. The results show that the metaheuristic methodology which has been successfully applied to the static shop scheduling problems can also be applied to solve the dynamic shop scheduling problem efficiently.

A fast tabu search algorithm for the group shop scheduling problem

Three types of shop scheduling problems, the flow shop, the job shop and the open shop scheduling problems, have been widely studied in the literature. However, very few articles address the group shop scheduling problem introduced in 1997, which is a general formulation that covers the three above mentioned shop scheduling problems and the mixed shop scheduling problem. In this paper, we apply tabu search to the group shop scheduling problem and evaluate the performance of the algorithm on a set of benchmark problems. The computational results show that our tabu search algorithm is typically more efficient and faster than the other methods proposed in the literature. Furthermore, the proposed tabu search method has found some new best solutions of the benchmark instances.

Metaheuristics for the mixed shop scheduling problem

In this paper, three metaheuristics are proposed for solving a class of job shop, open shop, and mixed shop scheduling problems. We evaluate the performance of the proposed algorithms by means of a set of Lawrence’s benchmark instances for the job shop problem, a set of randomly generated instances for the open shop problem, and a combined job shop and open shop test data for the mixed shop problem. The computational results show that the proposed algorithms perform extremely well on all these three types of shop scheduling problems. The results also reveal that the mixed shop problem is relatively easier to solve than the job shop problem due to the fact that the scheduling procedure becomes more flexible by the inclusion of more open shop jobs in the mixed shop.

A comparative study of algorithms for the flowshop scheduling problem

In this paper, we propose three meta-heuristic algorithms for the permutation flowshop (PFS) and the general flowshop (GFS) problems. Two different neighborhood structures are used for these two types of flowshop problem. For the PFS problem, an insertion neighborhood structure is used, while for the GFS problem, a critical-path neighborhood structure is adopted. To evaluate the performance of the proposed algorithms, two sets of problem instances are tested against the algorithms for both types of flowshop problems. The computational results show that the proposed meta-heuristic algorithms with insertion neighborhood for the PFS problem perform slightly better than the corresponding algorithms with critical-path neighborhood for the GFS problem. But in terms of computation time, the GFS algorithms are faster than the corresponding PFS algorithms.

The effect of emotional and attentional load on attentional startle modulation

The interactive effects of emotion and attention on attentional startle modulation were investigated in two experiments. Participants performed a discrimination and counting task with two visual stimuli during which acoustic eyeblink startle-eliciting probes were presented at long lead intervals. In Experiment 1, this task was combined with aversive Pavlovian conditioning. In Group Attend CS+, the attended stimulus was followed by an aversive unconditional stimulus (US) and the ignored stimulus was presented alone whereas the ignored stimulus was paired with the US in Group Attend CS−. In Experiment 2, a non-aversive reaction time task US replaced the aversive US. Regardless of the conditioning manipulation and consistent with a modality non-specific account of attentional startle modulation, startle magnitude was larger during attended than ignored stimuli in both experiments. Blink latency shortening was differentially affected by the conditioning manipulations suggesting additive effects of conditioning and discrimination and counting task on blink startle.

Using operations research methodologies to improve operating theatre scheduling

A hospital consists of a number of wards, units and departments that provide a variety of medical services and interact on a day-to-day basis. Nearly every department within a hospital schedules patients for the operating theatre (OT) and most wards receive patients from the OT following post-operative recovery. Because of the interrelationships between units, disruptions and cancellations within the OT can have a flow-on effect to the rest of the hospital. This often results in dissatisfied patients, nurses and doctors, escalating waiting lists, inefficient resource usage and undesirable waiting times. The objective of this study is to use Operational Research methodologies to enhance the performance of the operating theatre by improving elective patient planning using robust scheduling and improving the overall responsiveness to emergency patients by solving the disruption management and rescheduling problem. OT scheduling considers two types of patients: elective and emergency. Elective patients are selected from a waiting list and scheduled in advance based on resource availability and a set of objectives. This type of scheduling is referred to as ‘offline scheduling’. Disruptions to this schedule can occur for various reasons including variations in length of treatment, equipment restrictions or breakdown, unforeseen delays and the arrival of emergency patients, which may compete for resources. Emergency patients consist of acute patients requiring surgical intervention or in-patients whose conditions have deteriorated. These may or may not be urgent and are triaged accordingly. Most hospitals reserve theatres for emergency cases, but when these or other resources are unavailable, disruptions to the elective schedule result, such as delays in surgery start time, elective surgery cancellations or transfers to another institution. Scheduling of emergency patients and the handling of schedule disruptions is an ‘online’ process typically handled by OT staff. This means that decisions are made ‘on the spot’ in a ‘real-time’ environment. There are three key stages to this study: (1) Analyse the performance of the operating theatre department using simulation. Simulation is used as a decision support tool and involves changing system parameters and elective scheduling policies and observing the effect on the system’s performance measures; (2) Improve viability of elective schedules making offline schedules more robust to differences between expected treatment times and actual treatment times, using robust scheduling techniques. This will improve the access to care and the responsiveness to emergency patients; (3) Address the disruption management and rescheduling problem (which incorporates emergency arrivals) using innovative robust reactive scheduling techniques. The robust schedule will form the baseline schedule for the online robust reactive scheduling model.

Transit line passenger transmission and productiveness under high load conditions

Deterministic transit capacity analysis applies to planning, design and operational management of urban transit systems. The Transit Capacity and Quality of Service Manual (1) and Vuchic (2, 3) enable transit performance to be quantified and assessed using transit capacity and productive capacity. This paper further defines important productive performance measures of an individual transit service and transit line. Transit work (p-km) captures the transit task performed over distance. Passenger transmission (p-km/h) captures the passenger task delivered by service at speed. Transit productiveness (p-km/h) captures transit work performed over time. These measures are useful to operators in understanding their services’ or systems’ capabilities and passenger quality of service. This paper accounts for variability in utilized demand by passengers along a line and high passenger load conditions where passenger pass-up delay occurs. A hypothetical case study of an individual bus service’s operation demonstrates the usefulness of passenger transmission in comparing existing and growth scenarios. A hypothetical case study of a bus line’s operation during a peak hour window demonstrates the theory’s usefulness in examining the contribution of individual services to line productive performance. Scenarios may be assessed using this theory to benchmark or compare lines and segments, conditions, or consider improvements.

Transit line passenger transmission and productiveness under high load conditions : presentation

Transit Capacity Analysis critical to urban system Planning Design, Operation Productive Performance Analysis not so well detailed This study extends TRB’s & Vuchic’s work in this area

Numerical modelling of non-load bearing light gauge cold-formed steel frame walls under fire conditions

Recently an innovative composite panel system was developed, where a thin insulation layer was used externally between two plasterboards to improve the fire performance of light gauge cold-formed steel frame walls. In this research, finite-element thermal models of both the traditional light gauge cold-formed steel frame wall panels with cavity insulation and the new light gauge cold-formed steel frame composite wall panels were developed to simulate their thermal behaviour under standard and realistic fire conditions. Suitable apparent thermal properties of gypsum plasterboard, insulation materials and steel were proposed and used. The developed models were then validated by comparing their results with available fire test results. This article presents the details of the developed finite-element models of small-scale non-load-bearing light gauge cold-formed steel frame wall panels and the results of the thermal analysis. It has been shown that accurate finite-element models can be used to simulate the thermal behaviour of small-scale light gauge cold-formed steel frame walls with varying configurations of insulations and plasterboards. The numerical results show that the use of cavity insulation was detrimental to the fire rating of light gauge cold-formed steel frame walls, while the use of external insulation offered superior thermal protection to them. The effects of real fire conditions are also presented.

Human herpesvirus 8 load and progression of AIDS-related Kaposi sarcoma lesions

Introduction—Human herpesvirus 8 (HHV8) is necessary for Kaposi sarcoma (KS) to develop, but whether peripheral blood viral load is a marker of KS burden (total number of KS lesions), KS progression (the rate of eruption of new KS lesions), or both is unclear. We investigated these relationships in persons with AIDS. Methods—Newly diagnosed patients with AIDS-related KS attending Mulago Hospital, in Kampala, Uganda, were assessed for KS burden and progression by questionnaire and medical examination. Venous blood samples were taken for HHV8 load measurements by PCR. Associations were examined with odds ratio (OR) and 95% confidence intervals (CI) from logistic regression models and with t-tests. Results—Among 74 patients (59% men), median age was 34.5 years (interquartile range [IQR], 28.5-41). HHV8 DNA was detected in 93% and quantified in 77% patients. Median virus load was 3.8 logs10/106 peripheral blood cells (IQR 3.4-5.0) and was higher in men than women (4.4 vs. 3.8 logs; p=0.04), in patients with faster (>20 lesions per year) than slower rate of KS lesion eruption (4.5 vs. 3.6 logs; p<0.001), and higher, but not significantly, among patients with more (>median [20] KS lesions) than fewer KS lesions (4.4 vs. 4.0 logs; p=0.16). HHV8 load was unrelated to CD4 lymphocyte count (p=0.23). Conclusions—We show significant association of HHV8 load in peripheral blood with rate of eruption of KS lesions, but not with total lesion count. Our results suggest that viral load increases concurrently with development of new KS lesions.

Induction motor load impact on power system eigenvalue sensitivity analysis

Load modelling plays an important role in power system dynamic stability assessment. One of the widely used methods in assessing load model impact on system dynamic response is parametric sensitivity analysis. A composite load model-based load sensitivity analysis framework is proposed. It enables comprehensive investigation into load modelling impacts on system stability considering the dynamic interactions between load and system dynamics. The effect of the location of individual as well as patches of composite loads in the vicinity on the sensitivity of the oscillatory modes is investigated. The impact of load composition on the overall sensitivity of the load is also investigated.