This decommissioned ERA site remains active temporarily to support our final migration steps to https://ualberta.scholaris.ca, ERA's new home. All new collections and items, including Spring 2025 theses, are at that site. For assistance, please contact erahelp@ualberta.ca.
Search
Skip to Search Results
Filter
Author / Creator / Contributor
Supervisors
Subject / Keyword
Year
Collections
Languages
Item type
Departments
-
Fall 2017
In this thesis, we consider scheduling problems in which jobs need to be processed through a (shared) network of machines according to their given paths. Formally, we are given a graph $G(V, E)$ where the edges $E$ represent the machines. We are also given a set of jobs $J$ and a path of edges...
1 - 1 of 1