Date of Graduation

8-2014

Document Type

Dissertation

Degree Name

Doctor of Philosophy in Engineering (PhD)

Degree Level

Graduate

Department

Industrial Engineering

Advisor/Mentor

Rainwater, Chase E.

Committee Member

Romeijn, Edwin

Second Committee Member

Rardin, Ronald L.

Third Committee Member

Zhang, Shengfan

Keywords

Constraint Programming; Efficient Frontier; Healthcare; Logic-based Benders; Scheduling; Supply Chain

Abstract

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 of rule of thumbs that can be utilized to assess the impacts of several input parameters and patient mix levels on the capacity utilization without solving optimization problems. The necessary and sufficient conditions to analytically generate exact efficient frontiers of the bicriteria problem without any additional side constraint are also explored. In a follow up study, we investigate the solution techniques for the same patient scheduling problem with stochastic patient arrivals. We propose two Markov Decision Process (MDP) models that are capable of tackling the stochasticity.

The second problem of interest is a variant of the parallel machine scheduling problem. We propose constraint programming (CP) and logic-based Benders decomposition algorithms in order to make the best decisions for scheduling nonidentical jobs with time windows and sequence dependent setup times on dissimilar parallel machines in a fixed planning horizon. This problem is formulated with (i) maximizing total profit and (ii) minimizing makespan objectives. We conduct several sensitivity analysis to test the quality and robustness of the solutions on a real life case study.

Download

Share

COinS