Application of the surrogate gradient method for a multi-item single-machine dynamic lot size scheduling problem

Abstract

AbstractThis study treats a multi-item single-machine dynamic lot size scheduling problem with sequence-independent setup cost and setup time. This problem has various heterogeneous decision features, such as lot sizing and lot sequencing. Traditionally, the problem has been treated by putting artificial constraints on the other feature in order to determine one of them. The proposed model is a Lagrange decomposition and coordination method that aims at simultaneous optimization of these decision features; however, smooth convergence to a feasible near-optimal solution has been a problem. So, in this paper, we propose a model that improves the constraint equation of the existing model and showed that it satisfies the Karush–Kuhn–Tucker (KKT) condition when we obtained a feasible solution. In addition, by applying the surrogate gradient method, which has never been applied to this problem before, it was shown that smoother convergence than before can be achieved through actual example of printed circuit board.