﻿ Computationally Efficient Problem Reformulations for Capacitated Lot Sizing Problem

American Journal of Operations Research
Vol.08 No.04(2018), Article ID:86022,11 pages
10.4236/ajor.2018.84018

Computationally Efficient Problem Reformulations for Capacitated Lot Sizing Problem

Renduchintala Raghavendra Kumar Sharma, Priyank Sinha, Mananjay Kumar Verma

Industrial and Management Engineering Department, IIT Kanpur, Kanpur, India    Received: June 11, 2018; Accepted: July 15, 2018; Published: July 18, 2018

ABSTRACT

In this article, we propose novel reformulations for capacitated lot sizing problem. These reformulations are the result of reducing the number of variables (by eliminating the backorder variable) or increasing the number of constraints (time capacity constraints) in the standard problem formulation. These reformulations are expected to reduce the computational time complexity of the problem. Their computational efficiency is evaluated later in this article through numerical analysis on randomly generated problems.

Keywords:

Capacitated Lot Sizing Problem, Efficient Problem Formulation, Branch and Bound 1. Introduction

Lot sizing problem aims to optimally utilize the available production resources while meeting the demand targets. It is classified as medium-term planning in production planning taxonomy. Lot sizing problem formulation depends upon the layout and the operating constraints in the production system. In the manufacturing industry, we come across many types of production systems. These production systems further give rise to different types of lot sizing problems (with different constraints and operating conditions) and their solution methodologies. Hence there is a rich literature on lot sizing problem and their solution methods. In this article, we restrict our discussion to general dynamic multi-level capacitated lot sizing problem.

This problem was first proposed by Billington et al.  . It addresses the following scenario: a finite planning horizon is given and is divided into discrete time periods. There is a dynamic demand for items which needs to be satisfied for each time period while honoring the production capacity constraints. Problem aims to develop a production plan over all time periods while minimizing the total cost comprising of setup cost, inventory cost, and backordering cost.

A capacitated lot sizing problem is a well-known NP-hard problem. If the capacity constraints of the problem are relaxed, then the problem can be solved in polynomial time  . Many model formulations have been proposed to develop an efficient numerical solution. These formulations differ with each other due to variables and constraints used. Formulations given in this article belongs to inventory and lot-size (I & L) formulations category, which are among the most popular in the literature due to their computational efficiency. These formulations use production quantity and inventory levels as the variables. Relaxation of each constraint in the standard I&L model affects the problem structure and hence its numerical complexity. Relaxation of capacity constraints decomposes CLSP into single-level lot sizing problem popularly known as Wagner-Whitin problem  . Further, some popular extensions to the standard problem have been suggested in the literature, to address certain practical issues. For example, Dillenberger et al.  have extended the problem to incorporate setup carryover. A setup cost and setup time are not incurred if the same item is being produced in the next time period, carried forward by the previous period. Our formulation incorporates binary variable for setup to address these issues. Binary setup variable to address the carryover of setup to the next period was earlier used by Hasse  , and Surie and Stadtler  .

We next discuss certain problem reformulations from the literature which are computationally efficient. CLSP can be formulated to assign each production quantity to a demand in a specific time period while minimizing the production cost. Shortest route formulation was proposed by Eppen and Martin  for a single level case. It was later extended by Tempelemier and Helber  for multi-level CLSP. Stadtler proposed an improvement in this formulation (   ), which decreases the number of non-negative coefficients. Rosling  introduced a formulation based on Plant location problem analogy. This formulation was further extended by Maes et al.  for the capacitated case of a lot-sizing problem. Capacity constraints were included in the original formulation for this purpose. Equivalence of Shortest route and SPL formulation in terms of objective function was shown by Denizel et al.  .

Apart from reformulation, additional inequalities can be added to the problem formulation to tighten the bound while reducing the search space. Important researches in this category are discussed next. Barany et al.  included lot sizing and inventory variables for the single level uncapacitated lot-sizing problem. Additional valid constraints are included in the formulation to tighten the convex bound of the uncapacitated lot-sizing problem. Pochet and Wolsey  ; and Clark and Armentano  extended the work of Barany  for the multi-level case. Miller et al.  have proposed additional valid inequalities for the capacitated case of a lot-sizing problem. Further Surie and Stadtler  have proposed valid inequalities for multi-level capacitated lot sizing problem with set up carry over. Setup carryover constraints are redefined to achieve a computational advantage in this formulation.

