International audienceA state-of-the-art of a particular planning problem, the Single Item Lot Sizing Problem (SILSP), is given for its uncapacitated and capacitated versions. First classes of lot sizing problems are briefly surveyed. Various solution methods for the Uncapacitated Single Item Lot Sizing Problem (USILSP) are reviewed. Four different mathematical programming formulations of the classical problem are presented. Different extensions for real-world applications of this problem are discussed. Complexity results of the Capacitated Single Item Lot Sizing Problem (CSILSP) are given together with its different formulations and solution techniques
In this paper, we study a special case of the capacitated lot sizing problem (CLSP), where alternati...
In the present paper, we discuss one of the many processes arising in the context of supply chain ma...
154 p.Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 1986.The area of Material Requirem...
International audienceA state-of-the-art of a particular planning problem, the Single Item Lot Sizin...
Lot sizing is one of the most important and also one of the most difficult problems in production pl...
International audienceThis paper presents a new Lagrangian heuristic to solve the general capacitate...
International audienceFollowing our previous paper (Brahimi, N., Dauzère-Pérès, S., Najid, N. M., an...
International audienceBy focusing on major models used for tactical planning problematic, we propose...
Title: Lot-sizing problem Author: Ondřej Kafka Department: Department of probability and mathematica...
We survey the main results presented in the author’s PhD Thesis presented in June 2003 at the Univer...
In this paper, a case study is carried out concerning the lot-sizing problem involving a single item...
Based on research on the polyhedral structure of lot-sizing models over the last twenty years, we cl...
In this paper we study the computational complexity of the capacitated lot size problem with a parti...
In this paper, we study a special case of the capacitated lot sizing problem (CLSP), where alternati...
In the present paper, we discuss one of the many processes arising in the context of supply chain ma...
154 p.Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 1986.The area of Material Requirem...
International audienceA state-of-the-art of a particular planning problem, the Single Item Lot Sizin...
Lot sizing is one of the most important and also one of the most difficult problems in production pl...
International audienceThis paper presents a new Lagrangian heuristic to solve the general capacitate...
International audienceFollowing our previous paper (Brahimi, N., Dauzère-Pérès, S., Najid, N. M., an...
International audienceBy focusing on major models used for tactical planning problematic, we propose...
Title: Lot-sizing problem Author: Ondřej Kafka Department: Department of probability and mathematica...
We survey the main results presented in the author’s PhD Thesis presented in June 2003 at the Univer...
In this paper, a case study is carried out concerning the lot-sizing problem involving a single item...
Based on research on the polyhedral structure of lot-sizing models over the last twenty years, we cl...
In this paper we study the computational complexity of the capacitated lot size problem with a parti...
In this paper, we study a special case of the capacitated lot sizing problem (CLSP), where alternati...
In the present paper, we discuss one of the many processes arising in the context of supply chain ma...
154 p.Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 1986.The area of Material Requirem...