حکیمیان, علی

[ 1 ] - حداقل کردن تعداد کارهای دیرکرددار در مسئله دو ماشین با ورود غیر همزمان

In this paper, minimizing the number of tardy jobs in two-machine flowshop scheduling with non-simultaneous job entrance is discussed. It is proven that the complexity of the problem is NP_hard. Therefore, a heuristic algorithm is proposed to solve the large scale problems. Besides, an exact branch and bound algorithm with utilizing heuristic algorithm as upper bound proposed to achieve optimal...