Computational study of branch and bound techniques for minimizing the total weighted tardiness in job shops

Singer, M., Pinedo M., 1998. IIE Transactions 29, 109-119.

We present and compare a number of branch and bound algorithms for minimizing the total weighted tardiness in job shops. There are basically two types of branching schemes. The first one inserts operations in a partial schedule, while the second one fixes arcs in the disjunctive graph formulation of the problem. The bounding schemes are based on the analysis of precedence constraints, and on the solution of nonpreemptive single machine subproblems that are subject to so-called delayed precedence constraints.

Más Información


Los comentarios están cerrados.