Operations Research, Systems Engineering and Industrial Engineering Commons^™

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

Theses and Dissertations--Mechanical and Aerospace 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 …

Pharmaceutical Scheduling Using Simulated Annealing And Steepest Descent Method, Bryant Jamison Spencer

Graduate Theses, Dissertations, and Problem Reports (ETD)

In the pharmaceutical manufacturing world, a deadline could be the difference between losing a multimillion-dollar contract or extending it. This, among many other reasons, is why good scheduling methods are vital. This problem report addresses Flexible Flowshop (FF) scheduling using Simulated Annealing (SA) in conjunction with the Steepest Descent heuristic (SD).

FF is a generalized version of the flowshop problem, where each product goes through S number of stages, where each stage has M number of machines. As opposed to a normal flowshop problem, all ‘jobs’ do not have to flow in the same sequence from stage to stage. The …

Sky Surveys Scheduling Using Reinforcement Learning, Andres Felipe Alba Hernandez

Graduate Research Theses & Dissertations

Modern cosmic sky surveys (e.g., CMB S4, DES, LSST) collect a complex diversity of astronomical objects. Each of class of objects presents different requirements for observation time and sensitivity. For determining the best sequence of exposures for mapping the sky systematically, conventional scheduling methods do not optimize the use of survey time and resources. Dynamic sky survey scheduling is an NP-hard problem that has been therefore treated primarily with heuristic methods. We present an alternative scheduling method based on reinforcement learning (RL) that aims to optimize the use of telescope resources for scheduling sky surveys.

We present an exploration of …

Minimizing Total Number Of Tardy Jobs In Parallel Batch Processing Machines Using Column Generation And Simulated Annealing, Sameer Neupane

Graduate Research Theses & Dissertations

This research considers a scheduling problem where jobs need to be grouped into batches and the batches need to be scheduled on parallel batch processing machines with an objective to minimize the total number of tardy jobs. The jobs are assigned to batches in such a way that machine capacity is not violated. This research considers jobs with unequal ready times, unequal processing times and unequal sizes. The machines are identical in processing capabilities; however, their capacities are different. This research aims to develop effective solution approaches to solve the problem under study. A Mixed Integer Linear Programming (MILP) model …

Methods To Support The Project Selection Problem With Non-Linear Portfolio Objectives, Time Sensitive Objectives, Time Sensitive Resource Constraints, And Modeling Inadequacies, Neil C. Ranly

Theses and Dissertations

The United States Air Force relies upon information production activities to gain insight regarding uncertainties affecting important system configuration and in-mission task execution decisions. Constrained resources that prevent the fulfillment of every information production request, multiple information requestors holding different temporal-sensitive objectives, non-constant marginal value preferences, and information-product aging factors that affect the value-of-information complicate the management of these activities. This dissertation reviews project selection research related to these issues and presents novel methods to address these complications. Quantitative experimentation results demonstrate these methods’ significance.

The Developmental Test Scheduling Problem, Joseph E. Schoenbeck

Theses and Dissertations

Developmental testing of aircraft systems in the United States Air Force requires a complex set of resources for each test. The optimal scheduling of those resources is the job of the 412th Test Wing at Edwards Air Force Base. With more than 20 different Combined Task Forces requesting resources for roughly 300 flying missions each week, manual scheduling is a difficult task. The current process takes a team of schedulers several days to get a workable result from which they can start tailoring the final schedule. While concepts and techniques can be taken from industry scheduling problems, the body of …

Methodologies For Solving Integrated Transportation And Scheduling Problems, Fereydoun Adbesh

Graduate Theses and Dissertations

This research proposes novel solution techniques to optimize two real-world problems in the area of scheduling and transportation. We first consider a model for optimizing the operations of dredges. In this problem, scheduling and assignment decisions are integrated across a finite planning horizon. Additional constraints and problem elements explicitly considered include, but are not limited, to environmental work window restrictions, budget limitations, dredge operation rates and schedule-dependent dredge availability. Our approach makes use of Constraint Programming (CP) to obtain quality and robust solutions within an amount of time small enough to be useful to practitioners. The expanded feature set of …

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 …

Decision Support Models For A Few Critical Problems In Transportation System Design And Operations, Ran Zhang

USF Tampa Graduate Theses and Dissertations

Transportation system is one of the key functioning components of the modern society and plays an important role in the circulation of commodity and growth of economy. Transportation system is not only the major influencing factor of the efficiency of large-scale complex industrial logistics, but also closely related to everyone’s daily life. The goals of an ideal transportation system are focused on improving mobility, accessibility, safety, enhancing the coordination of different transportation modals and reducing the impact on the environment, all these activities require sophisticated design and plan that consider different factors, balance tradeoffs and maintaining efficiency. Hence, the design …

