Branch and Bound Method to Solve Multiple Objective Function
Journal Title: JOURNAL OF ADVANCES IN MATHEMATICS - Year 2014, Vol 9, Issue 4
Abstract
This paper presents a branch and bound algorithm for sequencing a set of n jobs on a single machine to minimize multiobjective: total cost of flow time, maximum earliness and sum of tardy jobs, when the jobs may have unequal ready time. Two lower bounds were proposed and heuristic method to get an upper bound. Some special cases were proved and some dominance rules were proposed and proved, the problem solved up to 35 jobs.
Authors and Affiliations
Karrar Ali Janam
Keywords
Related Articles
- EP ID EP651366
- DOI 10.24297/jam.v9i4.6875
- Views 160
- Downloads 0
Comparison of Quantities of Information in the Human Memory
A mathematical model of changing the amount of information in the abstract human memory is proposed in the presence of the subsequent "external discrete" training (filling the information). Under this model, the amo...
On Full k-ideals of a Ternary Semiring
In this paper, we generalize the concept of the full -ideals of a semiring to ternary semiring and prove that the set of zeroids annihilator of a right ternary semimodule, and the Jacobson radical of a ternary semiring a...
Analytical solutions of time-fractional advection problem
we use variational iteration method (VIM) to solve some nonlinear time-fractional advection problem.Compared to the other method, the VIM is direct and straightforward.
On the bounds of the expected nearest neighbor distance
In this paper, we give some contributions for special distributions having unbounded support for which we derive upper and lower bounds on the expected nearest neighbor distance of the extreme value (Gu...
On the sulutions of a fractional differemtial equation
We have showed the results obtained in [1] are incorrect and the fractional complex transform is invalid to the fractional differential equation which contain modified Riemann-Liouville fractional derivative.