Open Access. Powered by Scholars. Published by Universities.®
Physical Sciences and Mathematics Commons™
Open Access. Powered by Scholars. Published by Universities.®
Articles 1 - 2 of 2
Full-Text Articles in Physical Sciences and Mathematics
Simulated Annealing Approach To Flow Shop Scheduling, Sadhana Yellanki
Simulated Annealing Approach To Flow Shop Scheduling, Sadhana Yellanki
UNLV Theses, Dissertations, Professional Papers, and Capstones
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 …
Scheduling Jobs On Two Uniform Parallel Machines To Minimize The Makespan, Sandhya Kodimala
Scheduling Jobs On Two Uniform Parallel Machines To Minimize The Makespan, Sandhya Kodimala
UNLV Theses, Dissertations, Professional Papers, and Capstones
The problem of scheduling n independent jobs on m uniform parallel machines such that the total completion time is minimized is a NP-Hard problem. We propose several heuristic-based online algorithms for machines with different speeds called Q2||Cmax. To show the efficiency of the proposed online algorithms, we compute the optimal solution for Q2||Cmax using pseudo-polynomial algorithms based on dynamic programming method. The pseudo-polynomial algorithm has time complexity O (n T2) and can be run on reasonable time for small number of jobs and small processing times. This optimal offline algorithm is …