http://cepac.cheme.cmu.edu/pasi2011/library/maravelias/Stadtler.2005.EurOR.SCMOverview.pdf

Supply chain management and advanced planning : basics, overview and challenges

In this paper we give an overview of recent developments in the field of modeling deterministic single-level dynamic lot sizing problems. The focus of this paper is on the modeling of various industrial extensions and not on the solution approaches. The timeliness of such a review stems from the growing industry need to solve more realistic and comprehensive production planning problems. First, several different basic lot sizing problems are defined. Many extensions of these problems have been proposed and the research basically expands in two opposite directions. The first line of research focuses on modeling the operational aspects in more detail. The discussion is organized around five aspects: the set ups, the characteristics of the production process, the inventory, demand side and rolling horizon. The second direction is towards more tactical and strategic models in which the lot sizing problem is a core substructure, such as integrated production-distribution planning or supplier selection. Recent advances in both directions are discussed. Finally, we give some concluding remarks and point out interesting areas for future research.

/pdf/modeling-industrial-lot-sizing-problems-a-review-vruq0a6m3b.pdf

Modeling Industrial Lot Sizing Problems: A Review

http://cepac.cheme.cmu.edu/pasi2011/library/maravelias/Maravelias.2009.CACE.Integration.bak

Integration of production planning and scheduling: Overview, challenges and opportunities

This paper presents a review of four decades of research on dynamic lot-sizing with capacity constraints. We discuss both different modeling approaches to the optimization problems and different algorithmic solution approaches. The focus is on research that separates the lot-sizing problem from the detailed sequencing and scheduling problem. Our conceptional point of reference is the multi-level capacitated lot-sizing problem (MLCLSP). We show how different streams of research emerged over time. One result is that many practically important problems are still far from being solved in the sense that they could routinely be solved close to optimality in industrial practice. Our review also shows that currently mathematical programing and the use of metaheuristics are particularly popular among researchers in a vivid and flourishing field of research.

Dynamic capacitated lot-sizing problems: a classification and review of solution approaches

This paper provides an overview of the key contributions within the planning and scheduling communities with specific emphasis on uncertainty analysis. As opposed to focusing in one particular industry, several independent sectors have been reviewed in order to find commonalities and potential avenues for future interdisciplinary collaborations. The objectives and physical constraints present within the planning and scheduling problems may vary greatly from one sector to another; however, all problems share the common attribute of needing to model parameter uncertainty in an explicit manner. It will be demonstrated through the literature review that two-stage stochastic programming, parametric programming, fuzzy programming, chance constraint programming, robust optimization techniques, conditional value-at-risk, and other risk mitigation procedures have found widespread application within all of the analyzed sectors. This review is the first work which attempts to provide a comprehensive description of t...

Planning and Scheduling under Uncertainty: A Review Across Multiple Sectors

In this paper a new mixed integer programming (MIP) model formulation and its incorporation into a time-oriented decomposition heuristic for the capacitated lot-sizing problem with linked lot sizes (CLSPL) is proposed. The solution approach is based on an extended model formulation and valid inequalities to yield a tight formulation. Extensive computational tests prove the capability of this approach and show a superior solution quality with respect to other solution algorithms published so far.

https://www.jstor.org/stable/info/4133935

The Capacitated Lot-Sizing Problem with Linked Lot Sizes

Modeling of period overlapping setup times

The capacitated lot-sizing problem with linked lot-sizes

The planning and scheduling of chemical plants still leaves several opportunities for optimization. Therefore, many authors have made contributions to this field, resulting in generally two modeling paradigms:  continuous time and discrete time model formulations. As both modeling approaches have their advantages, the model formulation presented here is based on a discrete time scale while, at the same time, taking aspects of time continuity into account. It is shown that the proposed modeling approach compares favorably with three model formulations from the literature. Furthermore, a closer evaluation shows that all these benchmarks suffer from minor flaws.

Christopher Suerie

Papers

The Capacitated Lot-Sizing Problem with Linked Lot Sizes

Modeling of period overlapping setup times

The capacitated lot-sizing problem with linked lot-sizes

Planning and Scheduling with Multiple Intermediate Due Dates-An Effective Discrete Time Model Formulation

The Capacitated lot-sizing problem with linked lot sizes