Author(s)

Ridha Erromdhani^1*, Abdelwaheb Rebaï²

¹Department of Quantitative Methods and Information Technology, Faculty of Economic and Management, Sfax, Tunisia.
²Department of Quantitative Methods, Faculty of Economic and Management, Sfax, Tunisia.

Our research focuses on the development of two cooperative approaches for resolution of the multi-item capacitated lot-sizing problems with time windows and setup times (MICLSP-TW-ST). In this paper we combine variable neighborhood search and accurate mixed integer programming (VNS-MIP) to solve MICLSP-TW-ST. It concerns so a particularly important and difficult problem in production planning. This problem is NP-hard in the strong sense. Moreover, it is very difficult to solve with an exact method; it is for that reason we have made use of the approximate methods. We improved the variable neighborhood search (VNS) algorithm, which is efficient for solving hard combinatorial optimization problems. This problem can be viewed as an optimization problem with mixed variables (binary variables and real variables). The new VNS algorithm was tested against 540 benchmark problems. The performance of most of our approaches was satisfactory and performed better than the algorithms already proposed in the literature.

Variable Neighborhood Decomposition Search, Formatting, Metaheuristics, Production Planning, Capacitated Lot Sizing, Mixed Integer Programming, Matheuristics, Production Time Windows

Erromdhani, R. and Rebaï, A. (2017) MIP Formulations and Metaheuristics for Multi-Item Capacitated Lot-Sizing Problem with Non-Customer Specific Production Time Windows and Setup Times. American Journal of Operations Research, 7, 83-98. doi: 10.4236/ajor.2017.72006.