MIP models and exact solution approaches for the discrete lot-sizing and scheduling problem
Tuesday 9 March 2010 at 12.30 PM by jcdubacq
Séminaire OCAD (C. Gicquel)
Tuesday 9 March 2010 at 12.30 PM
Location: B311, LIPN, LIPN — Duration: one hour
L’équipe OCAD accueille Céline Gicquel (post-doctorant, Laboratoire génie industriel, École Centrale Paris).
Nowadays, industrial companies increasingly find that they must rely on effective supply chains to successfully compete in the global market and networked economy. In particular, production planning plays a major role in supply chain management due to its strong impact on customer service quality and company profitability. Among the most challenging problems to be solved within the production planning process are the decisions on the size and schedule of production lots.
We first provide a basic introduction on lot-sizing problems, as well as a brief overview of the lot-sizing literature. We then focus on a variant of lot-sizing problem known as the discrete lot-sizing and scheduling problem and investigate the integration of two relevant industrial concerns into the basic problem. More precisely, we consider the following operational aspects: the case of sequence-dependent start-up costs and the presence of identical parallel resources.
Both variants are difficult discrete optimization problems which can be modelled as mixed-integer linear programs. We propose, for each of them, an exact solution approach based on the use of tight MILP formulations.