An Aggregate Production Plan for a Biscuit Manufacturing Plant Using Integer Linear Programming ()

Dilishiya Kalpani De Silva^{}, Wasantha Bandara Daundasekara^{}

Department of Mathematics, Faculty of Science, University of Peradeniya, Peradeniya, Sri Lanka.

**DOI: **10.4236/oalib.1105743
PDF HTML XML
318
Downloads
888
Views
Citations

Department of Mathematics, Faculty of Science, University of Peradeniya, Peradeniya, Sri Lanka.

Effective planning, scheduling, and synchronization of all production activ-ities are the key responsibilities of the management of a manufacturing plant. Therefore, it is necessary for the management of the plant to design the production process so that the total production cost is minimized, subject to the available resources that cannot be compromised. In this study, a biscuit manufacturing plant is selected and an integer linear programming (ILP) model is formulated to determine aggregate number of batches that the plant should produce from each product per month so that monthly demand is satisfied with available resources. The objective is to minimize the monthly production cost of the plant. The required data were collected from the production plant for a period of one month, and then, the objective function and constraints were formulated. The management has given a paramount importance in satisfying the demand so that there will not be any unsatisfied customer. According to the managerial requirement, any feasible solution obtained by the model must satisfy the demand. Therefore, demand constraint is considered as a hard constraint. The management is forced to adjust the labour and machine requirements more frequently according to the monthly demand. Thus, labour and machine hour constraints are considered as soft constraints. Formulated ILP model was implemented as a spreadsheet model in Excel and solved using Excel Solver which uses the simplex algorithm and incorporates the integer requirement of the model when finding the optimal solution. Total available labour and machine hours can be changed within a particular range until a feasible solution is found. The solved model determines the number of batches to be produced from each product and the corresponding minimum cost per month. By implementing this production plan, manufacturing excess of biscuits can be avoided and hence utilizes the physical and human resources to the optimum manner. Additionally, the machine and labour idle times and the needed overtime hours can be identified using the solution while the additional overtime cost will be added to the monthly production cost.

Keywords

Integer Linear Programming, Soft Constraints, Hard Constraints, Spreadsheet Model, Excel Solver, Simplex Algorithm

Share and Cite:

De Silva, D. and Daundasekara, W. (2019) An Aggregate Production Plan for a Biscuit Manufacturing Plant Using Integer Linear Programming. *Open Access Library Journal*, **6**, 1-16. doi: 10.4236/oalib.1105743.

1. Introduction

Proper functioning of a manufacturing plant requires efficient planning, scheduling, and synchronization of all production activities. Thus, a production plan (PP) is an important part of a business plan that the manufacturing or production department is responsible for developing. It is necessary for the management of the plant to determine the total amount of output that the manufacturing plant should produce from each period in the planning horizon in order to satisfy the customer demand with the limited available resources in the plant. The output is generally expressed in terms of units of measurement such as tons, liters, kilograms and batches. A quantitative solution for the PP problem can be found in different ways. One method is to use a mathematical model to solve a PP problem. The applications of Operations Research (OR) are widely used in industrial sector due to its ability to optimize a given scenario resulting in maximum possible gain. In practical situations, linear programming is a part of a very essential area of mathematics termed “optimization techniques”. A mathematical model can be formulated using linear programming (LP) [1] with the objective of minimizing the cost or maximizing the profit without violating the constraints of limited resources and satisfying the demand constraint in order to determine the number of units to be produced from each item. Tingley [2] revealed that LP is a conventionally used technique. However, in order to apply LP to a production planning problem, the data input should be uniquely determined.

