Capacitated dynamic lot sizing with capacity acquisition

Li, Hongyan; Meissner, Joern

doi:10.1080/00207543.2010.518991

Cited by 12 publications

(7 citation statements)

References 27 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Lot size models (Manne 1958;Gicquel, Minoux, and Dallery 2011;Li and Meissner 2011) that assume batch processing in contrast to continuous assembly line methods are beyond the interests of the paper. Other analytical models (Modigliani and Hohn 1955;Veinott 1964) apply different algorithms to solve a non-linear objective function.…”

Section: Literature Reviewmentioning

confidence: 99%

Convex optimisation for aggregate production planning

Bushuev

2013

International Journal of Production Research

View full text Add to dashboard Cite

This paper presents a new solution approach to the problem of aggregate production planning (APP). As identified by many researchers, the APP cost function is convex and piecewise. Thus, the convex optimisation approach can be applied to the APP problem. Solving the APP problem using convex optimisation is attractive since it leads to an improved solution over the classical solution methods and it can be applied to a wider range of functions. The classical Linear Decision Rule model of APP is solved using convex optimisation and the resulting solution is compared to three solution approaches which have been historically used to solve this model. The results suggest that convex optimisation may be an effective approach for solving certain types of planning models. IntroductionIn general, production is a process of the transformation of inputs (raw materials, information, etc.) into finished products (goods or services). To effectively manage a large number of components of a manufacturing system, a considerable number of decisions should be made on several organisational levels. The taxonomy proposed by Anthony (1965) classifies managerial decisions into three categories: strategic planning, tactical planning and operations control. This taxonomy has been used by many researchers (see e.g. Shim et al. 2002;Kempf, Keskinocak, and Uzsoy 2011).Strategic planning decisions have long-term implications and are affected by both internal and external information. Tactical planning is a middle-level activity which connects strategic planning and operations control. For tactical planning, the basic problem to be resolved is the allocation of resources such as capacity, work force availability, storage and resource distribution over a medium range planning horizon. Operations control decisions deal with short-term operational and scheduling problems which require complete disaggregation of the information generated at higher levels of the taxonomy. At the tactical level, aggregate production planning (APP) models are concerned with determining the production rate and work force level that should be set over a given horizon in order to meet the total demand and minimise the total expected cost (Kempf, Keskinocak, and Uzsoy 2011).All APP techniques face a problem of trade-off between the accuracy of the model in capturing the relevant features of the production-planning environment and the resulting model complexity (Nam and Logendran 1992). The accuracy means that the model precisely describes the problem. The complexity implies that an optimal solution algorithm of solving the model exists and small changes in the model will not require a new algorithm. Some of APP models are not accurate, because they assume linear or quadratic cost function which does not match the data (Groff and Muth 1972; Kempf, Keskinocak, and Uzsoy 2011). Other APP models use algorithms that do not fit the complexity requirement or do not guarantee an optimal solution. The above-mentioned problems are one of the main reasons why APP techniques are not...

show abstract

Section: Literature Reviewmentioning

confidence: 99%

Convex optimisation for aggregate production planning

Bushuev

2013

International Journal of Production Research

View full text Add to dashboard Cite

show abstract

“…They allow for multiple exchanges during a macro time period and show that it is beneficial to share the resource over all plants which also gives a better resource utilization ratio. Li and Meissner (2010) analyze the optimal investment in capacity. Their model bases on the single item capacitated lot sizing problem (CLSP).…”

Section: Integrated Production and Distribution Planning Approachesmentioning

confidence: 99%

Integrated Production Lot Size and Distribution Planning with Shared Warehouses

Pahl

2019

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Collaboration in supply chains (SCs) is steadily improving especially due to advanced information systems that provide transparency over resource allocation, utilization, and dynamic demands. We are examining the case of shared inventory spaces in SCs where utilization of storage spaces depend on all SC partners. Decisions that need to be made are when to produce how much of multiple products and where and how long to store them in order to fulfill known customer demands. Therefore, we take production, inventory control and placement, as well as distribution (logistics) decisions into consideration. Special emphasis is made on setup considerations for detailed production sequencing. We analyze this integrated approach that leads to reduced overall SC costs and extends the literature to the view of shared resources that become increasingly prominent with the developments of Industry 4.0. solutions.

show abstract

“…We show (see Section 4 and Appendix) that the same problem can be solved with a reduced time complexity of O(T log T ) in case of infinite subcontracting costs. Note that Li and Meissner [Li and Meissner, 2011] also study an integrated lot sizing and capacity acquisition problem in which subcontracting is not allowed but, in contrast to our work, they assume timeindependent fixed-charge production costs and focus on developing a heuristic polynomial time algorithm rather than an exact polynomial time algorithm. In the literature one can find many papers dealing with capacity planning in supply chains, but most of them focus on strategic decisions such as integrated facility location and capacity planning.…”

Section: Literature Reviewmentioning

confidence: 99%