Abstract: Job-shop scheduling is an important but difficult problem arising in low-volume high-variety manufacturing. It is usually solved at the beginning of each shift with strict computational time ...
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