Honors Theses
Date of Award
12-2018
Document Type
Undergraduate Thesis
Department
Computer and Information Science
First Advisor
Dawn Wilkins
Relational Format
Dissertation/Thesis
Abstract
Manufacturing industry is growing exponentially. The need of using algorithms and computational techniques to enhance processes is increasing every day. Algorithms help us solve almost all kind of computational problems. Not only choosing the right algorithm for a problem is important but also optimizing its time and space efficiency is crucial. BorgWarner Transmission Systems located in Water Valley, Mississippi is one among the leading manufacturing companies. This paper will demonstrate a real-world audit scheduling problem happened at BorgWarner and the techniques used to solve it. A gentle introduction to some of the heuristic algorithms such as Genetic algorithm, Randomized algorithm, and Greedy algorithm is also discussed in this paper. A description of how the problem is modelled to fit through these approaches and how good they work in each approach, as well as their time and space consumption is been analyzed in this paper.
Recommended Citation
Kudai, Aamir, "Scheduling Problems" (2018). Honors Theses. 1555.
https://egrove.olemiss.edu/hon_thesis/1555
Accessibility Status
Searchable text