Open Access. Powered by Scholars. Published by Universities.®
- Discipline
Articles 1 - 7 of 7
Full-Text Articles in Entire DC Network
Scheduling Control For Many-Server Queues When Customers Change Class, Mary Elizabeth Saine
Scheduling Control For Many-Server Queues When Customers Change Class, Mary Elizabeth Saine
All Theses
We consider a two class, many-server queueing system which allows for customer abandonment and class changes. With the objective to minimize the long-run average holding cost, we formulate a stochastic queueing control problem. Instead of solving this directly, we apply a fluid scaling to obtain a deterministic counterpart to the problem. By considering the equilibrium of the deterministic solution, we can solve the resulting control problem, referred to as the equilibrium control problem (ECP), and use the solution to propose a priority policy for the original stochastic queueing system. We prove that in an overloaded system, under a fluid scaling, …
Co-Design Of Dynamic Real-Time Scheduling And Cooperative Control For Human-Agent Collaboration Systems Based On Mutual Trust, Xiaotian Wang
Co-Design Of Dynamic Real-Time Scheduling And Cooperative Control For Human-Agent Collaboration Systems Based On Mutual Trust, Xiaotian Wang
All Theses
Mutual trust is a key factor in human-human collaboration. Inspired by this social interaction, we analyze human-agent mutual trust in the collaboration of one human and (semi)autonomous multi-agent systems. In the thesis, we derive time-series human-agent mutual trust models based on results from human factors engineering. To avoid both over- trust and under-trust, we set up dynamic timing models for the multi-agent scheduling problem and develop necessary and sufficient conditions to test the schedulability of the human multi-agent collaborative task. Furthermore, we extend the collaboration between one human and multiple agents into the collaboration between multi-human network and swarm-based agents …
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 …
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 …
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.
A Ptas For The Uncertain Capacity Knapsack Problem, Matthew Dabney
A Ptas For The Uncertain Capacity Knapsack Problem, Matthew Dabney
All Theses
The standard NP-hard knapsack problem can be interpreted as a scheduling problem with n jobs with weights w1 . . .wn and processing times p1 . . . pn, where our goal is to order the jobs on a single machine so as to maximize the weight of all jobs completing prior to a known common deadline d. In this paper, we study the uncertain capacity knapsack problem (UCKP), a generalization of this problem in which the deadline d is not known with certainty, but rather is provided as a probability distribution, and our goal …
The Steiner Linear Ordering Problem: Application To Resource-Constrained Scheduling Problems, Mariah Magagnotti
The Steiner Linear Ordering Problem: Application To Resource-Constrained Scheduling Problems, Mariah Magagnotti
All Theses
When examined through polyhedral study, the resource-constrained scheduling problems have always dealt with processes which have the same priority. With the Steiner Linear Ordering problem, we can address systems where the elements involved have different levels of priority, either high or low. This allows us greater flexibility in modeling different resource-constrained scheduling problems. In this paper, we address both the linear ordering problem and its application to scheduling problems, and provide a polyhedral study of the associated polytopes.