3-A-6 SIMULTANEOUS OPTIMAIZATION OF ALL DECISION FEATURES IN A MULTI-ITEM MULTI-PROCESS DYNAMIC LOT SIZE SCHEDULING PROBLEM

This paper deals with a problem of optimizing all decision features such as loading, lot sizing, lot sequencing, and dispatching in a multi-item multi-process dynamic lot size scheduling simultaneously. Clarifying that the complementary slackness theorem does not hold in the optimal solution of this sort of scheduling problems and its reason, we present an algorithm for obtaining a near optimal solution. Finally, we illustrate a numerical example.