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 151
- Downloads 0
On Some Results of a New Fractional Calculus in the Unit Disk and its Applications
In this paper, we study a new definition of fractional calculus (fractional derivative-(β,ϒ),fractional integral-(β,ϒ),by depending of Srivastava-Owa fractional operators,and study some properties and provided of ope...
Functional moments estimators analysis by the Monte-Carlo method for model of mixture with varying concentrations
The functional moments estimation by the sample from the mixture with varying concentrations is studied. The problem of efficiency the simple linear estimator with fixed weight against the adaptive or improved estimators...
On the Three-Parameter Burr Type XII Distribution and its Application to Heavy Tailed Lifetime Data
This paper identifies the characteristics of three-parameter Burr Type XII distribution and discusses its utility in survivorship applications. It addresses the problem of estimating the three-parameter Burr XII distribu...
Necessary Condition for Cubic Planer three Connected Graph to be Non- Hamiltonian and proof of Barnettes Conjecture
A conjecture of Barnette's states that every three connected cubic bipartite planer graph is Hamiltonian. This problem has remained open since its formulation .This paper has a threefold purpose. The first is to provide...
Statistical Determination Of The Constants Of The Atmospheric Refraction Formula
In the present paper an efficient algorithm based on the least squares method was developed for the determination of the constants A&B of the atmospheric refraction formula. The principles of atmospheric refraction a...