Scheduling a set of n jobs on a single machine so as to minimize the completion time variance is a well-known NP-hard problem. In this paper, we propose a sequence, which can be constructed in O(n log n) time, as a solution for the problem. Our primary concern is to establish the asymptotical optima
Probabilistic analysis of an lp relaxation bound for the steiner problem in networks
β Scribed by Anjani Jain
- Publisher
- John Wiley and Sons
- Year
- 1989
- Tongue
- English
- Weight
- 395 KB
- Volume
- 19
- Category
- Article
- ISSN
- 0028-3045
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
## Abstract An hypersingular integral equation of a threeβdimensional elastic solid with an embedded planar crack subjected to a uniform stress field at infinity is derived. The solution of the boundaryβintegral equation is succeeded taking into consideration an appropriate Gauss quadrature rule fo
The purpose of this paper is to describe a quantitative method of trophic dynamic analysis derived from a systems ecology theoretical foundation. This method was devised to provide a solution for the problem of how to deal with mixed trophic and non-trophic processes in cyclic ecosystem networks, a
## Abstract Starting from the topicality of the issues related to the location of undesirable facilities and on the basis of a brief review of the types of models that are currently being used in the Municipal Solid Waste Management context, the present paper proposes a multicriteria approach that