Appropriate product categorization in distribution centres is important for business success because of the possibility of intuitive product finding by the picker and increased product movement. Both of these factors result in the operational efficiency of the distribution centre. The goal of this paper is to explore a model of shelf space dimensioning of storage location on a rack with vertical and horizontal product categorization in a distribution centre, where the aim is to increase total product movement/profit from all shelves of the rack. This is controlled by a packer who must complete orders by getting the goods from shelves and picking them to the container. In this problem, we develop two heuristics and compare the archived results to the CPLEX solver. The average profit ratios of both heuristics are high and approximately equal to 99%. In 10 cases, optimal solutions have been found by heuristics.

Major manufactures are moving towards a sustainability goal. This paper introduces the results of collaboration with the leading company in the packaging and advertising industry in Germany and Poland. The problem addresses the manufacturing planning problem in terms of minimizing the total cost of production. The challenge was to bring a new production planning method into cardboard manufacturing and paper processing which minimizes waste, improves the return of expenses, and automates daily processes heavily dependent on the production planners’ experience. The authors developed a module that minimizes the total cost, which reduces the overproduction and is used by the company’s manufacturing planning team. The proposed approach incorporates planning allowances rules to compromise the manufacturing requirements and production cost minimization.

Distribution centres are the important elements of modern supply chains. A distribution centre stores and ships products. In this paper, we investigate the model of the dimensioning of shelf space on the rack with vertical and horizontal product categorisation in a distribution centre, where the objective is to maximise the total product movement/profit from all shelves of the rack which is being managed by a packer who needs to complete orders selecting the products from the shelves and picking them to the container. We apply two newly developed heuristics to this problem and compare the results to the optimal solution found by the CPLEX solver. There are 8 steering parameters that allow for reducing the search space implemented in heuristics. Among them are parameters that decrease the number of products on the shelves, the category with a range for assigning most space for the most profitable products within the category; two versions of steering parameters for the number of generated product allocations, the step parameters for the intensity of solution diversification, and the movement/profit below which the solutions are not generated. The computational results are presented and indicate that higher-quality solutions can be obtained using the new heuristics. In 10 from 15 tests, both heuristics can find optimal solutions without exploring the whole solution space. For the rest test sets, the solutions received by heuristics are not less than 92.58%.

In the logistics center (warehouse or distribution center), customer orders need to be picked up by the pickers. In this research, we examine the order-picking problem with sequencedependent constraints with two decision variables (container start time and product quantity) in a distribution center with a one-directional conveyor. The decision-making is based on the developed two variations of two-step matheuristics. At first, the main order-picking problem is divided into two subproblems. Next, each step of each variant of the subproblem is solved using a mathematical programming-based technique. Both matheuristics were better in 85 of 120 test instances compared to the initial model solved by mathematical programming. Pickers matheuristics were better on average at 46.56%, while Buffers matheuristics were better on average at 46.87%. The proposed matheuristics approach allows distributors to schedule orders in the logistics center fast enough and with fewer resources.