Lot-Sizing and Tactical Production Planning
My research on lot-sizing focuses on the modelling and optimisation of tactical production planning problems, ranging from classical single-level formulations to multi-level and multi-site production systems.
The central decision problem consists in determining when and how much to produce over a finite planning horizon while satisfying demand and balancing setup, production and inventory costs under operational constraints.
My work addresses both the modelling and the resolution of these problems. A particular emphasis is placed on generic representations of production planning systems, capacitated lot-sizing models, multi-level product structures and the development of efficient optimisation approaches adapted to the combinatorial structure of lot-sizing problems.
A recurring objective of this research is to bridge the gap between the physical description of an industrial production system, its mathematical representation and the optimisation algorithms used to solve the resulting planning problem. This perspective has progressively led to the development of reusable modelling concepts and software components for representing, generating and solving families of lot-sizing problems.
Research scope & methodological positioning
A clear distinction between the scientific problems addressed, the methods used to solve them, and their industrial application contexts.
Problems & planning concepts
How the problems are addressed
- Lot-sizing
- Tactical production planning
- Production planning
- Capacitated lot-sizing
- Multi-level lot-sizing
- Multi-site production planning
- Master Production Scheduling
- Material Requirements Planning
- Mathematical programming
- Combinatorial optimisation
Industrial systems & contexts
- Mathematical programming
- Mixed-integer linear programming
- Dynamic programming
- Exact optimisation
- Metaheuristics
- Particle Swarm Optimisation
- Problem-specific heuristics
- Generic mathematical modelling
- Production-system modelling
- Algorithm design
- Computational experiments
Research sub-themes
Distinct research directions developed within this area.
Generic Planning Model
A major part of my research concerns the development of a generic modelling framework for tactical production planning.
Classical lot-sizing models generally start from a predefined mathematical structure corresponding to a particular production environment: single-level or multi-level production, single-site or multi-site organisations, capacitated or uncapacitated resources, and specific product or process structures.
The Generic Planning Model follows a different approach. The objective is to describe the industrial production system independently from a particular mathematical formulation and to use this description to construct the corresponding tactical planning problem.
The framework provides a common representation of the main entities involved in production planning, including products, product structures, production and storage entities, resources, capacities, demands, production quantities, setup decisions and inventories.
Different lot-sizing problems can therefore be obtained by instantiating the same generic representation according to the characteristics of the production system under consideration.
This approach separates three complementary levels: the description of the industrial system, the mathematical formulation of the planning problem and the optimisation method used to solve it. This separation facilitates the development of reusable models and algorithms and provides a unified framework for studying different families of lot-sizing problems.
This modelling philosophy is also the conceptual foundation of the current LotSizingDataModel software development, whose objective is to provide an extensible object-oriented representation of lot-sizing instances independently of the algorithms used to solve them.
Selected publications
Journal articles and conference papers directly related to this research area.
Optimisation d’un modèle de planification tactique d’une chaîne logistique de type Flow Shop Hybride
Michael Comelli, David Lemoine
e-revue des Sciences et Technologies de l'AutomatiqueOptimisation des flux physiques pour la planification d’une Supply Chain dans un contexte industriel
Michael Comelli, David Lemoine
ROADEF 2007A review of tactical planning models
Michael Comelli, Michel Gourgand, David Lemoine
IEEE/ICSSSM06Software tool for the master production schedule conception based on the Capacitated Lot Sizing Problem
Nathalie Grangeon, Michel Gourgand, David Lemoine, Sylvie Norre
International Conference on Automated Planning & SchedulingSoftware, datasets & repositories
Reusable research outputs managed in the central Software catalogue and linked to this Research Area.
LotSizingDataModel
C# data model and core library for lot-sizing problems.
ULSAlgorithms
High-performance C# algorithms and formulations for the uncapacitated lot-sizing problem (ULS).