**Peer Review Journal ** DOI on demand of Author (Charges Apply) ** Fast Review and Publicaton Process ** Free E-Certificate to Each Author

Current Issues
     2026:2/3

International Journal of Applied Mathematics and Numerical Research

ISSN: (Print) | 3107-7110 (Online) | Impact Factor: 8.62 | Open Access

Compare Between Exact Solution and Local Search Solution to Solve Minimize Multi-Objective Function

Author(s):

Published:

Volume: 2 | Issue: 2 | Pages: 35-38

Subject:

Country: Iraq

DOI: https://doi.org/10.54660/IJAMNR.2026.2.2.35-38

License: CC BY 4.0

Full Text (PDF)

Open Access - Free to Download

Download Full Article (PDF)

Abstract

This paper deals with a branch and bound algorithms to solve flow shop scheduling problem, to obtained minimize multi objective function under fuzzy environment. Where a processing time is a triangular fuzzy number, the objective of this paper obtained optimal sequence to minimized total cost tardiness time and max completion time, so we used three upper bound and two lower bounds which on a branch and bound algorithm on two machines. And compere between branch and bound and complete enumeration method, Local search and compare results with complete enumeration method from time of processing in MATLAB program and number of nodes.

How to Cite This Article

Mustafa Talal Kadhim (2026). Compare Between Exact Solution and Local Search Solution to Solve Minimize Multi-Objective Function . International Journal of Applied Mathematics and Numerical Research (IJAMNR), 2(2), 35-38. DOI: https://doi.org/10.54660/IJAMNR.2026.2.2.35-38

Publication Information

Journal: International Journal of Applied Mathematics and Numerical Research (IJAMNR)

Publisher: Anfo Publication House

ISSN: (Print), 3107-7110 (Online)

Frequency: Bimonthly

Language: English

Open Access: Yes - This article is distributed under the terms of the Creative Commons Attribution 4.0 International License

Share This Article: