Dynamic lot sizing problem with continuous-time Markovian production cost. International Journal of Produc- tion Economics 2009;120:607-12.Azaron, A., Tang, O., & Tavakkoli-Moghaddam, R. (2009). Dynamic lot sizing problem with continuous-time Markovian production cost. International Journal of ...
This paper studies a new multi-product multi-period dynamic lot sizing problem, where the inventories of products are assumed to be expired at a pre-specified date. For this purpose we assume a retailer that purchases products in large quantities (lot size) from manufacturers, and then sells ...
Capacity constraintsMILPThe dynamic lot-sizing problem is highly complex and very important for the planning systems of manufacturing enterprises in time-... YCY Zhou - 《Chaos Solitons & Fractals Applications in Science & Engineering An Interdisciplinary Journal of Nonlinear Science》 被引量: 0发表:...
Computational complexity of the capacitated lot size problem The paper addresses a multi-item, multi-plant lot-sizing problem with transfer costs and capacity constraints. The problem is reformulated according to a m... GR Bitran,HH Yanasse - 《Management Science》 被引量: 773发表: 1982年 AN ...
模糊能力约束分批计划遗传算法参数线性规划A mixed integer programming model is built for the fuzzy capacitated dynamic lot\\|sizing problem (FCLSP) by means of the fuzzy technology. A heuristic method combined genetic algorithm and parameter linear programming is proposed to the FCLSP. A simulation ...
The multi item single level capacitated dynamic lotsizing problem consists of scheduling N items over a horizon of T periods. Demands are given and should be satisfied without backlogging. The objective is to minimize the sum of setup costs and inventory holding costs over the horizon subject to...
It is shown that when backorders, setup times and dynamic demand are included in capacitated lot sizing problem, the resulting classical formulation and one of the transportation formulations of the problem (referred to as CLSP_BS) are equivalent. And it is shown that both the formulations are ...
Proofs from complexity theory as well as computational experiments indicate that most lot sizing problems are hard to solve. Because these problems are so difficult, various solution techniques have been proposed to solve them. In the past decade, meta-heuristics such as tabu search, genetic algorit...
We address the dynamic lot sizing problem for systems with product returns. The demand and return amounts are deterministic over the finite planning horizo... RH Teunter,Z. Pelin Bayindir & Wilco Van Den Heuvel - 《International Journal of Production Research》 被引量: 209发表: 2006年 Determin...
Lot sizingWarm/cold processRolling horizonHeuristicsWe consider the dynamic lot sizing problem for a warm/cold process where the process can be kept warm at a unit variable cost for the next period if more than a prespecified quantity has been produced. Exploiting the optimal production plan ...