This paper presents an algorithm for determining an optimum solution to a two-stage production sequencing problem with these characteristics: There are n jobs to be sequenced in a two-stage production ...

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 ...

Many important and valuable planning and scheduling problems in logistics and automation are combinatorial optimization problems. The most famous problem of this type is the traveling salesman problem ...