Open Access. Powered by Scholars. Published by Universities.®
Articles 1 - 1 of 1
Full-Text Articles in Entire DC Network
A Branch And Bound Method For Sum Of Completion Permutation Flow Shop, Swapna Kodimala
A Branch And Bound Method For Sum Of Completion Permutation Flow Shop, Swapna Kodimala
UNLV Theses, Dissertations, Professional Papers, and Capstones
We present a new branch and bound algorithm for solving three machine permutation flow shop problem where the optimization criterion is the minimization of sum of completion times of all the jobs. The permutation flow shop problem (F||∑Ci ) belongs to the class of NP-hard problems; finding the optimal solution is thus expected to be highly computational. For each solution our scheme gives an approximation ratio and finds near optimal solutions. Computational results for up to 20 jobs are given for 3 machine flow shop problem when the objective is minimizing the sum of completion times. The thesis also …