The statement and the mathematical model of the problem of planning the inspection and repair of cargo containers

In this paper, using mathematical programming methods we investigate the problem of optimally planning the inspection and repair of cargo containers at several port facilities over time. Its relevance is conditioned by the necessity of optimization of the processes of planning logistics operations. We represent a formulation of this problem and its reduction to a mixed integer linear programming (MILP). Containers have several types and levels of quality, which determine the cost of their repair. The objective function includes total costs of storage, inspection, repair, transportation of containers and penalties for both container rejection and unsatisfied consumer demand. Using the proposed model, it is possible to achieve reasonable computing time for port operations and minimize underutilization or overutilization of port capacity, preventing financial losses and increasing efficiency. Also, this model can be easily converted to solve optimization problems in other areas of logistics.