Branch and Bound Method to Solve Multi Objectives Function
Journal Title: JOURNAL OF ADVANCES IN MATHEMATICS - Year 2016, Vol 12, Issue 3
Abstract
This paper presents a branch and bound algorithm for sequencing a set of n independent jobs on a single machine to minimize sum of the discounted total weighted completion time and maximum lateness, this problems is NP-hard. Two lower bounds were proposed and heuristic method to get an upper bound. Some special cases were proved and some dominance rules were suggested and proved, the problem solved with up to 50 jobs.
Authors and Affiliations
Tahani Jabbar Kahribt, Mohammed Kadhim Al- Zuwaini
Keywords
Related Articles
- EP ID EP651654
- DOI 10.24297/jam.v12i3.494
- Views 152
- Downloads 0
Two-Parameters Bifurcation in Quasilinear Dierential-Algebraic Equations
In this paper, bifurcation of solution of guasilinear dierential-algebraic equations (DAEs) is studied. Whereas basic principle that quasilinear DAE is eventually reducible to an ordinary dierential equation (ODEs) and t...
New Travelling Wave solutions of the Korteweg De Vries Equation by - (G'/G') Expansion method.
Exact hyperbolic, trigonometric and rational function travelling wave solutions to the Korteweg De Vries (KDV) equation using the (G'/G) expansion method are presented in this paper. More travelling wave solutions to the...
Some Remarks on Lukasiwicz disjunction and conjunction operators On Intuitionistic Fuzzy Matrices
Some properties of two operations - conjunction and disjunction from Lukasiwicz type over Intuitionistic Fuzzy Matrices are studied.
Role of Conservation Laws in the Development of Nonequilibrium and Emergence of Turbulence
It turns out that the equations of mathematical physics, which consist equations of the conservation laws for energy, linear momentum, angular momentum, and mass, possess additional, hidden, properties that enables one t...
Partial Orders in BCL+-Algebra
In this paper, we introduce a partially ordered BCL+-algebra, and we show that some of its fundamental properties.