Research in this article is based on the appropriate reformulation of the standard capacitated lot sizing problem. We state the standard problem formulation and then derive three reformulations of the problem by eliminating the backordering variable or/and adding two capacity constraints. Efficacies of these formulations in terms of reduced computational complexity are demonstrated through numerical analysis of random problems on GAMS.

2. Research Methodology

As stated in the previous section, we intend to evaluate the improvement in computational efficiency of the model when the number of decision variables are decreased, or constraints are added to tighten the bound of the solution space. Model A1 is the reference standard model, which is tinkered to develop model A2, A3, and A4 accordingly. In model A2 (proposed later), we have eliminated the backordering variable; hence it is expected to be computationally efficient when compared with model A1. Similarly, we have added two extra constraints (Equation (27), Equation (28)) in our standard model (A1) which is referred to as model A3. Further, we eliminate backordering variable while adding two constraints in model A1 and refer it to model A4. Hence model A4 is expected to perform best among all. Efficacy of each model is evaluated by performing paired t-test of the computational time of random problem instances on A1, A2, A3, and A4. Branch and bound method is used in GAMS for solving random problem optimally by these models. Finally it is concluded in section 6 that most computationally efficient formulation should be used solving capacitated lot sizing problem.

3. Problem Formulation/Reformulation

Table 1. Notations used in the model.

3.1. Model A1

$\text{Minimize}\text{\hspace{0.17em}}Z=\underset{i=1}{\overset{I}{\sum }}\underset{t=1}{\overset{T}{\sum }}\left[C{P}_{it}*X{P}_{it}+C{S}_{it}*Y{S}_{it}+CIN{V}_{it}*XIN{V}_{it}+CB{O}_{it}*XB{O}_{it}\right]$ (1)

Subject to:

$X{P}_{it}+XIN{V}_{i,t-1}+XB{O}_{it}={D}_{it}+XIN{V}_{it}+XB{O}_{i,t-1}\text{\hspace{0.17em}}\text{\hspace{0.17em}}\text{\hspace{0.17em}}\forall i\in I,t\in T$ (2)

$\underset{i=1}{\overset{I}{\sum }}\left(P{T}_{it}*X{P}_{it}+S{T}_{i}*Y{S}_{it}\right)\le CAP{T}_{t}\text{\hspace{0.17em}}\text{\hspace{0.17em}}\text{\hspace{0.17em}}\text{\hspace{0.17em}}\forall t\in T$ (3)

$\underset{i=1}{\overset{I}{\sum }}\left(P{T}_{it}*{D}_{it}+S{T}_{i}*Y{S}_{it}\right)\le CAP{T}_{t}\text{\hspace{0.17em}}\text{\hspace{0.17em}}\text{\hspace{0.17em}}\text{\hspace{0.17em}}\forall t\in T$ (4)

$X{P}_{it}\le CA{P}_{it}Y{S}_{it}\text{\hspace{0.17em}}\text{\hspace{0.17em}}\text{\hspace{0.17em}}\text{\hspace{0.17em}}\forall i\in I,t\in T$ (5)

$\underset{t=1}{\overset{T}{\sum }}X{P}_{it}\ge \underset{t=1}{\overset{T}{\sum }}{D}_{it}\text{\hspace{0.17em}}\text{\hspace{0.17em}}\text{\hspace{0.17em}}\text{\hspace{0.17em}}\forall i\in I$ (6)

$XIN{V}_{i0}=0\text{\hspace{0.17em}}\text{\hspace{0.17em}}\text{\hspace{0.17em}}\text{\hspace{0.17em}}\forall i\in I$ (7)

$XIN{V}_{iT}=0\text{\hspace{0.17em}}\text{\hspace{0.17em}}\text{\hspace{0.17em}}\text{\hspace{0.17em}}\forall i\in I$ (8)

$XB{O}_{i0}=0\text{\hspace{0.17em}}\text{\hspace{0.17em}}\text{\hspace{0.17em}}\text{\hspace{0.17em}}\forall i\in I$ (9)

$XB{O}_{iT}=0\text{\hspace{0.17em}}\text{\hspace{0.17em}}\text{\hspace{0.17em}}\text{\hspace{0.17em}}\forall i\in I$ (10)

