Please use this identifier to cite or link to this item:
http://148.72.244.84/xmlui/handle/xmlui/15906Full metadata record
| DC Field | Value | Language |
|---|---|---|
| dc.date.accessioned | 2025-02-16T08:54:26Z | - |
| dc.date.available | 2025-02-16T08:54:26Z | - |
| dc.date.issued | 2024-04-01 | - |
| dc.identifier.issn | 2958-4612 | - |
| dc.identifier.uri | http://148.72.244.84/xmlui/handle/xmlui/15906 | - |
| dc.description.abstract | For multi criteria sequencing problem on one machine, we proposea modified branch and bound algorithm (MBAB) to find efficient(pareto optimal) solutions in this paper. The criteria are total completion time (∑𝐶𝑗), total lateness(∑𝐿𝑗), and maximum tardiness (Tmax). A collection of n independent tasks(jobs) has to be sequenced on one machine , tasks(jobs)j (j=1,2,3,.....,n) requires processing time Pjand due data dj. The MBAB algorithm depends on branch and bound technique. Applied examples are used to show applicabilityof MBAB algorithm. The MBAB algorithm is compared with complete enumeration method (CEM). Conclusions are formulated on the performance of the (MBAB) algorithm | en_US |
| dc.language.iso | en | en_US |
| dc.publisher | University of Diyala | en_US |
| dc.subject | Sequencing Multi-criteria, Efficient Solution, one machine, Pareto optimal Solution | en_US |
| dc.title | On BornologicalStructure | en_US |
| dc.type | Article | en_US |
| Appears in Collections: | مجلة ديالى للعلوم الاكاديمية / Academic Science Journal (Acad. Sci. J.) | |
Files in This Item:
| File | Description | Size | Format | |
|---|---|---|---|---|
| 25-764.pdf | 928.49 kB | Adobe PDF | View/Open |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.