Reducing clinical workload in the care prescription process: Optimization of order sets

Order sets are a critical component in hospital information systems, designed to substantially reduce clinician workload and improve patient safety and health outcomes. Order sets represent clusters of order items, such as medications prescribed at hospital admission, that are administered to patients during their hospital stay. In prior research, we constructed order sets for defined time intervals during inpatient stay based on historical data on items ordered by clinicians across a large number of patients. In this study, we build on our prior work to formulate a mathematical program for optimizing order sets that are applicable across the entire duration of inpatient stay and are independent of the time intervals. Furthermore, due to the intractability of the problem, we develop a Greedy algorithm to tackle real-world test instances. We extract data sets for three clinical scenarios and conduct both cognitive and physical workload analyses. Finally, we extend a software application to facilitate the comparison of order sets by practitioners. Our computational results reveal that the optimization-based physical and cognitive workload models can solve small test instances to optimality. However, for real-world instances, the Greedy heuristic is more competitive, in particular when physical workload instead of cognitive workload is the optimization objective. Overall, the Greedy heuristic can solve the test instances within one minute and outperforms the mathematical program in 2/3 of the test instances within a time limit of ten minutes, demonstrating a feasible and promising approach to develop inpatient order sets that can subsequently be validated by clinical experts

Reducing clinical workload in the care prescription process: optimization of order sets

Order sets are a critical component in hospital information systems, designed to substantially reduce clinician workload and improve patient safety and health outcomes. Order sets represent clusters of order items, such as medications prescribed at hospital admission, that are administered to patients during their hospital stay. In prior research, we constructed order sets for defined time intervals during inpatient stay based on historical data on items ordered by clinicians across a large number of patients. In this study, we build on our prior work to formulate a mathematical program for optimizing order sets that are applicable across the entire duration of inpatient stay and are independent of the time intervals. Furthermore, due to the intractability of the problem, we develop a Greedy algorithm to tackle real-world test instances. We extract data sets for three clinical scenarios and conduct both cognitive and physical workload analyses. Finally, we extend a software application to facilitate the comparison of order sets by practitioners. Our computational results reveal that the optimization-based physical and cognitive workload models can solve small test instances to optimality. However, for real-world instances, the Greedy heuristic is more competitive, in particular when physical workload instead of cognitive workload is the optimization objective. Overall, the Greedy heuristic can solve the test instances within one minute and outperforms the mathematical program in 2/3 of the test instances within a time limit of ten minutes, demonstrating a feasible and promising approach to develop inpatient order sets that can subsequently be validated by clinical experts