Master of Science in Computer Science
First Committee Member
Second Committee Member
Ajoy K. Datta
Third Committee Member
Fourth Committee Member
Number of Pages
Flow Shop Scheduling refers to the process of allotting various jobs to the machines given, such that every job starts to process on a machine n only after it has finished processing on machine n-1, with each job having n operations to be performed one per machine. To find a schedule that leads to the optimal utilization of resources, expects the schedule to finish in a minimum span of time, and also satisfy the optimality criterion set for the related scheduling problem is NP-Hard, if n > 2. In this thesis, we have developed an algorithm adopting a heuristic called Simulated Annealing, to act as a support to the Flow Shop Scheduling. This algorithm tries to deliver good/near optimal solutions to the given scheduling problem, in a reasonable time. We also carry out various tests to determine the behavior of the algorithm as well as to evaluate its effectiveness.
Combinatorial optimization; Computer scheduling; Flow shop; Production scheduling; Scheduling; Simulated annealing (Mathematics)
Computer Sciences | Discrete Mathematics and Combinatorics
Yellanki, Sadhana, "Simulated Annealing Approach To Flow Shop Scheduling" (2013). UNLV Theses, Dissertations, Professional Papers, and Capstones. 1911.