In this study, a quantitative approach is used by means of operations research to solve an aggregate production planning (APP) problem for a biscuit manufacturing plant. By implementing this production plan, manufacturing excess of biscuits can be avoided and hence utilizes the physical and human resources to the optimum manner. This can be achieved by building up a mathematical model using LP. LP is the procedure of taking different linear inequalities considering some situations and finding the best feasible solution subject to those requirements. Using LP techniques to solve PP problems accounts for vast amount of studies found in the literature [3] - [10] . In these studies, where LP techniques were used, many authors attempted to solve the APP problem. In APP, the aim is to obtain overall (aggregate) production quantities for each product. Other approaches such as goal programming have been used to solve the APP problem in the literature [11] [12] [13] . Since defining goals is a managerial decision, the problem is reduced to a linear programming problem. In real-world APP problems, the input data or parameters, such as demand, resources, cost and objective function are often uncertain (fuzzy) because some information is incomplete or unavailable. Therefore, Fuzziness is included in most models in previous studies to find a solution to APP [7] [8] [14] . Moreover, Wang and Fang [15] incorporated the fuzzy nature of parameters and presented a fuzzy linear programming method for solving the APP. However, the data such as cost and resources for this study were obtained from the manufacturing plant. The complexity of the problem reduces as the monthly demand is decided by the top management and informed the production managers at the beginning of each month. Thus, as mentioned earlier, an LP model can be developed to solve this PP problem considering only one month as the data input is uniquely determined. The aim of this study is to determine the number of batches to be produced from each product per month in order to satisfy the monthly demand with the available resources while minimizing the production cost. Owing to the fact that the plant does not produce partial batches, all the variables are restricted to be integers. Thus, in this study, an integer linear programming (ILP) model [16] is used to solve the PP problem. In our mathematical model all the decision variables are restricted to be integers. However, when only a set of variables are integers, the problem can be solved using mixed integer linear programming (MILP) problem [17] [18] .

If the plant has the capability of producing biscuits according to the monthly demand, based on their past experience, without using further quantitative analytical methods, then most of the biscuits will remain in the finished-goods stores for a longer period, before they are sent to the warehouses or other distributing areas. As a result, more often, by the time customer consumes the product, biscuits are reaching their expiration date, so that the moisture level of biscuits will be increased, the appearance and the colour may have changed, and the crispiness will be reduced. Once such low-quality products are released to the market, the goodwill of the customer regarding the product would be lost. An improved PP for the production plant is extremely important since a better production plan will reduce the time that the finished goods remain in the stores, thus, prevent the additional inventory costs and the quality of the product will be fresh by the time consumer consumes it. In addition, the product can be sent to the market according to the demand without unnecessary delays.

In the production process, the wet dough starts to process at the mixing and passes through different types of machineries in forming section such as lamination, gauge rolls, relaxing web, and moulding, and subsequently through oven, cooling web and stacking web. This is a continuous process and the plant has only one production line and therefore, parallel production is not possible (see Figure 1 for the production process). The plant is producing various types of products, which are mainly categorized as soft dough and hard dough biscuits. In addition, there are certain products, which are unique and need further manufacturing process such as oiling, creaming and flavouring. These deviations are taken into account when the mathematical model is formulated. The range of products that are produced in the plant is presented in Table 1. The table categorises the products as soft dough and hard dough and specifies the biscuits which use the additional processing; creaming and flavouring. Furthermore, the coefficients for both objective function and constraints are calculated to develop the mathematical model by considering the process of the biscuit plant.

2. Materials and Methods

A mathematical model to determine the number of batches to be produced from each item (see Table 1 for all the available products in this plant) was formulated using ILP with the objective of minimizing the cost without violating the

Figure 1. Production process.

Table 1. Range of products.

constraints of limited resources and satisfying the demand constraint. All the necessary data were collected and the coefficients corresponding to the objective and constraints were estimated as demonstrated in the following sections.

2.1. Formulating the Mathematical Model

Let x_{i} be the number of batches to be produced from the i^{th} product (P_{i}) per month, where
$i=1,2,\cdots ,11$ .

2.1.1. Objective

The objective is to minimize the monthly manufacturing cost of unpacked biscuits (baked biscuits, which are not packed but stacked into the bins). The production cost per kilogram of biscuits for unpacked biscuit was collected as raw data. It involves raw material cost, labour cost, fuel cost for the oven, electricity etc. After incorporating these costs, the objective function was formulated as follows:

Let C_{i} be the production cost per finished batch of the i^{th} product.

$\mathrm{min}Z={\displaystyle {\sum}_{i=1}^{11}{C}_{i}{x}_{i}}+OC$ ;

where C_{i} is the cost per batch of the i^{th} product and OC is the overtime cost.

The wastage produced in the process of biscuit manufacturing and weight losses at each section are illustrated in Table 2. Afterward, all the wastages and weight losses mentioned in Table 2 were reduced from the weight of the wet dough mixture. The model is developed and solved assuming that these are the only wastages that will occur in the production process. All the necessary data are exhibited in Table 3. It enumerates the weight of a baked biscuit batch (B_{i}). Given that the cost per kilogram (k_{i}) was collected as raw data, the cost per batch of the i^{th} product (C_{i}) can be calculated using the following formulas. The computations are done in Table 4.

Table 2. The wastage produced in the process of biscuit manufacturing and weight losses at each section.

Table 3. Weights of baked biscuit batches.

Table 4. Cost per batch for each product.

Table 5. Total demand for each product.

$\begin{array}{c}{B}_{i}=\text{Dough}\text{\hspace{0.17em}}\text{Weight}-\text{WasteinMixing}-\text{BakingLoss}\\ \text{\hspace{0.17em}}\text{\hspace{0.17em}}-\text{WasteinCooling}\&\text{Stacking}\end{array}$

$\begin{array}{c}{C}_{i}=\text{Productioncostperkilogramofbiscuits}\left({K}_{i}\right)\\ \text{\hspace{0.17em}}\text{\hspace{0.17em}}\times \text{Weightofabakedbiscuitbatch}\left({B}_{i}\right)\end{array}$ .

Hence, the objective function for the concerned problem can be written as:

$\begin{array}{c}\mathrm{min}Z=60468.64{x}_{1}+74518.83{x}_{2}+62009.32{x}_{3}+57964.79{x}_{4}\\ \text{\hspace{0.17em}}\text{\hspace{0.17em}}+58569.10{x}_{5}+56927.68{x}_{6}+112838.47{x}_{7}+95478.71{x}_{8}\\ \text{\hspace{0.17em}}\text{\hspace{0.17em}}+54530.73{x}_{9}+70916.14{x}_{10}+98859.62{x}_{11}\end{array}$ .

2.1.2. Constraints

Satisfying all constraints is essential for the feasibility. However, many models contain two categories of constraints: hard constraints that must be satisﬁed by any feasible solution and the soft constraints of different relative importance may or may not be satisﬁed. Hvolby and Steger-Jensen [19] discussed using soft constraints and hard constraints in production planning. The hard constraints stipulate the set of feasible solutions, and the soft constraints stipulate a function to be optimized in deciding between the feasible solutions. If both kinds of constraints exist in a model, soft constraints can be adjusted, until a feasible solution is found.

1) Hard Constraint

・ Demand constraint

The management has given utmost importance in satisfying the demand so that there will not be any unsatisfied customer. Any feasible solution obtained by the model must satisfy the demand. Therefore, for this study, demand constraint was considered as a hard constraint.

Since x_{i} is the number of batches to be produced from the i^{th} product, B_{i}x_{i} gives the total number of kilograms that have to be produced from the i^{th} product per month. This amount should be equal to the demand of each product (in kilograms) to satisfy the demand as the plant does not want to produce any excess amount of biscuits. Thus, the demand constraint, in general, can be written as follows:

${B}_{i}{x}_{i}\ge {D}_{i}$ for $i=1,2,\cdots ,11$ ;

where D_{i} is the monthly demand in kilograms for the i^{th} product.

The monthly demand is decided by the top management which is passed away to the biscuit plant at the beginning of every month. The demand is expressed as the number of boxes of biscuits needed for different stock keeping units (SKU) from each product. These data were collected from the manufacturing plant and monthly demand in kilograms for each product was calculated utilizing these data. Table 5 enumerates all the necessary calculations to find the total demand in kilograms per month from each product.

As illustrated in Table 1, the product types, Lemon Puff (P_{10}) and Chocolate cream (P_{11}) have a cream layer. Thus, in Table 6, the cream weight was reduced

Table 6. Biscuit weight without cream.

from the total demand which was calculated in Table 5 for P_{10} and P_{11} in order to calculate the total amount of baked biscuits that should be produced.

After calculating all the coefficient values and right-hand side values which are the requirements, the demand constraints for each product can be written as follows:

$403.12425{x}_{1}\ge 19769$

$560.2919625{x}_{2}\ge 15500$

$529.9942125{x}_{3}\ge 19200$

$499.6964625{x}_{4}\ge 21000$

$472.331475{x}_{5}\ge 18050$

$379.517875{x}_{6}\ge 10320$

