Solving Bi-Criteria and Bi-Objectives of Total Tardiness Jobs Times and Range of Lateness Problems Using New Techniques
| Autor: | Faez Hassan Ali, Riyam Noori Jawad, Wadhah Abdulleh Hussein |
|---|---|
| Jazyk: | angličtina |
| Rok vydání: | 2022 |
| Předmět: | |
| Zdroj: | Al-Mustansiriyah Journal of Science, Vol 33, Iss 3, Pp 27-35 (2022) |
| Druh dokumentu: | article |
| ISSN: | 1814-635X 2521-3520 |
| DOI: | 10.23851/mjs.v33i3.1135 |
| Popis: | In this paper, we proposed new techniques to solve one of the important fields of the Combinatorial Optimization Problem, which is the problem of machine scheduling. The problem which wants to be solved in this paper is the total tardiness times and range of lateness. For bi-criteria we have (1//(∑Tj,RL)) while for bi-objective we have (1//(∑Tj+RL)). In order to solve the suggested two problems, some new exact and approximation methods are suggested which are produced good results. The results which are obtained from applying the newly proposed methods are compared with the exact method; like Complete Enumeration Method (CEM), then compared results of the heuristics with each other's to obtain the most efficient method. |
| Databáze: | Directory of Open Access Journals |
| Externí odkaz: |
|