Minimizing the Total Completion Times, the Total Tardiness and the Maximum Tardiness
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 maxi...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
University of Baghdad
2017-03-01
|
| Series: | Ibn Al-Haitham Journal for Pure and Applied Sciences |
| Subjects: | |
| Online Access: | https://jih.uobaghdad.edu.iq/index.php/j/article/view/221 |
| Summary: | 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.
|
|---|---|
| ISSN: | 1609-4042 2521-3407 |