$Y{S}_{it}\in \left\{0,1\right\}\text{\hspace{0.17em}}\text{\hspace{0.17em}}\text{\hspace{0.17em}}\text{\hspace{0.17em}}\forall i\in I,t\in T$ (11)

$XIN{V}_{it},X{P}_{it},XB{O}_{it}\ge 0\text{\hspace{0.17em}}\text{\hspace{0.17em}}\text{\hspace{0.17em}}\text{\hspace{0.17em}}\forall i\in I,t\in T$ (12)

3.2. Model A2

$\begin{array}{l}\text{Minimize}\text{\hspace{0.17em}}Z=\underset{i=1}{\overset{I}{\sum }}\underset{t=1}{\overset{T}{\sum }}\left[C{P}_{it}*X{P}_{it}+C{S}_{it}*Y{S}_{it}+CIN{V}_{it}*XIN{V}_{it}\right]\\ \text{\hspace{0.17em}}\text{\hspace{0.17em}}\text{\hspace{0.17em}}\text{\hspace{0.17em}}\text{\hspace{0.17em}}\text{\hspace{0.17em}}\text{\hspace{0.17em}}\text{\hspace{0.17em}}\text{\hspace{0.17em}}\text{\hspace{0.17em}}\text{\hspace{0.17em}}\text{\hspace{0.17em}}\text{\hspace{0.17em}}\text{\hspace{0.17em}}\text{\hspace{0.17em}}\text{\hspace{0.17em}}\text{\hspace{0.17em}}\text{\hspace{0.17em}}\text{\hspace{0.17em}}\text{\hspace{0.17em}}\text{ }+\underset{{t}_{1}=1}{\overset{T}{\sum }}\underset{i=1}{\overset{I}{\sum }}CB{O}_{i{t}_{1}}*\left(\underset{t=1}{\overset{{t}_{1}}{\sum }}{D}_{it}+XIN{V}_{i{t}_{1}}-\underset{t=1}{\overset{{t}_{1}}{\sum }}X{P}_{it}\right)\end{array}$ (13)

Subject to:

$\underset{t=1}{\overset{{t}_{1}}{\sum }}{D}_{it}+XIN{V}_{i{t}_{1}}-\underset{t=1}{\overset{{t}_{1}}{\sum }}X{P}_{it}\ge 0\text{\hspace{0.17em}}\text{\hspace{0.17em}}\text{\hspace{0.17em}}\text{\hspace{0.17em}}\forall i\in I,{t}_{1}\in T$ (14)

$\underset{i=1}{\overset{I}{\sum }}\left(P{T}_{it}*X{P}_{it}+S{T}_{i}*Y{S}_{it}\right)\le CAP{T}_{t}\text{\hspace{0.17em}}\text{\hspace{0.17em}}\text{\hspace{0.17em}}\text{\hspace{0.17em}}\forall t\in T$ (15)

$X{P}_{it}\le CA{P}_{it}Y{S}_{it}\text{\hspace{0.17em}}\text{\hspace{0.17em}}\text{\hspace{0.17em}}\text{\hspace{0.17em}}\forall i\in I,t\in T$ (16)

$\underset{t=1}{\overset{T}{\sum }}X{P}_{it}\ge \underset{t=1}{\overset{T}{\sum }}{D}_{it}\text{\hspace{0.17em}}\text{\hspace{0.17em}}\text{\hspace{0.17em}}\text{\hspace{0.17em}}\forall i\in I$ (17)

$XIN{V}_{i0}=0\text{\hspace{0.17em}}\text{\hspace{0.17em}}\text{\hspace{0.17em}}\text{\hspace{0.17em}}\forall i\in I$ (18)

$XIN{V}_{iT}=0\text{\hspace{0.17em}}\text{\hspace{0.17em}}\text{\hspace{0.17em}}\text{\hspace{0.17em}}\forall i\in I$ (19)

$Y{S}_{it}\in \left\{0,1\right\}\text{\hspace{0.17em}}\text{\hspace{0.17em}}\text{\hspace{0.17em}}\text{\hspace{0.17em}}\forall i\in I,t\in T$ (20)

