Open Access. Powered by Scholars. Published by Universities.®
Operations Research, Systems Engineering and Industrial Engineering Commons™
Open Access. Powered by Scholars. Published by Universities.®
Articles 1 - 3 of 3
Full-Text Articles in Operations Research, Systems Engineering and Industrial 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 …
Metaheuristics For Hub Location Models, Ornurai Sangsawang
Metaheuristics For Hub Location Models, Ornurai Sangsawang
All Dissertations
In this research, we propose metaheuristics for solving two p-hub median problems.. The first p-hub median problem, which is NP-hard, is the uncapacitated single p-hub median problem (USApHMP). In this problem, metaheuristics such as genetic algorithms, simulated annealing and tabu search, are applied in different types of representations. Caching is also
applied to speed up computational time of the algorithms. The results clearly demonstrate that tabu search with a permutation solution representation, augmented with caching is the highest performing method, both in terms of solution quality and computational time among these algorithms for the USApHMP. We also investigate the performance …