Please use this identifier to cite or link to this item:
http://148.72.244.84/xmlui/handle/xmlui/2977Full metadata record
| DC Field | Value | Language |
|---|---|---|
| dc.contributor.author | Adawiya A. Mahmood Al-Nuaimi | - |
| dc.contributor.author | Ibtlhal A. Khamees | - |
| dc.date.accessioned | 2023-10-11T09:24:49Z | - |
| dc.date.available | 2023-10-11T09:24:49Z | - |
| dc.date.issued | 2023 | - |
| dc.identifier.citation | https://doi.org/10.24237.ASJ.01.02.623B | en_US |
| dc.identifier.issn | 2958-4612 | - |
| dc.identifier.uri | http://148.72.244.84:8080/xmlui/handle/xmlui/2977 | - |
| dc.description.abstract | For multi criteria sequencing problem on one machine, we propose an algorithm total completion total lateness maximum lateness maximum earliness (CLLE) to find efficient solutions in this paper. The criteria are total completion time(∑Cj), total lateness(∑Lj), maximum Lateness (Lmax) and maximum earliness (Emax). A collection of n independent jobs (tasks) has to be sequenced on one machine jobs j (j=1, 2, 3, …., n) wanted processing time pj and due date dj. Conclusions is formulated on the competence of the (CLLE) algorithm based on results from computational experiments. | en_US |
| dc.description.sponsorship | https://acadscij.uodiyala.edu.iq/ | en_US |
| dc.language.iso | en | en_US |
| dc.publisher | univercit of diyala | en_US |
| dc.subject | Multicriteria,Sequencing,onemachine,EfficientSolution,Algorithm. | en_US |
| dc.title | Solving Multi-Criteria Problem by Using Efficient Algorithm | en_US |
| dc.type | Article | en_US |
| Appears in Collections: | مجلة ديالى للعلوم الاكاديمية / Academic Science Journal (Acad. Sci. J.) | |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.