$XIN{V}_{it},X{P}_{it}\ge 0\text{\hspace{0.17em}}\text{\hspace{0.17em}}\text{\hspace{0.17em}}\text{\hspace{0.17em}}\forall i\in I,t\in T$ (21)

3.3. Model A3

$\text{Minimize}\text{\hspace{0.17em}}Z=\underset{i=1}{\overset{I}{\sum }}\underset{t=1}{\overset{T}{\sum }}\left[C{P}_{it}*X{P}_{it}+C{S}_{it}*Y{S}_{it}+CIN{V}_{it}*XIN{V}_{it}+CB{O}_{it}*XB{O}_{it}\right]$ (22)

Subject to:

$X{P}_{it}+XIN{V}_{i,t-1}+XB{O}_{it}={D}_{it}+XIN{V}_{it}+XB{O}_{i,t-1}\text{\hspace{0.17em}}\text{\hspace{0.17em}}\text{\hspace{0.17em}}\text{\hspace{0.17em}}\forall i\in I,t\in T$ (23)

$\underset{i=1}{\overset{I}{\sum }}\left(P{T}_{it}*X{P}_{it}+S{T}_{i}*Y{S}_{it}\right)\le CAP{T}_{t}\text{\hspace{0.17em}}\text{\hspace{0.17em}}\text{\hspace{0.17em}}\text{\hspace{0.17em}}\forall t\in T$ (24)

$\underset{i=1}{\overset{I}{\sum }}\left(P{T}_{it}*{D}_{it}+S{T}_{i}*Y{S}_{it}\right)\le CAP{T}_{t}\text{\hspace{0.17em}}\text{\hspace{0.17em}}\text{\hspace{0.17em}}\text{\hspace{0.17em}}\forall t\in T$ (25)

$X{P}_{it}\le CA{P}_{it}Y{S}_{it}\text{\hspace{0.17em}}\text{\hspace{0.17em}}\text{\hspace{0.17em}}\text{\hspace{0.17em}}\forall i\in I,t\in T$ (26)

$\underset{i=1}{\overset{I}{\sum }}\underset{t=1}{\overset{T}{\sum }}\left(P{T}_{it}*{D}_{it}+S{T}_{i}*Y{S}_{it}\right)\le \underset{t=1}{\overset{T}{\sum }}CAP{T}_{t}$ (27)

$\underset{i=1}{\overset{I}{\sum }}\underset{t=1}{\overset{T}{\sum }}\left(P{T}_{it}*X{P}_{it}+S{T}_{i}*Y{S}_{it}\right)\le \underset{t=1}{\overset{T}{\sum }}CAP{T}_{t}$ (28)

$\underset{t=1}{\overset{T}{\sum }}X{P}_{it}\ge \underset{t=1}{\overset{T}{\sum }}{D}_{it}\text{\hspace{0.17em}}\text{\hspace{0.17em}}\text{\hspace{0.17em}}\text{\hspace{0.17em}}\forall i\in I$ (29)

$XIN{V}_{i0}=0\text{\hspace{0.17em}}\text{\hspace{0.17em}}\text{\hspace{0.17em}}\text{\hspace{0.17em}}\forall i\in I$ (30)

$XIN{V}_{iT}=0\text{\hspace{0.17em}}\text{\hspace{0.17em}}\text{\hspace{0.17em}}\text{\hspace{0.17em}}\forall i\in I$ (31)

$XB{O}_{i0}=0\text{\hspace{0.17em}}\text{\hspace{0.17em}}\text{\hspace{0.17em}}\text{\hspace{0.17em}}\forall i\in I$ (32)

$XB{O}_{iT}=0\text{\hspace{0.17em}}\text{\hspace{0.17em}}\text{\hspace{0.17em}}\text{\hspace{0.17em}}\forall i\in I$ (33)

$Y{S}_{it}\in \left\{0,1\right\}\text{\hspace{0.17em}}\text{\hspace{0.17em}}\text{\hspace{0.17em}}\text{\hspace{0.17em}}\forall i\in I,t\in T$ (34)

$XIN{V}_{it},X{P}_{it},XB{O}_{it}\ge 0\text{\hspace{0.17em}}\text{\hspace{0.17em}}\text{\hspace{0.17em}}\text{\hspace{0.17em}}\forall i\in I,t\in T$ (35)

3.4. Model A4

$\begin{array}{l}\text{Minimize}\text{\hspace{0.17em}}Z=\underset{i=1}{\overset{I}{\sum }}\underset{t=1}{\overset{T}{\sum }}\left[C{P}_{it}*X{P}_{it}+C{S}_{it}*Y{S}_{it}+CIN{V}_{it}*XIN{V}_{it}\right]\\ \text{\hspace{0.17em}}\text{\hspace{0.17em}}\text{\hspace{0.17em}}\text{\hspace{0.17em}}\text{\hspace{0.17em}}\text{\hspace{0.17em}}\text{\hspace{0.17em}}\text{\hspace{0.17em}}\text{\hspace{0.17em}}\text{\hspace{0.17em}}\text{\hspace{0.17em}}\text{\hspace{0.17em}}\text{\hspace{0.17em}}\text{\hspace{0.17em}}\text{\hspace{0.17em}}\text{\hspace{0.17em}}\text{\hspace{0.17em}}\text{\hspace{0.17em}}\text{\hspace{0.17em}}\text{\hspace{0.17em}}+\underset{{t}_{1}=1}{\overset{T}{\sum }}\underset{i=1}{\overset{I}{\sum }}CB{O}_{i{t}_{1}}*\left(\underset{t=1}{\overset{{t}_{1}}{\sum }}{D}_{it}+XIN{V}_{i{t}_{1}}-\underset{t=1}{\overset{{t}_{1}}{\sum }}X{P}_{it}\right)\end{array}$ (36)

Subject to:

$\underset{t=1}{\overset{{t}_{1}}{\sum }}{D}_{it}+XIN{V}_{i{t}_{1}}-\underset{t=1}{\overset{{t}_{1}}{\sum }}X{P}_{it}\ge 0\text{\hspace{0.17em}}\text{\hspace{0.17em}}\text{\hspace{0.17em}}\text{\hspace{0.17em}}\forall i\in I,{t}_{1}\in T$ (37)

$\underset{i=1}{\overset{I}{\sum }}\left(P{T}_{it}*X{P}_{it}+S{T}_{i}*Y{S}_{it}\right)\le CAP{T}_{t}\text{\hspace{0.17em}}\text{\hspace{0.17em}}\text{\hspace{0.17em}}\text{\hspace{0.17em}}\forall t\in T$ (38)

$X{P}_{it}\le CA{P}_{it}Y{S}_{it}\text{\hspace{0.17em}}\text{\hspace{0.17em}}\text{\hspace{0.17em}}\text{\hspace{0.17em}}\forall i\in I,t\in T$ (39)

$\underset{i=1}{\overset{I}{\sum }}\underset{t=1}{\overset{T}{\sum }}\left(P{T}_{it}*{D}_{it}+S{T}_{i}*Y{S}_{it}\right)\le \underset{t=1}{\overset{T}{\sum }}CAP{T}_{t}$ (40)

$\underset{i=1}{\overset{I}{\sum }}\underset{t=1}{\overset{T}{\sum }}\left(P{T}_{it}*X{P}_{it}+S{T}_{i}*Y{S}_{it}\right)\le \underset{t=1}{\overset{T}{\sum }}CAP{T}_{t}$ (41)

$\underset{t=1}{\overset{T}{\sum }}X{P}_{it}\ge \underset{t=1}{\overset{T}{\sum }}{D}_{it}\text{\hspace{0.17em}}\text{\hspace{0.17em}}\text{\hspace{0.17em}}\text{\hspace{0.17em}}\forall i\in I$ (42)

$XIN{V}_{i0}=0\text{\hspace{0.17em}}\text{\hspace{0.17em}}\text{\hspace{0.17em}}\text{\hspace{0.17em}}\forall i\in I$ (43)

$XIN{V}_{iT}=0\text{\hspace{0.17em}}\text{\hspace{0.17em}}\text{\hspace{0.17em}}\text{\hspace{0.17em}}\forall i\in I$ (44)

$Y{S}_{it}\in \left\{0,1\right\}\text{\hspace{0.17em}}\text{\hspace{0.17em}}\text{\hspace{0.17em}}\text{\hspace{0.17em}}\forall i\in I,t\in T$ (45)

