This paper presents a "branch and bound" algorithm for the following problem: given a project consisting of a set of activities partially ordered by a set of precedence restrictions, with each ...
In this paper, we propose a new branch and bound algorithm for the solution of large scale separable concave programming problems. The largest distance bisection (LDB) technique is proposed to divide ...
Abstract: In this paper, we analyse an industry driven problem of a rolling stock cyclic job scheduling problem to minimize the total cost of preventive maintenance activities. We model it as a cyclic ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback