Open Access. Powered by Scholars. Published by Universities.®
Articles 1 - 3 of 3
Full-Text Articles in Engineering
An Optimization Model For Class Scheduling At A Dance Studio, Chirag Ojha
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 …
Improved Photolithography Scheduling In Semiconductor Manufacturing, Sreenath Chalil Madathil
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 …
A New Metaheuristic Algorithm Motivated By The Rooting Phenomena In Plants, Behzad Nemati
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.