Three-dimensional orthogonal bin packing is a problem NP-hard in the strong sense where a set of boxes must be orthogonally packed into the minimum number of three-dimensional bins. We present a two-level tabu search for this problem. The first-level aims to reduce the number of bins. The second...

Deterministic models, even if used repeatedly, will not capture the essence of planning in an uncertain world. Flexibility and robustness can only be properly valued in models that use stochastics explicitly, such as stochastic optimization models. However, it may also be very important to...