Open Access. Powered by Scholars. Published by Universities.®
Articles 1 - 4 of 4
Full-Text Articles in Engineering
Essays On Perioperative Services Problems In Healthcare, Amogh S. Bhosekar
Essays On Perioperative Services Problems In Healthcare, Amogh S. Bhosekar
All Dissertations
One of the critical challenges in healthcare operations management is to efficiently utilize the expensive resources needed while maintaining the quality of care provided. Simulation and optimization methods can be effectively used to provide better healthcare services. This can be achieved by developing models to minimize patient waiting times, minimize healthcare supply chain and logistics costs, and maximize access. In this proposal, we study some of the important problems in healthcare operations management. More specifically, we focus on perioperative services and study scheduling of operating rooms (ORs) and management of necessary resources such as staff, equipment, and surgical instruments. We …
A Study Of Scheduling Problems With Sequence Dependent Restrictions And Preferences, Nitin Srinath
A Study Of Scheduling Problems With Sequence Dependent Restrictions And Preferences, Nitin Srinath
All Dissertations
In some applications like fabric dying, semiconductor wafer processing, and flexible manufacturing, the machines being used to process jobs must be set up and serviced frequently. These setup processes and associated setup times between jobs often depend on the jobs and the sequence in which jobs are placed onto machines. That is, the scheduling of jobs on machines must account for the sequence-dependent setup times as well. These setup times can be a major factor in operational costs. In fabric dyeing processes, the sequence in which jobs are processed is also important for quality, i.e., there is a strong preference …
The Traveling Salesman Problem: An Analysis And Comparison Of Metaheuristics And Algorithms, Mason Helmick
The Traveling Salesman Problem: An Analysis And Comparison Of Metaheuristics And Algorithms, Mason Helmick
Senior Honors Theses
One of the most investigated topics in operations research is the Traveling Salesman Problem (TSP) and the algorithms that can be used to solve it. Despite its relatively simple formulation, its computational difficulty keeps it and potential solution methods at the forefront of current research. This paper defines and analyzes numerous proposed solutions to the TSP in order to facilitate understanding of the problem. Additionally, the efficiencies of different heuristics are studied and compared to the aforementioned algorithms’ accuracy, as a quick algorithm is often formulated at the expense of an exact solution.
A Literature Review On Combining Heuristics And Exact Algorithms In Combinatorial Optimization, Hesamoddin Tahami, Hengameh Fakhravar
A Literature Review On Combining Heuristics And Exact Algorithms In Combinatorial Optimization, Hesamoddin Tahami, Hengameh Fakhravar
Engineering Management & Systems Engineering Faculty Publications
There are several approaches for solving hard optimization problems. Mathematical programming techniques such as (integer) linear programming-based methods and metaheuristic approaches are two extremely effective streams for combinatorial problems. Different research streams, more or less in isolation from one another, created these two. Only several years ago, many scholars noticed the advantages and enormous potential of building hybrids of combining mathematical programming methodologies and metaheuristics. In reality, many problems can be solved much better by exploiting synergies between these approaches than by “pure” classical algorithms. The key question is how to integrate mathematical programming methods and metaheuristics to achieve such …