@article{Abdul-Razaq_Ali_2017, title={Minimizing the Total Completion Times, the Total Tardiness and the Maximum Tardiness}, volume={28}, url={https://jih.uobaghdad.edu.iq/index.php/j/article/view/221}, abstractNote={<p>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.&nbsp;</p>}, number={2}, journal={Ibn AL- Haitham Journal For Pure and Applied Sciences}, author={Abdul-Razaq, Tariq S. and Ali, Zainab M.}, year={2017}, month={Mar.}, pages={155–170} }