Stochastic programming for outpatient scheduling with flexible inpatient exam accommodation.

This study is concerned with the determination of an optimal appointment schedule in an outpatient-inpatient hospital system where the inpatient exams can be cancelled based on certain rules while the outpatient exams cannot be cancelled. Stochastic programming models were formulated and solved to tackle the stochasticity in the procedure durations and patient arrival patterns. The first model, a two-stage stochastic programming model, is formulated to optimize the slot size.

Identifying Areas for Operational Improvement and Growth in IR Workflow Using Workflow Modeling, Simulation, and Optimization Techniques.

Identifying areas for workflow improvement and growth is essential for an interventional radiology (IR) department to stay competitive. Deployment of traditional methods such as Lean and Six Sigma helped in reducing the waste in workflows at a strategic level. However, achieving efficient workflow needs both strategic and tactical approaches.

Automated Tracking of Follow-Up Imaging Recommendations.

Radiology reports often contain follow-up imaging recommendations. Failure to comply with these recommendations in a timely manner can lead to poor patient outcomes, complications, and legal liability. As such, the primary objective of this research was to determine adherence rates to follow-up recommendations.

Probabilistic Modeling of Exam Durations in Radiology Procedures.

In this paper, we model the statistical properties of imaging exam durations using parametric probability distributions such as the Gaussian, Gamma, Weibull, lognormal, and log-logistic. We establish that in a majority of radiology procedures, the underlying distribution of exam durations is best modeled by a log-logistic distribution, while the Gaussian has the poorest fit among the candidates. Further, through illustrative examples, we show how business insights and workflow analytics can be significantly impacted by making the correct (log-logistic) versus incorrect (Gaussian) model choices.

Near linear time algorithm to detect community structures in large-scale networks.

Community detection and analysis is an important methodology for understanding the organization of various real-world networks and has applications in problems as diverse as consensus formation in social communities or the identification of functional modules in biochemical networks. Currently used algorithms that identify the community structures in large-scale real-world networks require a priori information such as the number and sizes of communities or are computationally expensive. In this paper we investigate a simple label propagation algorithm that uses the network structure alone as its guide and requires neither optimization of a predefined objective function nor prior information about the communities.