Open Access. Powered by Scholars. Published by Universities.®
Articles 1 - 3 of 3
Full-Text Articles in Engineering
Large-Scale Solution Approaches For Healthcare And Supply Chain Scheduling, Ridvan Gedik
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 …
Optimizing Boat Hull And Deck Mold Storage Scheduling With Linear Programming, Tron Bjorn Dareing
Optimizing Boat Hull And Deck Mold Storage Scheduling With Linear Programming, Tron Bjorn Dareing
Masters Theses
With a wide range of products, Sea Ray uses a vast amount of large boat molds for each of the different boat models. Storing and transporting these molds can be an issue with introducing high variability in the production process. One of the largest problems deals with the utilization of the employees’ time with the large amount of boat production. Having the boat molds being ready for production is a critical part of the manufacturing of quality boats. There is non-value added time spent on preparing the molds for the lamination process and storing them in various areas. This problem …
A Set Union Based Formulation For Course Scheduling And Timetabling, Jesse Paul Bukenberger
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 …