$433.994125{x}_{7}\ge 12015$

$433.994125{x}_{8}\ge 11250$

$419.467125{x}_{9}\ge 12000$

$417.15375{x}_{10}\ge 12264$

$549.2201{x}_{11}\ge 11043.75$ .

2) Soft Constraints

The manufacturing company has limited amount of resources. Therefore, it is essential to consider available resources in the plant when minimizing the manufacturing cost. When the biscuits are manufactured, manufacturing process cannot exceed consuming the available amount of resources such as the number of labourers and the machine capacity. The management is repeatedly adjusting the labour and machine requirements according to the monthly demand. Thus, in this study, labour and machine hour constraints were considered as soft constraints.

・ Machine Hours

A batch of each product takes a certain processing time. The required total processing time for the monthly production should be less than or equal to total available machine hours per month. If the demand cannot be satisfied with the available total machine hours, number of working hours per day and working days per month can be increased up to some level in the model solving step. Therefore, machine hour constraint was considered as a soft constraint. Then, the machine hour constraint, in general, is as follows:

${\sum}_{i=1}^{11}{t}_{i}{x}_{i}}\le T$ for $i=1,2,\cdots ,11$ ,

where t_{i} is the total processing time (in minutes) per batch of the i^{th} product and T is the available machine time (in minutes) per month.

Available machine hours per month are calculated in Table 7 while processing time for a batch of each product is illustrated in Table 9. The machine hour constraint can be written as follows:

Table 7. Available machine hours per month.

$\begin{array}{l}30{x}_{1}+25{x}_{2}+20{x}_{3}+26{x}_{4}+40{x}_{5}+50{x}_{6}+45{x}_{7}\\ \text{\hspace{0.05em}}+50{x}_{8}+50{x}_{9}+30{x}_{10}+30{x}_{11}\le 12000\end{array}$ .

・ Labor hour constraint

The required labour hours for the monthly production should be less than the available labour hours per month. Thus, the labour hour constraint for each section; mixing, cutter, baking and cooling, and stacking can be formulated, in general, as follows:

${\sum}_{i=1}^{11}{t}_{i}{l}_{I}{x}_{i}}\le L$ ,

for each of the four sections mixing, cutter, baking and cooling, and stacking, where l_{i} is the number of labourers needed for each production section, t_{i} is the processing time (in minutes) per batch of the i^{th} product through each section and L is the total available labour hours.

A fixed number of labourers are allocated to each section of the production plant (see Table 8). Among these labourers, different numbers of labourers are assigned into each section during the production of different products (see Table 9). Moreover, the calculations of the required labour time for each section during the production are demonstrated in Table 9 and the available labour time in minutes is shown in Table 8.

Since the number of working days or hours can be adjusted until a feasible solution is found, this constraint is also identified as a soft constraint. Therefore, labour constraint for each section for this PP problem can be presented as follows:

Mixing:

$\begin{array}{l}300{x}_{1}+300{x}_{2}+240{x}_{3}+312{x}_{4}+400{x}_{5}+500{x}_{6}+450{x}_{7}\\ \text{\hspace{0.05em}}+500{x}_{8}+500{x}_{9}+300{x}_{10}+360{x}_{11}\le 144000\end{array}$ .

Cutter:

$\begin{array}{l}180{x}_{1}+125{x}_{2}+100{x}_{3}+130{x}_{4}+240{x}_{5}+300{x}_{6}+270{x}_{7}\\ \text{\hspace{0.05em}}+300{x}_{8}+300{x}_{9}+180{x}_{10}+150{x}_{11}\le 72000\end{array}$ .

Baking and Cooling:

$\begin{array}{l}150{x}_{1}+125{x}_{2}+100{x}_{3}+130{x}_{4}+200{x}_{5}+250{x}_{6}+225{x}_{7}\\ \text{\hspace{0.05em}}+250{x}_{8}+250{x}_{9}+150{x}_{10}+150{x}_{11}\le 72000\end{array}$ .

Stacking:

$\begin{array}{l}420{x}_{1}+450{x}_{2}+360{x}_{3}+468{x}_{4}+800{x}_{5}+300{x}_{6}+270{x}_{7}\\ \text{\hspace{0.05em}}+300{x}_{8}+300{x}_{9}+180{x}_{10}+540{x}_{11}\le 240000\end{array}$ .

