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 154
- Downloads 0
COINCIDENCE AND COMMON FIXED POINT THEOREMS IN INTUITIONISTIC FUZZY METRIC SPACES
In this paper, as an application of occasionally weakly compatible mappings, we prove common fixed pointtheorems under contractive conditions that extend the scope of the study of common fixed point theorems from the cla...
(1,2) - Domination in the Total Graphs of Cn , Pn and K1,n
In this paper, we discuss the (1,2) - domination in the total graphs of Cn , Pnand K1,n
Radius of Strong Starlikeness for Some Classes of Analytic Functions
Let φ(z) be an analytic function with positive real part on ∆ ={z; |z| < 1} with φ(0) = 1, φ0(0) > 0 which maps the unit disk ∆ ontoa region starlike with respect to 1 and symmetric with respect to the real...
An elastic plate with a curvilinear hole and flowing heat in S-plane
In the present paper, we apply complex variable method, Cauchy method, to derive exact expressions for Goursat functions for the boundary value problems of an infinite elastic plate weakened by a curvilinear hole....
Lattices of Intuitionistic Fuzzy Submodules
In this paper, we provide a technique of generating an intuitionistic fuzzy submodule from a given intuitionistic fuzzy set. It is shown that (i) the sum of two intuitionistic fuzzy submodules of a module M is the intuit...