$XIN{V}_{it},X{P}_{it}\ge 0\text{\hspace{0.17em}}\text{\hspace{0.17em}}\text{\hspace{0.17em}}\text{\hspace{0.17em}}\forall i\in I,t\in T$ (46)

Problem notations are tabulated in Table 1. Equation (1), Equation (13), Equation (22), and Equation (36) minimize the total production cost of the system in model A1, A2, A3, and A4 respectively. Equation (2), Equation (14), Equation (23), and Equation (37) are the state equations as they ensure that the total quantities in a particular time period is a function of total quantities carried forward from the preceding time period while satisfying demand. It must be noted that in model A2 and A4, the backorder variable has been eliminated from the model by appropriate substitution (backorder variable $XB{O}_{it}$ , has been eliminated by substituting it in terms of other decision variables from Equation (2). Its value has been substituted in the objective function Equation (13) in model A2 and objective function Equation (36) in model A4). These changes are reflected in Equation (23) and Equation (37). Reduction in number of variables improves the time complexity of the model. Equation (3), Equation (4), Equation (15), Equation (24), Equation (25), Equation (38), Equation (40), and Equation (41) are the time capacity constraints. They ensure that production of the items, and demand satisfied (through production) in a particular time period does not violate the production time available in that time period. Similarly, Equation (5), Equation (16), Equation (26), and Equation (39) are the production capacity constraints. These constraints ensures that capacity constraints in terms of production resources are not violated in any time period. Equation (27), Equation (28), Equation (40), and Equation (41) are the additional capacity constraints added in model A3, and A4 for tightening the bound and subsequently achieving computational advantage as discussed earlier. These constraints are derived from constraint Equation (24) and Equation (25) by extending the time capacity constraints over the entire time horizon T. It must be noted that Equation (24) and Equation (25) ensures the time capacity constraints are honored only for individual time period. Equation (6), Equation (17), Equation (29), and Equation (42) ensures that demand is satisfied in each period. Equations (7)-(10), Equation (18), Equation (19), Equations (30)-(33), Equation (43), Equation (44) sets the initial and final conditions (boundary conditions) over the production horizon. Equation (11), Equation (12), Equation (20), Equation (21), Equation (34), Equation (35), Equation (45), Equation (46) are the binary and non-negativity constraints for decision variables.

4. Numerical Experiments

40 problems each of size 5 × 5 and 6 × 6 are randomly generated in GAMS. 5 × 5, 6 × 6 problems denotes the lot sizing problem to find an optimum production plan of 5 items over 5 time periods, and 6 items over 6 time periods respectively. Only feasible problems are retained for data analysis (6 × 6―29 problems, 5 × 5―31 problems). Value of constants in these problems is randomly generated according to normal distribution (Table 2) and uniform distribution (Table 3).

Table 2. Random data generation (Normal distribution).

Table 3. Random data generation (Uniform Distribution).

5. Data Analysis

All the problems are implemented in GAMS. Solution to these sample problems are tabulated in Appendix. According to t-test performed on data, problem A3 is computationally efficient to problem A1 with a statistical significance of 0.009317 (p-value). Similarly A4 is better than A2 with a statistical significance of 0.003071 (p-value). Model A2 is computationally more efficient than model A1 with a statistical significance of 0.000695 (p-value). Model A4 is computationally more efficient than model A3 with a statistical significance of 0.00473 (p-value).

6. Conclusion

In this article, we have demonstrated the effect of reducing the number of variables, increasing the number of constraints on the computational time of lot sizing problem through 4 models. We infer from our data analysis that model A4 is the most computationally efficient model, and hence is recommended to be used for solving capacitated lot sizing problem.

Cite this paper

Sharma, R.R.K., Sinha, P. and Verma, M.K. (2018) Computationally Efficient Problem Reformulations for Capacitated Lot Sizing Problem. American Journal of Operations Research, 8, 312-322. https://doi.org/10.4236/ajor.2018.84018

References

1. 1. Billington, P.J., McClain, J.O. and Joseph Thomas, L. (1983) Mathematical Programming Approaches to Capacity-Constrained MRP Systems: Review, Formulation and Problem Reduction. Management Science, 29, 1126-1141. https://doi.org/10.1287/mnsc.29.10.1126

2. 2. Wagner, H.M. and Whitin, T.M. (1958) Dynamic Version of the Economic Lot Size Model. Management Science, 5, 89-96. https://doi.org/10.1287/mnsc.5.1.89

