The economical determination of lot size with capacity constraints is a frequently complex, problem in the real world. In this paper, a multi-level problem of lotsizing with capacity constraints in a finite planning horizon is investigated. A combination of ant colony algorithm and a heuristic method called shifting technique is proposed for solving the problem. The parameters, including the co...

Lot-sizing and scheduling are a well-known problem. However, there only few works addressing the problem in food industry. We propose mixed-integer-programming model for lot-sizing dairy production process. The latter is composed of standardisation tanks that can store different types flavours ultra-high temperature (UHT) lines. considers limited shelf life liquid bottleneck alternate between s...

We address the multi-item, capacitated lot-sizing problem (CLSP) encountered in environments where demand is dynamic and to be met on time. Items compete for a limited capacity resource, which requires a setup for each lot of items to be produced causing unproductive time but no direct costs. The problem belongs to a class of problems that are difficult to solve. Even the feasibility problem be...

This paper studies an industrial lot-sizing and scheduling problem coming from the food-industry that extends multi-item capacitated includes lost sales, overtimes, safety stock non-uniform sequence-dependent setups on parallel machines. We introduce two different formulations adapt well-known Relax-and-Fix Fix-and-Optimise heuristics in order to quickly obtain feasible solutions large instance...

We study the non-uniform capacitated multi-item lot-sizing (CMILS) problem. In this problem, there is a set of demands over a planning horizon of T time periods and all demands must be satisfied on time. We can place an order at the beginning of each period s, incurring an ordering cost Ks. The total quantity of all products ordered at time s can not exceed a given capacity Cs. On the other han...

we present an improved implementation of the wagner-whitin algorithm for economic lot-sizing problems based on the planning-horizon theorem and the economic- part-period concept. the proposed method of this paper reduces the burden of the computations significantly in two different cases. we first assume there is no backlogging and inventory holding and set-up costs are fixed. the second model ...