In this paper, a new fix-and-optimize (FO) approach is proposed for two dynamic multi-level capacitated lot sizing problems (MLCLSP), the MLCLSP without setup carryover and the MLCLSP with setup carryover. Given an MIP model of a lot sizing problem, the approach iteratively solves a series of subproblems of the model until no better solution can be found. Each sub-problem re-optimizes a subset ...

. ABC analysis is one of the most widely used techniques in inventory management to classify items into three ordered categories called A, B and C, where category A contains the most important items and category C includes the least important ones. The ABC classification of inventory items is based on their performance expressed by weighted scores. In this paper, a new ABC classification model ...

Variable Neighborhood Search (VNS) is a recent metaheuristic, or framework for building heuristics, which exploits systematically the idea of neighborhood change, both in the descent to local minima and in the escape from the valleys which contain them. In this tutorial we first present the ingredients of VNS, i.e., Variable Neighborhood Descent (VND) and Reduced VNS (RVNS) followed by the basi...

This paper presents a general variable neighborhood search (GVNS) heuristic for solving the maximum diverse grouping problem. Extensive computational experiments performed on a series of large random graphs as well as on several instances of the maximum diversity problem taken from the literature show that the results obtained by GVNS consistently outperform the best heuristics from the literat...

To operate a cross-dock successfully, an efficient assignment of trucks to docks is one the key decisions. In this paper, we are interested in problem, where number exceeds docks. The objective minimize cost transferring goods within while avoiding delivery penalties. This problem being NP-hard, use Variable Neighborhood Search metaheurisitc (VNS) solve it approximately. More specifically, cond...