Open Access. Powered by Scholars. Published by Universities.®
Discrete Mathematics and Combinatorics Commons™
Open Access. Powered by Scholars. Published by Universities.®
Articles 1 - 2 of 2
Full-Text Articles in Discrete Mathematics and Combinatorics
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 …
A Survey Of Classical And Recent Results In Bin Packing Problem, Yoga Jaideep Darapuneni
A Survey Of Classical And Recent Results In Bin Packing Problem, Yoga Jaideep Darapuneni
UNLV Theses, Dissertations, Professional Papers, and Capstones
In the classical bin packing problem one receives a sequence of n items 1, 2,..., n with sizes s1, s2, . . . ,sn where each item has a fixed size in (0, 1]. One needs to find a partition of the items into sets of size1, called bins, so that the number of sets in the partition is minimized and the sum of the sizes of the pieces assigned to any bin does not exceed its capacity. This combinatorial optimization problem which is NP hard has many variants as well as online and offline versions of the problem. Though …