Open Access. Powered by Scholars. Published by Universities.®

Digital Commons Network

Open Access. Powered by Scholars. Published by Universities.®

Articles 1 - 8 of 8

Full-Text Articles in Entire DC Network

Trade-Off Balancing For Stable And Sustainable Operating Room Scheduling, Amin Abedini Jan 2019

Trade-Off Balancing For Stable And Sustainable Operating Room Scheduling, Amin Abedini

Theses and Dissertations--Mechanical Engineering

The implementation of the mandatory alternative payment model (APM) guarantees savings for Medicare regardless of participant hospitals ability for reducing spending that shifts the cost minimization burden from insurers onto the hospital administrators. Surgical interventions account for more than 30% and 40% of hospitals total cost and total revenue, respectively, with a cost structure consisting of nearly 56% direct cost, thus, large cost reduction is possible through efficient operation management. However, optimizing operating rooms (ORs) schedules is extraordinarily challenging due to the complexities involved in the process. We present new algorithms and managerial guidelines to address the problem of OR …


Maximizing Operating Room Performance Using Portfolio Selection, Vivek Reddy Gunna, Amin Abedini, Wei Li Jul 2017

Maximizing Operating Room Performance Using Portfolio Selection, Vivek Reddy Gunna, Amin Abedini, Wei Li

Mechanical Engineering Faculty Publications

The operating room (OR) is responsible for most hospital admissions and is one of the most cost and work intensive areas in the hospital. From recent trends, we observe an ironic parallel increase among expenditure and waiting time. Therefore, improving OR scheduling has become obligatory, particularly in terms of patient flow and benefit. Most of the hospitals rely on average patient arrivals and processing times in OR planning. But in practice, variations in arrivals and processing times causes high instability in OR performance. Our model of optimization provides OR schedules maximizing patient flow and benefit at a fixed level of …


An Optimization Model For Operating Room Scheduling To Reduce Blocking Across The Perioperative Process, Amin Abedini, Wei Li, Honghan Ye Jul 2017

An Optimization Model For Operating Room Scheduling To Reduce Blocking Across The Perioperative Process, Amin Abedini, Wei Li, Honghan Ye

Mechanical Engineering Faculty Publications

Operating room (OR) scheduling is important. Because of increasing demand for surgical services, hospitals must provide high quality care more efficiently with limited resources. When constructing the OR schedule, it is necessary to consider the availability of downstream resources, such as intensive care unit (ICU) and post anaesthesia care unit (PACU). The unavailability of downstream resources causes blockings between every two consecutive stages. In this paper we address the master surgical schedule (MSS) problem in order to minimize blockings between two consecutive stages. First, we present a blocking minimization (BM) model for the MSS by using integer programming, based on …


Updating The Kentucky Contract Time Determination System, Timothy R. B. Taylor, Paul M. Goodrum, Michael Brockman, Barry Bishop, Yongwei Shan, Roy E. Sturgill, Kevin Hout Nov 2013

Updating The Kentucky Contract Time Determination System, Timothy R. B. Taylor, Paul M. Goodrum, Michael Brockman, Barry Bishop, Yongwei Shan, Roy E. Sturgill, Kevin Hout

Kentucky Transportation Center Research Report

The Federal Highway Administration requires State Transportation Agencies to have a formal method to estimate contract time for highway construction projects. To meet this requirement many states use an integrated scheduling system to estimate project durations based on assumed productivity rates and generic job logic. The current work investigated the accuracy of two of these systems found that both systems accuracy in predicting the duration of Kentucky Transportation Cabinet projects was greater than +200%. In response to this poor accuracy, a parametric project duration estimating tool was developed based on a multivariate regression analysis of bid item quantities and engineering …


Power-Efficient And Low-Latency Memory Access For Cmp Systems With Heterogeneous Scratchpad On-Chip Memory, Zhi Chen Jan 2013

Power-Efficient And Low-Latency Memory Access For Cmp Systems With Heterogeneous Scratchpad On-Chip Memory, Zhi Chen

Theses and Dissertations--Electrical and Computer Engineering

The gradually widening speed disparity of between CPU and memory has become an overwhelming bottleneck for the development of Chip Multiprocessor (CMP) systems. In addition, increasing penalties caused by frequent on-chip memory accesses have raised critical challenges in delivering high memory access performance with tight power and latency budgets. To overcome the daunting memory wall and energy wall issues, this thesis focuses on proposing a new heterogeneous scratchpad memory architecture which is configured from SRAM, MRAM, and Z-RAM. Based on this architecture, we propose two algorithms, a dynamic programming and a genetic algorithm, to perform data allocation to different memory …


An Algorithm To Solve The Associative Parallel Machine Scheduling Problem, Mohannad Abdelrahman Shuaib Jan 2009

An Algorithm To Solve The Associative Parallel Machine Scheduling Problem, Mohannad Abdelrahman Shuaib

University of Kentucky Master's Theses

Effective production scheduling is essential for improved performance. Scheduling strategies for various shop configurations and performance criteria have been widely studied. Scheduling in parallel machines (PM) is one among the many scheduling problems that has received considerable attention in the literature. An even more complex scheduling problem arises when there are several PM families and jobs are capable of being processed in more than one such family. This research addresses such a situation, which is defined as an Associative Parallel Machine scheduling (APMS) problem. This research presents the SAPT-II algorithm that solves a highly constrained APMS problem with the objective …


Dynamic Voltage Scaling For Priority-Driven Scheduled Distributed Real-Time Systems, Chenxing Wang Jan 2007

Dynamic Voltage Scaling For Priority-Driven Scheduled Distributed Real-Time Systems, Chenxing Wang

University of Kentucky Doctoral Dissertations

Energy consumption is increasingly affecting battery life and cooling for real- time systems. Dynamic Voltage and frequency Scaling (DVS) has been shown to substantially reduce the energy consumption of uniprocessor real-time systems. It is worthwhile to extend the efficient DVS scheduling algorithms to distributed system with dependent tasks. The dissertation describes how to extend several effective uniprocessor DVS schedul- ing algorithms to distributed system with dependent task set. Task assignment and deadline assignment heuristics are proposed and compared with existing heuristics concerning energy-conserving performance. An admission test and a deadline com- putation algorithm are presented in the dissertation for dynamic …


Development Of A Critical Path Method Specification And A Training Program For Use Of Cpm And Ktc, James D. Stevens, Donn E. Hancher, Ihab M. Hamdi Jun 1996

Development Of A Critical Path Method Specification And A Training Program For Use Of Cpm And Ktc, James D. Stevens, Donn E. Hancher, Ihab M. Hamdi

Kentucky Transportation Center Research Report

The Critical Path Method is a proven management technique used for determining the critical activities that would need additional care in any type of construction projects. The KTC requires that CPM schedules be used on selected highway projects. This research project offers a detailed idea on CPM scheduling application in highway construction projects, as well as current practices in other departments of transportation nationwide, together with specifications for proper application of CPM scheduling.