- All Journals
- Al-Qadisiyah University
- Basrah University
- Kirkuk University
- Mosul University
- The Iraqi Borad for Medical Specialization
- University of Anbar
- University of Technology
- Al Mustafa University
- Al-Zahraa University for Women
- Alnoor University
- Kunooz University
- Misan University
- Ninevah University
- Tikrit University
- University of Al-Hamdaniya
- University of Kerbala
Minimizing the Total Completion Times, the Total Tardiness and the Maximum Tardiness | ||
| Ibn Al-Haitham Journal For Pure And Applied Science | ||
| Article 1, Volume 28, Issue 2, 2015, Pages 155-170 | ||
| Authors | ||
| 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. | ||
| Keywords | ||
| Multiobjective optimization; total Completion times; total Tardiness; maximum Tardiness; non dominated solutions | ||
|
Statistics Article View: 37 PDF Download: 11 |
||