Comparing Critical Chain Project Managemenet With Critical Path Method: A Case Study, Behzad Montazeri

Masters Theses & Specialist Projects

Scheduling is a major task in project management. The current scheduling technique, Critical Path Method (CPM), has been widely applied for several decades, but a large number of projects fail to be completed on time and schedule delays occur in many projects. This raises question about the validity of the current project scheduling system. Critical Chain Project Management (CCPM), derived from Theory of Constraints, is a relatively new alternative approach toward scheduling projects. This study compared CCPM and CPM to determine which scheduling method delivers a shorter project duration and has a better usage of resources. A scheduling software called …

Scheduling Strategies For Construction Project Managers Toward On Time Delivery, Paul Shamp

Walden Dissertations and Doctoral Studies

Construction management projects involve complex, dynamic environments resulting in uncertainty and risk, compounded by demanding time constraints. Research indicated project managers have struggled to identify best practices for scheduling construction projects via critical path methodologies while searching for tools to increase timely job completions and budget profits. The purpose of this single case study was to explore the strategies that construction project managers used to manage scheduled construction project delivery on time. The constructivist philosophical worldview was used as the framework for this study. Data were collected from semistructured interviews from 7 project managers from 5 different construction companies selected …

Orienteering Problem: A Survey Of Recent Variants, Solution Approaches And Applications, Aldy Gunawan, Hoong Chuin Lau, Pieter Vansteenwegen

Research Collection School Of Computing and Information Systems

Duplicate record, see https://ink.library.smu.edu.sg/sis_research/3271. The Orienteering Problem (OP) has received a lot of attention in the past few decades. The OP is a routing problem in which the goal is to determine a subset of nodes to visit, and in which order, so that the total collected score is maximized and a given time budget is not exceeded. A number of typical variants has been studied, such as the Team OP, the (Team) OP with Time Windows and the Time Dependent OP. Recently, a number of new variants of the OP was introduced, such as the Stochastic OP, the …

Orienteering Problem: A Survey Of Recent Variants, Solution Approaches And Applications, Aldy Gunawan, Hoong Chuin Lau, Pieter Vansteenwegen

Research Collection School Of Computing and Information Systems

The Orienteering Problem (OP) has received a lot of attention in the past few decades. The OP is a routing problem in which the goal is to determine a subset of nodes to visit, and in which order, so that the total collected score is maximized and a given time budget is not exceeded. A number of typical variants has been studied, such as the Team OP, the (Team) OP with Time Windows and the Time Dependent OP. Recently, a number of new variants of the OP was introduced, such as the Stochastic OP, the Generalized OP, the Arc OP, …

Strategic Planning For Setting Up Base Stations In Emergency Medical Systems, Supriyo Ghosh, Pradeep Varakantham

Research Collection School Of Computing and Information Systems

Emergency Medical Systems (EMSs) are an important component of public health-care services. Improving infrastructure for EMS and specifically the construction of base stations at the ”right” locations to reduce response times is the main focus of this paper. This is a computationally challenging task because of the: (a) exponentially large action space arising from having to consider combinations of potential base locations, which themselves can be significant; and (b) direct impact on the performance of the ambulance allocation problem, where we decide allocation of ambulances to bases. We present an incremental greedy approach to discover the placement of bases that …

Dual Formulations For Optimizing Dec-Pomdp Controllers, Akshat Kumar, Hala Mostafa, Shlomo Zilberstein

Research Collection School Of Computing and Information Systems

Decentralized POMDP is an expressive model for multi-agent planning. Finite-state controllers (FSCs)---often used to represent policies for infinite-horizon problems---offer a compact, simple-to-execute policy representation. We exploit novel connections between optimizing decentralized FSCs and the dual linear program for MDPs. Consequently, we describe a dual mixed integer linear program (MIP) for optimizing deterministic FSCs. We exploit the Dec-POMDP structure to devise a compact MIP and formulate constraints that result in policies executable in partially-observable decentralized settings. We show analytically that the dual formulation can also be exploited within the expectation maximization (EM) framework to optimize stochastic FSCs. The resulting EM algorithm …

Sortie Generation Simulation Of A Fighter Squadron, Abdurrahman Sevimli

Theses and Dissertations