In addition, all the x_{i} values should be positive integers as the plant does not produce partial batches. That is, x_{i} ≥ 0 and integer for
$i=1,2,\cdots ,11$ .

Table 8. Number of labours assigned for each section and available labour hours per month.

Table 9. Required labour time.

2.2. Solving the Formulated Mathematical Model

The most prominent algorithm to solve LP problems is the Simplex Algorithm developed by Dantzig in 1947. However, the formulated model has integer decision variables and therefore it is referred to as Integer Linear Programming (ILP). Thus, the problem cannot be solved using the simplex method alone. One class of exact algorithms that can be used to solve ILP is cutting plane methods [20] . This method first uses LP relaxation and afterward adds linear constraints so that it will lead the solution towards being integer without excluding any integer feasible points. Another class of exact algorithms is variants of the branch and bound method [21] . Many problems are intractable since ILP is NP-hard (see [22] ), thus heuristic methods are used instead. Hill climbing (see [23] ), simulated annealing (see [24] ), and ant colony optimization (see [25] ) are some of the heuristic methods that can be applied to solve ILPs. However, in this study spreadsheet paradigm was used to solve the formulated ILP problem.

Model in Microsoft Excel

The above integer linear programming model was implemented in Microsoft Excel (see Figure 2). Major spreadsheet packages come with a built-in optimization tool called Solver. MacDonald [26] explained how to use Microsoft Excel Solver to solve LP problems. Many authors in the literature have used the Excel Solver to solve different linear and integer linear programming problems [27] [28] . Once a model was implemented in a spreadsheet, the optimal values of the decision variables and the optimal objective function value can be found using Excel Solver. In the Solver dialog box, Simplex LP was selected to solve the ILP implemented in Excel as a spreadsheet model, where Solver uses a Branch and Bound to solve the model. The demand constraint should be satisfied by any solution of this problem as it was identified as a hard constraint. The number of working hours, working days were changed within a particular range acceptable to the management, and a feasible solution was found when the number of working hours was increased up to 8.5 hours, while number of labours assigned for each section considered constant. Since the production process is continuous, labourers and machines in all sections should work for additional 0.5 hours. As a result, the right-hand side of the machine hour and labour hour constraint were changed as displayed in the spreadsheet model in Figure 2. The overtime cost can be calculated separately, thus, it is not included in the spreadsheet model.

3. Results and Discussion

3.1. Results

According to the obtained optimum solution, the number of batches to be

Figure 2. The spreadsheet model and solution as exhibited in Excel.

produced from each product per month is displayed in Figure 2, and according to Figure 2, monthly demand can be satisfied using the available resources with a minimum cost of approximately Rs.25.2 million. In order to achieve that, the plant should produce following number of batches from each product:

x_{1} (Cream Cracker) = 50, x_{2} (Nice) = 28, x_{3} (Sorties) = 37, x_{4} (Teasty) = 43, x_{5} (Marie) = 39, x_{6} (Onion byte) = 28, x_{7} (Cheese cuts) = 28, x_{8} (Cheese and Onion) = 26, x_{9} (Hot chilly Byte) = 29, x_{10} (Lemon Puff) = 30, x_{11} (Chocolate Cream) = 21.

Moreover, in order to satisfy the customer demand, the manufacturing plant should function 25 days and 8.5 hours continuously each day for this particular month.

3.2. Discussion

The Excel does not provide sensitivity report, as the variables are integers. Therefore, sensitivity analysis cannot be performed for the optimal solution. The total monthly cost can be reduced by Rs. 474,705 if the integer constraint is removed and this additional monthly cost is due to the excess amount of biscuits that will be produced due to the integer constraint. Consequently, if the company can produce partial batches, then the monthly additional cost of producing additional biscuits could be reduced and the excess amount of biscuits produced could be avoided.

In addition, the solved model (using sum product column) identifies the number of working hours and working days of the production plant per month and the total kilograms of biscuits from each product should be produced by the end of month. However, the minimum number of hours that the plant should function to get a feasible solution is 8.372 hours. However, it was round up to 8.5 considering the convenience of paying overtime. If we assume that all the 43 labourers are working 8.5 hours for all the 25 days even though for some products some labourers are kept idle, the overtime cost will be (8.5 − 8) × 25 × 43 × OTR, where OTR is the overtime rate. Moreover, idle times of labourers and machines can be obtained by observing the spreadsheet model.

