A Tabu Search Algorithm for Lot Sizing Problem with Controllable Processing Times

In this paper a new problem is studied in lot sizing, which is the extension of the well-known NP-Hard problem, single product multi-period (SPMP) production planning. The new multi-product multi-period (MPMP) production planning problem with controllable processing times is modeled and analysed via some theorems. As both of the SPMP and MPMP are classified as NP-Hard problem, a Tabu search algorithm is used to explore the feasible solution space in order to extract a near optimal solution in a reasonable time. Finally some of the test problems are analyzed to approve the validity ofthe algorithm and the model.

کلیدواژه ها:

Tabu Search ، Controllable Processing Times ، SPMP ، MPMP ، NP-Hard