The Turkish Air Force utilizes several fighter squadrons to enhance its military capabilities. One of the most critical challenges for these squadrons is generating sorties to meet the currency and demand during both peacetime and wartime. This sortie generation process directly affects the success of both training and operations. In this study, this process is assessed using a discrete event simulation. Air Force decision makers require a simulation tool to conduct “what-if” analysis on how potential changes in the environment affect an F-16 fighter squadron’s sortie generation process. Creating a usable simulation provides decision makers with a flexible tool to …

Increased Capacity Utilizing Aggregation And Consolidation Of Contingency Cargo, Cassidy L. Wilson

Theses and Dissertations

Maximizing use of limited airlift assets is a common problem during large contingency operations. Requirements often exceed airlift capacity and fiscal constraints driving the need to aggregate conveyance loads both within and across business lines (Unit Line Number (ULN), Special Assignment Airlift Mission (SAAM), and sustainment). Current methods of consolidation are completed by planners at the 618th Air Operations Center. This process is completed by piecing email correspondence and making individual localized decisions which are not always consistent with big picture efficiency. United States Transportation Command requested a study to create standard business rules or a methodology that can benefit …

Large-Scale Solution Approaches For Healthcare And Supply Chain Scheduling, Ridvan Gedik

Graduate Theses and Dissertations

This research proposes novel solution techniques for two real world problems. We first consider a patient scheduling problem in a proton therapy facility with deterministic patient arrivals. In order to assess the impacts of several operational constraints, we propose single and multi-criteria linear programming models. In addition, we ensure that the strategic patient mix restrictions predetermined by the decision makers are also enforced within the planning horizon. We study the mathematical structures of the single criteria model with strict patient mix restrictions and derive analytical equations for the optimal solutions under several operational restrictions. These efforts lead to a set …

A Set Union Based Formulation For Course Scheduling And Timetabling, Jesse Paul Bukenberger

Master's Theses

The Course Timetabling Problem is a widely studied optimization problem where a number of sections are scheduled in concert with the assignment of students to sections in order to maximize the desirability of the resulting schedule for all stakeholders. This problem is commonly solved as a linear program with variables for each student or group of students with identical schedules. In this paper we explore an alternative formulation that aggregates binary student variables into integer variables denoting the number of students enrolled in a course. Our solution method assumes decomposition of the general schedule into time blocks, and applies a …

Scheduling And Resource Allocation In Wireless Sensor Networks, Yosef Alayev

Dissertations, Theses, and Capstone Projects

In computer science and telecommunications, wireless sensor networks are an active research area. Each sensor in a wireless sensor network has some pre-defined or on demand tasks such as collecting or disseminating data. Network resources, such as broadcast channels, number of sensors, power, battery life, etc., are limited. Hence, a schedule is required to optimally allocate network resources so as to maximize some profit or minimize some cost. This thesis focuses on scheduling problems in the wireless sensor networks environment. In particular, we study three scheduling problems in the wireless sensor networks: broadcast scheduling, sensor scheduling for area monitoring, and …

Algorithmic And Mathematical Programming Approaches To Scheduling Problems With Energy-Based Objectives, Kan Fang

Open Access Dissertations

This dissertation studies scheduling as a means to address the increasing concerns related to energy consumption and electricity cost in manufacturing enterprises. Two classes of problems are considered in this dissertation: (i) minimizing the makespan in a permutation flow shop with peak power consumption constraints (the PFSPP problem for short) and (ii) minimizing the total electricity cost on a single machine under time-of-use tariffs (the SMSEC problem for short). We incorporate the technology of dynamic speed scaling and the variable pricing of electricity into these scheduling problems to improve energy efficiency in manufacturing.The challenge in the PFSPP problem is to …

Improved Photolithography Scheduling In Semiconductor Manufacturing, Sreenath Chalil Madathil

All Theses

Photolithography is typically the bottleneck process in semiconductor manufacturing. In this thesis, we present a model for optimizing photolithography job scheduling in the presence of both individual and cluster tools. The combination of individual and cluster tools that process various layers or stages of the semiconductor manufacturing process flow is a special type of flexible flowshop. We seek separately to minimize total weighted completion time and maximize on-time delivery performance. Experimental results suggest that our mathematical- and heuristic-based solution approaches show promise for real world implementation as they can help to improve resource utilization, reduce job completion times, and decrease …

An Optimization Model For Class Scheduling At A Dance Studio, Chirag Ojha

All Theses

Scheduling has been a large area of research for decades. A substantial amount of work has been done to express, classify, and solve scheduling problems. Most of these problems are computationally difficult to solve and require complex algorithms. In this thesis, we develop a mixed-integer linear program for a real world optimization problem at a dance studio. Similar to a university, the students in this studio request a particular class and instructors teach the classes under constrained resources such as a limited number of classrooms. The priorities of instructors as well as dancers are included to further mimic reality. Experimental …

