Compare Between Exact Solution and Local Search Solution to Solve Minimize Multi-Objective Function
Summary
No summary yet. VIRAT can read this paper and write a plain-language summary of its aim, methods, key findings and limitations.
Summarise with VIRAT Free to try with your Science Catalogs account.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.
Fields of Study & Subjects
Scheduling and Optimization Algorithms
Optimization and Mathematical Programming
Resource-Constrained Project Scheduling
Publication details
- Journal / source
- International Journal of Applied Mathematics and Numerical Research
- Volume
- 2
- Issue
- 2
- Pages
- 35–38
- Publication date
- 1 January 2026
- Language
- EN