Even though this study was carried out based on the data of a particular month, this model can be generalized to determine the number of batches to be produced for any month. As D_{i}’s are changing from month to month, applying new D_{i}’s to the formulated spreadsheet model would give the number of products to be produced in each month. In addition, number of working hours and working days can be appropriately changed in the model until it reaches feasibility.

For further analysis of the business, the management can analyze the future demand after identifying a probability distribution for the monthly demand and modelling a simulation to take an expected monthly demand. In addition, at the moment the management has not defined any goals but if they do, then a goal programming model can be used for this problem.

4. Conclusions

Based on the results obtained above, the solved integer linear programming model gives a feasible solution and it minimizes the monthly manufacturing cost. It could be concluded that by implementing the production plan suggested by the solution, the monthly demand could be satisfied using the available resources while minimizing the monthly production cost.

Moreover, the management can schedule the production for each day, as the aggregate number of batches to be produced for each product and the numbers of labour hours needed for the month are predetermined. If the plant overproduced the biscuits, the biscuits would be remained in the finished goods stores for an additional period, which results in excessive amount of inventory cost. This will also lead to low quality products entering into the market, causing bad reputation to the production plant. Therefore, by implementing this production plan, manufacturing excess of biscuits can be avoided and hence utilizes the physical and human resources to the optimum manner. This will enable manufacturing plant to reduce the production cost. Moreover, using the proposed mathematical model and with the help of Excel spreadsheet, the company can plan the production for the coming years.

Conflicts of Interest

The authors declare no conflicts of interest regarding the publication of this paper.

[1] | Kantorovich, L.V. (1939) The Mathematical Method of Production Planning and Organization. Management Science, 6, 363-422. |

[2] |
Tingley, G.A. (1987) Can MS/OR Sell Itself Well Enough? Interfaces, 17, 41-52. https://doi.org/10.1287/inte.17.4.41 |

[3] |
Hanssmann, F. and Hess, S.W. (1960) A Linear Programming Approach to Production and Employment Scheduling. Management Science, 1, 46-51. https://doi.org/10.1287/mantech.1.1.46 |

[4] |
Hung, Y.F. and Leachman, R.C. (1996) A Production Planning Methodology for Semiconductor Manufacturing Based on Iterative Simulation and Linear Programming Calculations. IEEE Transactions on Semiconductor Manufacturing, 9, 257-269. https://doi.org/10.1109/66.492820 |

[5] |
Pendharkar, P.C. (1997) A Fuzzy Linear Programming Model for Production Planning in Coal Mines. Computers & Operations Research, 24, 1141-1149. https://doi.org/10.1016/S0305-0548(97)00024-5 |

[6] |
Vasant, P.M. (2003) Application of Fuzzy Linear Programming in Production Planning. Fuzzy Optimization and Decision Making, 2, 229-241. https://doi.org/10.1023/A:1025094504415 |

[7] | Wang, R.C. and Liang, T.F. (2004) Application of Fuzzy Multi-Objective Linear Programming to Aggregate Production Planning. Computers & Industrial Engineering, 46, 17-41. https://doi.org/10.1016/j.cie.2003.09.009 |

[8] | Wang, R.C. and Liang, T.F. (2005) Applying Possibilistic Linear Programming to Aggregate Production Planning. International journal of production economics, 98, 328-341. https://doi.org/10.1016/j.ijpe.2004.09.011 |

[9] |
Kanyalkar, A.P. and Adil, G.K. (2005) An Integrated Aggregate and Detailed Planning in a Multi-Site Production Environment Using Linear Programming. International Journal of Production Research, 43, 4431-4454. https://doi.org/10.1080/00207540500142332 |

[10] |
da Silva, C.G., Figueira, J., Lisboa, J. and Barman, S. (2006) An Interactive Decision Support System for an Aggregate Production Planning Model Based on Multiple Criteria Mixed Integer Linear Programming. Omega, 34, 167-177. https://doi.org/10.1016/j.omega.2004.08.007 |