Master Physician Scheduling Problem, Aldy Gunawan, Hoong Chuin Lau

Research Collection School Of Computing and Information Systems

We study a real-world problem arising from the operations of a hospital service provider, which we term the master physician scheduling problem. It is a planning problem of assigning physicians’ full range of day-to-day duties (including surgery, clinics, scopes, calls, administration) to the defined time slots/shifts over a time horizon, incorporating a large number of constraints and complex physician preferences. The goals are to satisfy as many physicians’ preferences and duty requirements as possible while ensuring optimum usage of available resources. We propose mathematical programming models that represent different variants of this problem. The models were tested on a real …

Vehicle Minimization For The Multimodal Pickup And Delivery Problem With Time Windows, Benjamin A . Clapp

Theses and Dissertations

The algorithm proposed here is used for heuristic solutions for the Multimodal Multiple Vehicle Routing Problem with Unloading Capacity, Pickup and Dropoff, and Time Windows, solved so as to minimize the number of vehicles used, subject to varying objective function values for each vehicle. The MVRP is simplified and split into a routing problem and a scheduling problem. The routing problem is addressed by Dijkstra's Algorithm. This generates a new network for the second stage of the algorithm. It is assumed that the shortest path is the correct path to use, and shipments each travel unimodally. The scheduling problem is …

Meta-Heuristics Analysis For Technologically Complex Programs: Understanding The Impact Of Total Constraints For Schedule, Quality And Cost, Henry Darrel Webb

EMSE Doctoral Projects

Program management data associated with a technically complex radio frequency electronics base communication system has been collected and analyzed to identify heuristics which may be utilized in addition to existing processes and procedures to provide indicators that a program is trending to failure. Analysis of the collected data includes detailed schedule analysis, detailed earned value management analysis and defect analysis within the framework of a Firm Fixed Price (FFP) incentive fee contract.

This project develops heuristics and provides recommendations for analysis of complex project management efforts such as those discussed herein. The analysis of the effects of the constraints on …

A New Metaheuristic Algorithm Motivated By The Rooting Phenomena In Plants, Behzad Nemati

All Theses

In this thesis, we present a new metaheuristic algorithm for analyzing challenging optimization problems. Initial testing reveals the potential for the algorithm, which is based on the rooting phenomena found in plants in nature, to quickly produce effective solutions to challenging combinatorial optimization problems in the class NP. We present computational results describing the proposed metaheuristic's efficacy for an important class of scheduling problems and discuss areas of future work and application.

Implementation Of Evolutionary Algorithms On The Power Industry And Aviation Security, Anuar Jesus Aguirre

Open Access Theses & Dissertations

The main objective of the power electric power grid is to supply reliable electricity to all the customers. Customers could be industrial, commercial, household, transportation and others. The power grid is a complex and large, and it formed by the conjunction of the generation, transmission and distribution system. The present research is focused in power distribution system. A new component replacement analysis method to solve component replacement problems for complex electricity distribution systems using Genetic Algorithms is developed. In the present model a Taylor series expansion is used to approximate the associated opportunity cost for each component in the system. …

Robust Distributed Scheduling Via Time Period Aggregation, Shih-Fen Cheng, John Tajan, Hoong Chuin Lau

Research Collection School Of Computing and Information Systems

In this paper, we evaluate whether the robustness of a market mechanism that allocates complementary resources could be improved through the aggregation of time periods in which resources are consumed. In particular, we study a multi-round combinatorial auction that is built on a general equilibrium framework. We adopt the general equilibrium framework and the particular combinatorial auction design from the literature, and we investigate the benefits and the limitation of time-period aggregation when demand-side uncertainties are introduced. By using simulation experiments on a real-life resource allocation problem from a container port, we show that, under stochastic conditions, the performance variation …

Finding Robust-Under-Risk Solutions For Flowshop Scheduling, Steven O. Kimbrough, Ann Kuo, Hoong Chuin Lau

Research Collection School Of Computing and Information Systems

We propose and explore, in the context of benchmark problems for flowshop scheduling, a risk-based concept of robustness for optimization problems. This risk-based concept is in distinction to, and complements, the uncertainty-based concept employed in the field known as robust optimization. Implementation of our concept requires problem solution methods that sample the solution space intelligently and that produce large numbers of distinct sample points. With these solutions to hand, their robustness scores are easily obtained and heuristically robust solutions found. We find evolutionary computation to be effective for this purpose on these problems.