ON PARETO SET FOR A BI-CRITERIA SINGLE MACHINE SCHEDULING PROBLEM
This paper considers a bi-criteria planning problems on a single machine, with the goal of minimizing total square time duration and maximizing earliness. To solve this problem we have to find the Pareto set. We introduced a strong relation between lower bound, upper bound of the problem and the n...
Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Tikrit University
2023-01-01
|
| Series: | Tikrit Journal of Pure Science |
| Subjects: | |
| Online Access: | https://tjpsj.org/index.php/tjps/article/view/764 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1839631083060068352 |
|---|---|
| author | Rzgar F. Mahmood Ayad Mohammed Ramadan Mediya B. Mrakhan Nasyar Hussein Qader4 |
| author_facet | Rzgar F. Mahmood Ayad Mohammed Ramadan Mediya B. Mrakhan Nasyar Hussein Qader4 |
| author_sort | Rzgar F. Mahmood |
| collection | DOAJ |
| description |
This paper considers a bi-criteria planning problems on a single machine, with the goal of minimizing total square time duration and maximizing earliness. To solve this problem we have to find the Pareto set. We introduced a strong relation between lower bound, upper bound of the problem and the number of efficient solutions via a theorem which shows also that the lower bound is near to optimal solution if the number of efficient solutions is small.
|
| format | Article |
| id | doaj-art-aa67c6f5b1c3419e8e1e95cc8ae6f5d4 |
| institution | Matheson Library |
| issn | 1813-1662 2415-1726 |
| language | English |
| publishDate | 2023-01-01 |
| publisher | Tikrit University |
| record_format | Article |
| series | Tikrit Journal of Pure Science |
| spelling | doaj-art-aa67c6f5b1c3419e8e1e95cc8ae6f5d42025-07-12T07:20:03ZengTikrit UniversityTikrit Journal of Pure Science1813-16622415-17262023-01-0127610.25130/tjps.v27i6.764ON PARETO SET FOR A BI-CRITERIA SINGLE MACHINE SCHEDULING PROBLEMRzgar F. MahmoodAyad Mohammed RamadanMediya B. MrakhanNasyar Hussein Qader4 This paper considers a bi-criteria planning problems on a single machine, with the goal of minimizing total square time duration and maximizing earliness. To solve this problem we have to find the Pareto set. We introduced a strong relation between lower bound, upper bound of the problem and the number of efficient solutions via a theorem which shows also that the lower bound is near to optimal solution if the number of efficient solutions is small. https://tjpsj.org/index.php/tjps/article/view/764PARETO SETBI-CRITERIASINGLE MACHINEPROBLEM |
| spellingShingle | Rzgar F. Mahmood Ayad Mohammed Ramadan Mediya B. Mrakhan Nasyar Hussein Qader4 ON PARETO SET FOR A BI-CRITERIA SINGLE MACHINE SCHEDULING PROBLEM Tikrit Journal of Pure Science PARETO SET BI-CRITERIA SINGLE MACHINE PROBLEM |
| title | ON PARETO SET FOR A BI-CRITERIA SINGLE MACHINE SCHEDULING PROBLEM |
| title_full | ON PARETO SET FOR A BI-CRITERIA SINGLE MACHINE SCHEDULING PROBLEM |
| title_fullStr | ON PARETO SET FOR A BI-CRITERIA SINGLE MACHINE SCHEDULING PROBLEM |
| title_full_unstemmed | ON PARETO SET FOR A BI-CRITERIA SINGLE MACHINE SCHEDULING PROBLEM |
| title_short | ON PARETO SET FOR A BI-CRITERIA SINGLE MACHINE SCHEDULING PROBLEM |
| title_sort | on pareto set for a bi criteria single machine scheduling problem |
| topic | PARETO SET BI-CRITERIA SINGLE MACHINE PROBLEM |
| url | https://tjpsj.org/index.php/tjps/article/view/764 |
| work_keys_str_mv | AT rzgarfmahmood onparetosetforabicriteriasinglemachineschedulingproblem AT ayadmohammedramadan onparetosetforabicriteriasinglemachineschedulingproblem AT mediyabmrakhan onparetosetforabicriteriasinglemachineschedulingproblem AT nasyarhusseinqader4 onparetosetforabicriteriasinglemachineschedulingproblem |