Scheduling Problems

Kudai, Aamir (2018) Scheduling Problems. Undergraduate thesis, under the direction of Dawn Wilkins from Computer and Information Science, The University of Mississippi.


Download (369kB) | Preview


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.

Item Type: Thesis (Undergraduate)
Creators: Kudai, Aamir
Student's Degree Program(s): B.S. in Computer and Information Science
Thesis Advisor: Dawn Wilkins
Thesis Advisor's Department: Computer and Information Science
Institution: The University of Mississippi
Subjects: Q Science > QA Mathematics > QA76 Computer software
Depositing User: Aamir Kudai
Date Deposited: 18 Jan 2019 17:32
Last Modified: 18 Jan 2019 17:32

Actions (login required)

View Item View Item