حسینی، , سید محمد حسن

[ 1 ] - بکارگیری الگوریتم انجماد تدریجی برای زمانبندی کارها در کارگاه جریانی دو ماشینی با هدف تولید به موقع

A two-machine permutation flow shop scheduling with n independent jobs and different due dates is considered in this paper. Since this problem is shown to be NP-Hard, We use the simulated annealing to solve this problem. The objective is minimizing the weighted earliness and tardiness that cover JIT concept. We construct our algorithm in four scenarios with considering two Markov chains and two...