Setting optimal due dates in a basic safe-scheduling model

We examine a basic stochastic sequencing model with due dates as decisions. The objective is to make due dates as tight as possible while meeting service level constraints. We develop an optimizing procedure using branch and bound, and we evaluate the performance of heuristic procedures as well. (C) 2013 Elsevier Ltd. All rights reserved.