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!
|
| Summary: | 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.
|
|---|---|
| ISSN: | 1813-1662 2415-1726 |