Exact algorithm for minimizing the sum of total late work and maximum late work problem | ||
| Diyala Journal For Pure Science | ||
| Article 1, Volume 10, Issue 1, February 2014, Pages 39-50 | ||
| Authors | ||
| Adawiyah A. Mahmood Al-Nuaimy; Tariq S. Abdul-Razaq | ||
| Abstract | ||
| This paper presents a branch and bound (BAB) algorithm for minimizing the sum of total late work and maximum late work problem within the single machine context. Late work is the amount of work executed after a given due date. Branch and bound (BAB) is proposed, two heuristic methods are used to find an upper bound. This BAB proposes a lower bound based on the decomposition property of the bi-criteria problem. Based on results of computational experiments, conclusions are formulated on the efficiency of the BAB algorithm. | ||
| Keywords | ||
| Late work criterion; branch and bound algorithm; criteria scheduling | ||
|
Statistics Article View: 36 PDF Download: 11 |
||