[11] |
Goodman, D.A. (1974) A Goal Programming Approach to Aggregate Planning of Production and Work Force. Management Science, 20, 1569-1575. https://doi.org/10.1287/mnsc.20.12.1569 |

[12] | Jamalnia, A. and Soukhakian, M.A. (2009) A Hybrid Fuzzy Goal Programming Approach with Different Goal Priorities to Aggregate Production Planning. Computers & Industrial Engineering, 56, 1474-1486. https://doi.org/10.1016/j.cie.2008.09.010 |

[13] | Leung, S.C. and Chan, S.S. (2009) A Goal Programming Model for Aggregate Production Planning with Resource Utilization Constraint. Computers & Industrial Engineering, 56, 1053-1064. https://doi.org/10.1016/j.cie.2008.09.017 |

[14] | Masud, A.S. and Hwang, C.L. (1980) An Aggregate Production Planning Model and Application of Three Multiple Objective Decision Methods. International Journal of Production Research, 18, 741-752. https://doi.org/10.1080/00207548008919703 |

[15] | Wang, R.C. and Fang, H.H. (2001) Aggregate Production Planning with Multiple Objectives in a Fuzzy Environment. European Journal of Operational Research, 133, 521-536. https://doi.org/10.1016/S0377-2217(00)00196-X |

[16] | Wolsey, L.A. (1998) Integer Programming. Wiley, New York. |

[17] | Orcun, S., Altinel, I.K. and Horta?su, ?. (2001) General Continuous Time Models for Production Planning and Scheduling of Batch Processing Plants: Mixed Integer Linear Program Formulations and Computational Issues. Computers & Chemical Engineering, 25, 371-389. https://doi.org/10.1016/S0098-1354(00)00663-3 |

[18] | Floudas, C.A. and Lin, X. (2005) Mixed Integer Linear Programming in Process Scheduling: Modeling, Algorithms, and Applications. Annals of Operations Research, 139,131-162. https://doi.org/10.1007/s10479-005-3446-x |

[19] | Hvolby, H.H. and Steger-Jensen, K. (2010) Technical and Industrial Issues of Advanced Planning and Scheduling (APS) Systems. Computers in Industry, 61, 845-851. https://doi.org/10.1016/j.compind.2010.07.009 |

[20] | Gomory, R.E. (1963) An Algorithm for Integer Solutions to Linear Programs. Recent Advances in Mathematical Programming, 64, 260-302. |

[21] | Land, A. and Doig, A. (1960) An Automatic Method of Solving Discrete Programming Problems. Ecometrics, 28, 497-520. https://doi.org/10.2307/1910129 |

[22] | Schrijver, A. (1998) Theory of Linear and Integer Programming. John Wiley & Sons, New York. |

[23] | Beale, E.M.L. (1985) Integer Programming. Computational Mathematical Programming, 15, 1-24. https://doi.org/10.1007/978-3-642-82450-0_1 |

[24] |
Abramson, D. and Randall, M. (1999) A Simulated Annealing Code for General Integer Linear Programs. Annals of Operations Research, 86, 3-21. https://doi.org/10.1023/A:1018915104438 |

[25] |
Doerner, K.F., Gutjahr, W.J., Hartl, R.F., Strauss, C. and Stummer, C. (2006) Pareto Ant Colony Optimization with ILP Preprocessing in Multiobjective Project Portfolio Selection. European Journal of Operational Research, 171, 830-841. https://doi.org/10.1016/j.ejor.2004.09.009 |

[26] | MacDonald, Z. (1995) Teaching Linear Programming Using Microsoft Excel Solver. Computers in Higher Education Economics Review, 9, 7-10. |

[27] | Trick, M.A. (2004) Using Sports Scheduling to Teach Integer Programming. INFORMS Transactions on Education, 5, 10-17. https://doi.org/10.1287/ited.5.1.10 |

[28] | Hojati, M. and Patil, A.S. (2011) An Integer Linear Programming-Based Heuristic for Scheduling Heterogeneous, Part-Time Service Employees. European Journal of Operational Research, 209, 37-50. https://doi.org/10.1016/j.ejor.2010.09.004 |

Journals Menu

Copyright © 2021 by authors and Scientific Research Publishing Inc.

This work and the related PDF file are licensed under a Creative Commons Attribution 4.0 International License.