Certain investigations on scheduling problems using meta heuristics

Abstract

In manufacturing systems the selection of the appropriate order in newlinewhich waiting jobs are processed by machines is called Job sequencing or newlinepermutation flow shop scheduling Typically the number of machines newlineavailable is limited Each job consists of a certain number of operations and a newlinemachine can process a single operation at a time Although theoretically it is newlinepossible to find the optimum sequence by testing each one in practice it is newlinedifficult to check each sequence because of the large number of computations newlineinvolved Hence any technique to arrive at optimum sequence at least newlineapproximately will be quite valuable In the first part of the thesis three genetic newlinealgorithm operators and a model for job sequence are proposed newline newline