H. Ibrahim, Manal and H. Al, Faez and A. Chachan, Hanan (2023) Minimizing Weighted Penta-Objective Function using Local Search Methods and Branch and Bound Algorithm. In: 4th International Scientific Conference on Administrative and Financial Sciences, 03-04/05/2023, Cihan Universtiy-Erbil.
![[thumbnail of Conference Paper]](https://eprints.cihanuniversity.edu.iq/style/images/fileicons/text.png)
Text (Conference Paper)
Conf_ISCAFS2023_14-07-2023.pdf - Published Version
Available under License Creative Commons Attribution Non-commercial No Derivatives.
Download (312kB)
Abstract
In this work, we will discuss a Multi (Penta) Objective Function (POF) for Single Machine Scheduling Problems (SMSPs) to minimize the total cost of sum weighted of the following objectives: earliness, tardiness, completion time, late jobs and late work (∑ (���� + ���� + ���� + ���� + ���� ��=� ), where �� , �� ,�� ,�� ��� �� , are positive penalties of job � for each objective respectively. For this problem we will study the mathematical formulation of this problem, using Complete Enumeration and Branch and Bound (BAB) methods to find the optimal solution and Local Search Methods (LSM's) to find approximation solutions. Lastly, the practical results proved the efficiency of BAB and LSM's methods.
| Item Type: | Conference or Workshop Item (Paper) |
|---|---|
| Uncontrolled Keywords: | Machine Scheduling Problems, Multi Objective Function, Local Search Methods, Branch and Bound. |
| Subjects: | Q Science > Q Science (General) Q Science > QA Mathematics |
| Divisions: | Conferences > CIC-ISCAFS |
| Depositing User: | ePrints Depositor |
| Date Deposited: | 15 Apr 2025 11:29 |
| Last Modified: | 15 Apr 2025 11:29 |
| URI: | https://eprints.cihanuniversity.edu.iq/id/eprint/3477 |
Actions (login required)
- View Item