Abstract: The present paper tackles the dynamic job shop scheduling problem (DJSSP), aiming to schedule a new set of jobs while minimizing the completion time of all operations. The problem is an ...
Abstract: The first linear programming bound is the best known asymptotic upper bound for binary codes, for a certain subrange of distances. Starting from the work of Friedman and Tillich (2005), ...
We study a class of integer bilevel problems, the so-called Integer Linear Multiplicative Bilevel Problem, ILMBP, where the constraints are linear and both the upper level problem and the lower level ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results