Please use this identifier to cite or link to this item:
http://148.72.244.84/xmlui/handle/xmlui/6283Full metadata record
| DC Field | Value | Language |
|---|---|---|
| dc.contributor.author | Adawiya A. Mahmood Al-Nuaimi | - |
| dc.date.accessioned | 2023-10-23T07:00:32Z | - |
| dc.date.available | 2023-10-23T07:00:32Z | - |
| dc.date.issued | 2016 | - |
| dc.identifier.issn | 2222-8373 | - |
| dc.identifier.uri | http://148.72.244.84:8080/xmlui/handle/xmlui/6283 | - |
| dc.description.abstract | This paper considers a branch and bound (BAB) algorithm for simultaneous multicriteria problem of minimizing the sum of the three criteria of total completion time, maximum tardiness and maximum late work within the single machine context.Late work is the amount of work executed after a given due date. Heuristic method was used to find an upper bound. This BAB proposes a lower bound based on the decomposition property of the multicriteria problem. Based on results of computational experiments, conclusions are presented on the efficiency of the BAB algorithm. | en_US |
| dc.description.sponsorship | https://djps.uodiyala.edu.iq/ | en_US |
| dc.publisher | University of Diyala | en_US |
| dc.subject | Keywords: Multicriteria scheduling, late work criterion, branch and bound algorithm, single machine. | en_US |
| dc.title | Optimal Solution for Simultaneous Multicriteria Problem | en_US |
| dc.title.alternative | حل أمثل لمسألة متعددة المقاييس تحدث في وقت واحد | en_US |
| dc.type | Article | en_US |
| Appears in Collections: | مجلة ديالى للعلوم الاكاديمية / Academic Science Journal (Acad. Sci. J.) | |
Files in This Item:
| File | Description | Size | Format | |
|---|---|---|---|---|
| 18-27 E.pdf | 734.24 kB | Adobe PDF | View/Open |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.