Low volume high value (LVHV) supply chains such as airline manufacturing, power plant construction, and shipbuilding are especially susceptible to risks. These industries are characterized by long lead times and a limited number of suppliers that have both the technical know-how and manufacturing capabilities to deliver the requisite goods and services. Disruptions within the supply chain are common and can cause significant and costly delays. Although supply chain risk management and supply chain reliability are topics that have been studied extensively, most research in these areas focus on high vol- ume supply chains and few studies proactively identify risks. In this research, we develop methodologies to proactively and quantitatively identify and mitigate supply chain risks within LVHV supply chains. First, we propose a framework to model the supply chain system using fault-tree analysis based on the bill of material of the product being sourced. Next, we put forward a set of mathematical optimization models to proactively identify, mitigate, and resource at-risk suppliers in a LVHV supply chain with consideration for a firm’s budgetary constraints. Lastly, we propose a machine learning methodology to quan- tify the risk of an individual procurement using multiple logistic regression and industry available data, which can be used as the primary input to the fault tree when analyzing overall supply chain system risk. Altogether, the novel approaches proposed within this dissertation provide a set of tools for industry practitioners to predict supply chain risks, optimally choose which risks to mitigate, and make better informed decisions with respect to supplier selection and risk mitigation while avoiding costly delays due to disruptions in LVHV supply chains.

In this era of constant evolution of Internet, Network Virtualization is a powerful platform for the existence of heterogeneous and customized networks on a shared infrastructure. Virtual network embedding is pivotal step for network virtualization and also enables the usage of virtual network mapping techniques. The existing state- of-the-art mapping techniques addresses the issues relating to bandwidth, processing capacity and location constraints very effectively. But due to the advancement of real- time and delay sensitive applications on the Internet, there is a need to address the issue of delay in virtual network mapping techniques. As none of the existing state- of-the-art mapping algorithms do not address this issue, in this thesis we address this issue using VHub-Delay and other mapping algorithms. Based on the study and observations, we designed a new mapping technique that can address the issue of delay and finally the effectiveness of the mapping technique is validated by extensive simulations.

Nowadays Network Virtualization provides a new perspective for running multiple, relatively independent applications on same physical network (the substrate network) within shared substrate resources. This method is especially useful for researchers or investigators to get involved into networking field within a lower barrier. As for network virtualization, Virtual Network Mapping (VNM) problem is one of the most important aspects for investigation. Within years of deeply research, several efficient algorithms have been proposed to solve the Virtual Network Mapping problem, however, most of the current mapping algorithm assumes that the virtual network request topology is known or given by customers, in this thesis, a new VNM assumption based on traffic matrix is proposed, also using existing VNM benchmarks, we evaluated the mapping performance based on various metrics, and by comparing the new traffic matrix based VNM algorithm and existing ones, we provide its advantages and shortcomings and optimization to this new VNM algorithm.

No description available.

No description available.

No description available.

No description available.

No description available.

Workforce scheduling is widely used within most industries. A well-outlined and efficient schedule gives cost savings, such as reduced number of overtime hours, increases overall utilization, and facilitates meeting demands. A large and complex schedule, for example, scheduling of a health care workforce, needs to consider many parameters when constructed; it is essential to account for all critical constraints regarding who can dispense a particular medicine, laws restricting the health care system, etcetera. This thesis evaluates two different methods for implementing a workforce scheduling system for one of Linköping’s most well-known restaurants and bars for students, using mixed integer programming and heuristics. Flamman Pub & Disco recruits new employees prior to every semester. Usually, the workforce consists of around 100 employees, and the vast majority of them work either in the bar or in the kitchen. Historically, the scheduling process has been handled manually using Excel. This does, however, take up much time for the operations manager, something considered frowned upon. Therefore, this thesis suggests an automated scheme for future scheduling processes. Because Flamman is a student organization, they do not hold the capital to invest in expensive licensed optimization software. However, literature studies have shown that heuristics such as large neighborhood search can generate sufficient performance, and therefore the investigation of free-of-charge software using a heuristic approach is conducted. The constructed framework uses a mixed integer programming model, which also lays the cornerstone for the two heuristics: a reverse constructive heuristic and a large neighborhood search. The results retrieved from the analysis prove that a heuristic can be a helpful tool for upcoming recruitment periods. There are, however, recommended areas for improvement regarding the current state of the heuristic.

Hundreds of steel products need to be scheduled on a single or parallel machine in a steel plant every week. A good feasible schedule may save the company millions of dollars compared to a bad one. Single and parallel machine scheduling are also encountered often in many other industries, making it a crucial research topic for both the process system engineering and operations research communities. Single or parallel machine scheduling can be a challenging combinatorial optimization problem when a large number of jobs are to be scheduled. Each job has unique job characteristics, resulting in different setup times/costs depending on the processing sequence. They also have specific release dates to follow and due dates to meet. This work presents both an exact method using mixed-integer quadratic programming, and an approximate method with metaheuristics to solve real-world large-scale single/parallel machine scheduling problems faced in a steel plant. More than 1000 or 350 jobs are to be scheduled within a one-hour time limit in the single or parallel machine problem, respectively. The objective of the single machine scheduling is to minimize a combined total changeover, total earliness, and total tardiness cost, whereas the objective of the parallel machine scheduling is to minimize an objective function comprising the gaps between jobs before a critical time in a schedule, the total changeover cost, and the total tardiness cost. The exact method is developed to benchmark computation time for a small-scale single machine problem, but is not practical for solving the actual large-scale problem. A metaheuristic algorithm centered on variable neighborhood descent is developed to address the large-scale single machine scheduling with a sliding-window decomposition strategy. The algorithm is extended and modified to solve the large-scale parallel machine problem. Statistical tests, including Student's t-test and ANOVA, are conducted to determine efficient solution strategies and good parameters to be used in the metaheuristics. / Thesis / Master of Applied Science (MASc)