Branch and Bound Method to Minimized Three Criteria | ||
| Journal of College of Education for Pure Science | ||
| Article 1, Volume 4, Issue 1, June 2014, Pages 37-48 | ||
| Authors | ||
| Jafar S.Aneed; Kadhem M. Hashem; Mohammed K.Al-Zuwaini | ||
| Abstract | ||
| This paper addresses the problem of minimizing the sum of total completion times, maximum earliness and maximum tardiness on a single machine with unequal release date. A branch and bound algorithm with forward approach, in order to find the exact (optimal) solution for itwith two lower bounds (LB_1,LB_2) and four upper bounds〖(UB〗_1,UB_2,UB_3,UB_4) that introduced in this paper. Ten special cases are suggested and proved that yield optimal solution. In general, this problem is strongly NP-hard, and solved it with up to 30 jobs. | ||
| Keywords | ||
| Single machine scheduling; multi; Criteria; simultaneous; release date; total completion times; maximum earliness and maximum tardiness | ||
|
Statistics Article View: 23 PDF Download: 5 |
||