Minimizing the Total Completion Times, the Total Tardiness and the Maximum Tardiness

Main Article Content

Tariq S. Abdul-Razaq Zainab M. Ali

Abstract

In this paper, the main work is to minimize a function of three cost criteria for scheduling n jobs on a single machine. We proposed algorithms to solve the single machine scheduling multiobjective problem. In this problem, we consider minimizing the total completion times, total tardiness and maximum tardiness criteria. First a branch and bound (BAB) algorithm is applied for the 1//∑Ci+∑Ti+Tmax problem. Second we compare two multiobjective algorithms one of them based on (BAB) algorithm to find the set of efficient (non dominated) solutions for the 1//(∑Ci ,∑Ti ,Tmax) problem. The computational results show that the algorithm based on (BAB) algorithm is better than the other one for generated the total number of non dominated solutions. 

Article Details

How to Cite
ABDUL-RAZAQ, Tariq S.; ALI, Zainab M.. Minimizing the Total Completion Times, the Total Tardiness and the Maximum Tardiness. Ibn AL- Haitham Journal For Pure and Applied Science, [S.l.], v. 28, n. 2, p. 155-170, mar. 2017. ISSN 2521-3407. Available at: <https://jih.uobaghdad.edu.iq/index.php/j/article/view/221>. Date accessed: 13 may 2021.
Section
mathematics