3. 3. Dillenberger, C., Escudero, L.F., Wollensak, A. and Zhang, W. (1993) On Solving a Large-Scale Resource Allocation Problem in Production Planning. Operations Research in Production Planning and Control, Springer, Berlin, 105-119. https://doi.org/10.1007/978-3-642-78063-9_7

4. 4. Haase, K. (2012) Lotsizing and Scheduling for Production Planning. Vol. 408, Springer Science & Business Media.https://books.google.co.in/books?hl=en&lr=&id=QVL-CAAAQBAJ&oi=fnd&pg=PA1&dq=Lot sizing+and+scheduling+for+production+planning&ots=HSTSWCFLRT&sig=nDlJCwQpjGkD0DPW ZUGI2RMa3Kg#v=onepage&q=Lotsizing%20and%20scheduling%20for%20production%20pl anning&f=false

5. 5. Suerie, C. and Stadtler, H. (2003) The Capacitated Lot-Sizing Problem with Linked Lot Sizes. Management Science, 49, 1039-1054. https://doi.org/10.1287/mnsc.49.8.1039.16406

6. 6. Eppen, G.D. and Kipp Martin, R. (1987) Solving Multi-Item Capacitated Lot-Sizing Problems Using Variable Redefinition. Operations Research, 35, 832-848. https://doi.org/10.1287/opre.35.6.832

7. 7. Tempelmeier, H. and Helber, S. (1994) A Heuristic for Dynamic Multi-Item Multi-Level Capacitated Lotsizing for General Product Structures. European Journal of Operational Research, 75, 296-311. https://doi.org/10.1016/0377-2217(94)90076-0

8. 8. Stadtler, H. (1996) Mixed Integer Programming Model Formulations for Dynamic Multi-Item Multi-Level Capacitated Lotsizing. European Journal of Operational Research, 94, 561-581. https://doi.org/10.1016/0377-2217(95)00094-1

9. 9. Stadtler, H. (1997) Reformulations of the Shortest Route Model for Dynamic Multi-Item Multi-Level Capacitated Lotsizing. Operations-Research-Spektrum, 19, 87-96. https://doi.org/10.1007/BF01545506

10. 10. Rosling, K. (1986) Optimal Lot-Sizing for Dynamic Assembly Systems. Multi-Stage Production Planning and Inventory Control, Springer, Berlin, 119-131. https://doi.org/10.1007/978-3-642-51693-1_7

11. 11. Maes, J., McClain, J.O. and Van Wassenhove, L.N. (1991) Multilevel Ca-pacitated Lotsizing Complexity and LP-Based Heuristics. European Journal of Operational Research, 53, 131-148. https://doi.org/10.1016/0377-2217(91)90130-N

12. 12. Denizel, M., Tevhide Altekin, F., Süral, H. and Stadtler, H. (2008) Equivalence of the LP Relaxations of Two Strong Formulations for the Capacitated Lot-Sizing Problem with Setup Times. OR Spectrum, 30, 773-785. https://doi.org/10.1007/s00291-007-0094-3

13. 13. Barany, I., Van Roy, T.J. and Wolsey, L.A. (1984) Strong Formulations for Multi-Item Capacitated Lot Sizing. Management Science, 30, 1255-1261. https://doi.org/10.1287/mnsc.30.10.1255

14. 14. Pochet, Y. and Wolsey, L.A. (1991) Solving Multi-Item Lot-Sizing Problems Using Strong Cutting Planes. Management Science, 37, 53-67. https://doi.org/10.1287/mnsc.37.1.53

15. 15. Clark, P.W. and Armentano, L.E. (1997) Replacement of Alfalfa Neutral Detergent Fiber with a Combination of Nonforage Fiber Sources. Journal of Dairy Science, 80, 675-680. https://doi.org/10.3168/jds.S0022-0302(97)75986-1

16. 16. Miller, A.J., Nemhauser, G.L. and Savelsbergh, M.W.P. (2000) On the Capacitated Lot-Sizing and Continuous 0-1 Knapsack Polyhedra. European Journal of Operational Research, 125, 298-315. https://doi.org/10.1016/S0377-2217(99)00461-0

Appendix: Data Analysis Results

(a) (b)