- About this Journal ·
- Abstracting and Indexing ·
- Advance Access ·
- Aims and Scope ·
- Annual Issues ·
- Article Processing Charges ·
- Articles in Press ·
- Author Guidelines ·
- Bibliographic Information ·
- Citations to this Journal ·
- Contact Information ·
- Editorial Board ·
- Editorial Workflow ·
- Free eTOC Alerts ·
- Publication Ethics ·
- Reviewers Acknowledgment ·
- Submit a Manuscript ·
- Subscription Information ·
- Table of Contents

Journal of Applied Mathematics

Volume 2014 (2014), Article ID 987054, 10 pages

http://dx.doi.org/10.1155/2014/987054

## A New Decision Model for Reducing Trim Loss and Inventory in the Paper Industry

Department of Industrial Management, National Taiwan University of Science and Technology, Taipei 106, Taiwan

Received 1 October 2013; Revised 27 November 2013; Accepted 7 December 2013; Published 21 January 2014

Academic Editor: Aderemi O. Adewumi

Copyright © 2014 Fu-Kwun Wang and Feng-Tai Liu. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

#### Abstract

In the paper industry, numerous studies have explored means of optimizing order allocation and cutting trim loss. However, enterprises may not adopt the resulting solutions because some widths of the inventory exceed or are less than those required for acceptable scheduling. To ensure that the results better suit the actual requirements, we present a new decision model based on the adjustment of scheduling and limitation of inventory quantity to differentiate trim loss and inventory distribution data. Differential analysis is used to reduce data filtering and the information is valuable for decision making. A numerical example is presented to illustrate the applicability of the proposed method. The results show that our proposed method outperforms the manual method regarding scheduling quantity and trim loss.

#### 1. Introduction

Numerous industries with bulk production modes, such as the industrial-use paper industry, have gradually changed their production environments to high-mix low-volume production. Customer requirements for high-mix low-volume production and instant supply also increase the difficulty of optimizing production scheduling. An issue with even greater significance is how to properly employ production scheduling flexibility and coordinated supplementary measures. In this paper, we consider two main issues in relation to the production planning of industrial paper. (1) If production scheduling is fixed, how may the trim loss ratio and production inventory be reduced, whether evenly distributed in different widths of inventory or not. (2) Does increasing or decreasing the production of scheduling produce better results for inventory distribution and trim loss ratio better than the original scheduling? Since the 1960s [1], numerous studies have examined how to configure orders most effectively to optimize production scheduling. However, these optimized results have not been able to satisfy the requirements of numerous managers because, in situations of raw order production, if the structure remains poor after the permutation and combination of orders, significant trim loss can occur. Thus, managers must abandon optimized scheduling and use their experience to identify the best solution.

Most cutting stock problems (CSPs) are classified as NP-complete, meaning that it is difficult to obtain optimal solutions. Gilmore and Gomory [1] presented a delayed pattern generation technique for solving a one-dimensional cutting problem using linear programing. Other methods can also be found in the literature [2–13]. Morabito and Arenales [14] considered different objectives (e.g., cutting time and trim loss) in the preparation of the cutting plan. Menon and Schrage [15] proposed a bound-based approach to solve the problem of allocating orders to machines in the paper industry. Wäscher et al. [16] provided a good review of several efficient heuristic methods utilizing either pattern-oriented or item-oriented approaches. Matsumoto et al. [17] proposed a generalization of the cutting pattern called the cutting group in a paper tube factory. Mobasher and Ekici [18] developed two local search algorithms and a column generation based heuristic algorithm to solve the cutting stock problem with setup cost.

In the overall order optimization process, not every cutting configuration meets the needs of the manager because some cutting configurations produce greater trim losses. Generally, managers assign the inventory quantity according to the size of the trim loss and then search for another optimized solution. Therefore, appropriate replanning of inventory and orders is undertaken to ensure that it is closer to the producer’s requirements. Gramani and França [19] proposed a mathematical model for coupling lot sizing and two-dimensional cutting stock problems. Ritvirool [20] presented an integer linear programming (ILP) model to minimize trim loss in a produce-handling vehicle production plant. Chauhan et al. [21] presented a model to decide the parent roll assortment and assignments to finished products based on these products demand processes, desired service levels, trim loss, and inventory holding costs in a paper mill. Poltroniere et al. [22] presented a mixed linear integer optimization model to couple the production planning and the cutting process in the paper industry.

To prevent the trim loss generated after optimization, Kos and Duhovnik [23] included reusable inventory, which is an extension of the usable leftover solution. The usable leftover material is used in the next cutting plan. Related studies [24–28] all propose similar optimal solutions. Erjavec et al. [29] considered trim loss, inventory costs, and shortage costs and developed a model for the solution of the inventory level with the lowest overall cost. Regarding the delivery period, some industries add 1 to 3 days after the paper type is produced as the product delivery period. These additional days are used to increase production flexibility and prevent late deliveries because of transportation factors. This supply chain mode is similar to the process improvements proposed by Erjavec et al. [30].

This study proposes a model based on the adjustment of scheduling and the limitation of inventory quantity to differentiate trim loss ratio and inventory distribution data. We also use the integer programing method to determine the optimal adjustment of order allocation, inventory filtering, and production scheduling. Finally, we use differential analysis to reduce data filtering. This valuable information should enable companies to solve the problems of inventory distribution and the depletion ratio more effectively. The remainder of this paper is organized as follows. In Section 2, the definition of the problem in the paper industry is presented. A decision model is developed in Section 3. In Section 4, an empirical case is employed to calculate and illustrate the proposed model. Finally, conclusions are drawn in Section 5.

#### 2. Problem Definition

The production of industrial-use paper begins from raw material to reels and then from reels to rolls as finished goods. The entire operation mode is cyclical production, which is the only method for achieving efficient production. Therefore, the leftover material is not used in a follow-up production cycle. For this scheduling, the customer’s paper requirements are obtained and the market demand is predicted. In the combined production-marketing meeting, the number of production days and the production quantity of paper types are determined. number of reels is considered as the production quantity and number of rolls can be produced from each reel. Thus, the problem encountered is the optimization of number of reels for number of rolls to fulfill customers’ orders (see Figure 1).

Regarding production planning, actual supply and demand figures are obtained for scheduling. In order to meet the overall order specifications and reduce trim loss during the production process, the decision-making model proposed by Keskinocak et al. [31] is used to optimize overall production scheduling. However, actual production cannot achieve the optimal result of zero depletion. Indeed, the overall production capacity is typically greater than the order to ensure that the customer’s and production requirements are met (see Figure 2). Therefore, decision makers often encounter difficulties in determining the scheduling quantity and production inventory so that they are evenly distributed in different widths. To solve these two issues, decision makers use their experience to adjust the scheduling quantity to meet production requirements. Unfortunately, these solutions are not optimized or efficient. In order to improve the overall production efficiency and reduce the time required for manual calculation, a new decision model is needed to react more flexibly to the market and increase the comprehensiveness of the production structure.

#### 3. Decision Model for Scheduling

In order to formulate a decision-making model or a mathematical model, we consider the following notation: an order width, with , and is the number of order width; demand for , with , and is the number of order width; an inventory width, with , and is the number of inventory width; a production width, with , and is the number of production width; demand for , with , and is the number of production width; the pattern for , with , and is the number of pattern; the quantity of inventory limit for , with , and is the number of pattern; production scheduling quantity; flexible adjustment multiple; reels set in production scheduling; upper bound for trim loss; a production scheduling quantity, with , and is the number of production scheduling quantity; postoptimization trim loss ratio; the number of ; for nonfulfilled order, with , and ; difference of trim loss ratio of the scheduled quantities for each item of inventory limit, with , and ; difference of trim loss ratio of inventory limit for each item of scheduled quantities, with , and .

##### 3.1. Decision Model

To meet customer needs and optimize scheduling quantity, when decision makers analyze production planning, they must consider the trim loss, production volume, and the inventory required to satisfy the practical production requirements. Controlling trim loss, production volume, and inventory is the only strategy to improve production decision making. The decision-making model consists primarily of configuring the production inventory paper width according to the paper width and volume in the order. The minimum production capacity and overall trim loss can be obtained after aggregating the paper width and minimum requirements. If the production capacity, trim loss, and inventory are within a tolerable range for the decision maker, the production scheduling is completed. If the trim loss is excessive or the inventory must be retained, the production capacity must be adjusted and the maximum production capacity must be obtained using the minimum depletion level. The maximum production capacity is used to confirm the quantity of production capacity required to meet the ideal scheduling quantity. This enables the decision makers to obtain the optimized production capacity, trim loss, and inventory configuration between the minimum production volume and the maximum production volume. In addition, this enables the overall trim loss to be controlled within the decision maker’s ideal range, without limitations from a preset allowable trim loss value that would prevent an optimized solution from being identified.

The steps in the overall decision-making model in Figure 3 are as follows.

*Step 1. *Define the order and inventory paper width and volume. The inventory paper width is the high turnover of inventory paper.

*Step 2. *Define the limits of inventory paper width and volume for each item. Aggregate the order and inventory paper width and volume to the production paper width and volume and limit the inventory paper quantity to ensure that it correlates with the actual production paper width and volume.

*Step 3. *Define the maximum tolerable scheduling quantity as a multiple of the production scheduling quantity to maintain a flexible future scheduling quantity and optimize trim loss.

*Step 4. *Limit the trim loss quantity and obtain the minimum trim loss using the integer programing method. The production quantity for each paper width must be equal to or greater than the quantity required by the customer.

*Step 5. *Store the optimized scheduling quantity, trim loss ratio, and nonorder (inventory) paper width and volume.

*Step 6. *Determine whether an optimal solution exists. If so, go to Step 8. If not, go to Step 7.

*Step 7. *Adjust the scheduling quantity. To reduce this, return to Step 4.

*Step 8. *Determine whether the number of items in the inventory limit derived from the solution is greater than the total number of items. If yes, go to Step 10. If not, go to Step 9.

*Step 9. *Aggregate the production paper width and quantity and adjust the inventory paper width and quantity to the actual production paper width and quantity. Return to Step 3.

*Step 10. *Obtain the differential analysis of the trim loss ratio and then optimize the storage-scheduling quantity and trim loss information. Following optimization, the decision makers finally confirm the production scheduling quantity.

In production planning for industrial paper, each reel produces number of sets, and an multiple of products is produced by cutting the reels. To allow the production trim loss to be controlled within a certain range and to provide a flexible scheduling quantity, the overall production paper width is aggregated as and , and the producible paper width is obtained. Regarding the control of paper width and volume, the produced paper width and volume must meet . The level of inventory controls the quantity of . Here, and are aggregated and the producible paper width and quantity are obtained.

The scheduling quantity is adjusted according to how the production decision makers view the trim loss level and the urgency of the order. Therefore, although the PSQ can be optimized, they do not represent the production capacity that is acceptable to the decision makers. Instead, the trim loss and production capacity data are provided to the decision makers who make the final decision. After obtaining the and , the integer programing method is used to optimize trim loss. The postoptimization scheduling quantity and trim loss are then stored in the data table. After the related data are stored, the scheduling quantity is reduced to obtain the next scheduling quantity. Next, optimization is again conducted, and the PSR and trim loss data are again stored. Thus, the scheduling quantity is reduced and optimized repeatedly until optimal or lower than the PSQ. Subsequently, the inventory quantities and are changed and optimization is conducted again until is greater than , which completes the entire operation. The optimization process is shown in Algorithm 1, where the number of width in pattern and is integer; = the number of pattern and is integer; = the width of reel; = the number of set in reel; Solve = whether optimization is possible; TTL = postoptimization trim loss; = optimized solution number.

##### 3.2. Decision Making for Scheduling Quantity and Trim Loss

Typically, a larger scheduling quantity produces greater trim loss. Therefore, the scheduling quantity is multiplied to prevent situations in which the scheduling quantity and trim loss cannot be optimized because of a limited scheduling quantity. Therefore, and are entered during the optimization process to increase decision makers’ understanding of the influence that increases or decreases in production capacity have on the trim loss level. In this study, a differential analysis of the trim loss was conducted to ensure that the scheduling quantity and trim loss met the decision makers’ requirements.

In the and table, was selected as the set value and was the variable value employed to conduct differential analysis of the trim loss. First, the difference between and is entered into , and the result of is used to obtain the mean. When is greater than the mean, the maximum value of is reduced. If cannot be optimized and is greater than the mean, plan A of the decision suggestion can be obtained.

Similarly, the difference between and is entered into , and the result of is used to obtain the mean. When is greater than the mean, the minimum value of is summed. If cannot be optimized and exceeds the mean, plan B of the decision suggestion can be obtained.

Intersection analysis is conducted on plans A and B to obtain the scheduling solution C. The values of C are organized in sequence from large to small, and the smaller number is subtracted from the larger number. The result of this subtraction is used to obtain the mean, and the items that exceed the mean are filtered out to obtain the optimal decision suggestion. The decision makers can select the desired inventory results according to their requirements and perform a final confirmation of the scheduling and inventory quantity.

#### 4. Illustrative Example

In an actual case of industrial paper production, we set the current scheduling quantity as PSQ reels, and each reel can produce number of roll sets. The cutting machine’s maximum width limit is and the maximum trim loss is UB. These parameters are defined as , mm, , and .

The application program was implemented to provide the described optimization functionality. As optimization is numerically intensive, the application program was divided into the engine and the user interface. The engine interface was written in Lingo Software [32]. The user interface in Visual Basic 5 enables the navigation of data flow from various input sources from/to a common company database.

According to the decision model and the optimization process described in Section 3, the details are as follows.

*Step 1. *Collect , , and , where and .

*Step 2. *Aggregate and to , define the limitation quantity , and aggregate and to , where and (see Table 1).

*Step 3. *Define the parameter and to obtain .

*Step 4. *Obtain the minimum trim loss using the integer programing method.

*Step 5. *Store the optimized scheduling quantity , depletion ratio , and nonorder (inventory) paper width and quantity .

*Step 6. *Determine whether an optimal solution exists or not. If yes, go to Step 8. If no, go to Step 7.

*Step 7. *Adjust the scheduling quantity PSR.

*Step 8. *Determine whether the number of items in the inventory limit derived from the solution is greater than the total number of items. If yes, go to Step 10. If not, go to Step 9.

*Step 9. *Obtain the next and aggregate to ; then go to Step 3.

*Step 10. *Obtain and (see Table 2).

Conducting differential analysis of the trim loss, the difference between and is entered into , and the mean is obtained from the result of . When is greater than the mean, is obtained. If cannot be optimized and is greater than the mean, the decision suggestion plan can be obtained (see Table 3). That is, we have .

With as the paradigm, and is consistently calculated as . If cannot be optimized, such as in , the calculation is ignored. In this case, the differential mean of 0.15 is obtained and SI_{72} and SI_{62} are greater than the mean. However, SI_{82} cannot be optimized and is greater than the mean; thus, SI_{82} must be included for consideration.

Similarly, the difference between and is entered into , and the mean is obtained from the result of . When is greater than the mean, is obtained. If cannot be optimized and exceeds the mean, the decision suggestion plan can be obtained in Table 4. That is, we have .

With as the paradigm, and is consistently calculated as . If cannot be optimized, such as in TL_{61}, the calculation is ignored. In this case, a differential mean of 0.17 was obtained and IS_{63}was greater than the mean. However, cannot be optimized and IS_{63} is greater than the mean; thus, must also be considered.

We conduct intersection analysis from Tables 3 and 4 to obtain the scheduling solution. That is, we have , where the values are organized from large to small, and the smaller number is subtracted from the larger number. The result of the subtraction is used to obtain the mean of 0.52. The items larger than the mean are filtered out to obtain the results shown in Table 5, and the optimal decision suggestion is obtained as .

The optimal solution displayed in Table 6 shows that, when the scheduling quantity is 45 reels, the trim loss ratio could be 3.3% or 1.2%. Although the quantity of increased inventory differs, decision makers can select the desired inventory results according to their actual needs. The original scheduling quantity was 46 reels, and an optimal solution was not obtained. This means that, for or 2 cases with 45 or 46 reels, trim loss rate differences do not change significantly, and these two reels may be randomly selected. Thus, the scheduling quantity can be reduced to meet the actual requirements.

Concerning the unrestricted inventory quantity, such as , this is a commonly obtained CSP result. Although the trim loss rate is 0.42%, this optimal solution is occasionally unacceptable to the decision makers because it concentrates on the inventory production of 32 rolls of a specific paper width, such as 1000 mm (see Table 6). This poses significant challenges when considering how to reduce the paper width and quantity; this issue has consistently frustrated decision makers.

In the method ordinarily used in the paper industry, the first solution is typically aimed at implementing the order. The inventory paper widths are not included. After optimization, the added paper widths with an inventory quantity of with are obtained. The total number of rolls is 134, and the trim loss ratio is 5.2% (see Table 7). The postoptimization problems that occurred were as follows: (1) the rolls were not in multiples of 3; (2) the trim loss of 5.2% was excessive.

Therefore, manually disassembling the trim loss and the rolls with excessively varying patterns can be considered the optimal solution. The total numbers of rolls are confirmed as 135, 138, 141, and so forth. In this case, the entire trim loss can only be reduced using 138 rolls or more. The rolls are adjusted manually to combine patterns with patterns . To reduce the trim loss, the pattern configuration can be included in the inventory paper width, providing combinations of or or to obtain the combination . Finally, the order paper width with pattern that cannot be allocated is combined with pattern . A manual fine-tuning procedure is conducted to produce the scheduling quantity of 138 rolls and a trim loss ratio of 4.6% (see Table 8).

In Tables 6–8, we found that two solutions using the proposed method are obtained as follows: (1) the scheduling quantity is 45 reels with a trim loss ratio of 3.3%; (2) the scheduling quantity is 45 reels with a trim loss ratio of 1.2%. The solution using a traditional CSP is obtained as the scheduling quantity is 45 reels with a trim loss ratio of 0.42%. The paper width with an inventory quantity of with is obtained. However, this solution is unacceptable because these paper widths are not met for customers’ requirements. We delete the inventory paper width. After optimization, we obtain the added paper widths with an inventory quantity of with , and the total number of rolls is 134 with a trim loss ratio of 5.2%. Unfortunately, the number of rolls (=134) is not in multiples of 3. Thus, this solution is still unacceptable. The solution of the scheduling quantity using the manual method is obtained as 46 reels with a trim loss ratio of 4.6%. We found that the scheduling quantity of our method is 45 reels that it is less than 46 reels obtained using the manual method. In addition, the trim loss using our method is lower than that of the manual method. Thus, we conclude that our method outperforms the other two methods.

#### 5. Conclusions

In this study, we propose a new decision model for the CSP to improve the overall production efficiency in the paper industry. Not only using the mutual collocation of scheduling volume adjustment, orders, and inventory reduces the ratio of depletion to total production amount, but also the model for adjusting the scheduling amount proposed in this study obtains the data differentiation of the depletion ratio. This information can enable decision makers to solve the inventory and depletion problems related to CSP issues efficiently. In illustrative example, we found that the scheduling quantity of our method is 45 reels that it is less than 46 reels obtained using the manual method. That is, the cost effect of the number of reels can be reduced by 1. Furthermore, it allows decision makers to determine the optimal configurations and controls for scheduling, orders, inventory, and trim loss.

In this study, we do not include the due date for the order. Future research should address this issue. In addition, we will conduct the flexible inventory allocation and trim loss control to determine the production scheduling quantity in the paper industry.

#### Conflict of Interests

The authors declare that there is no conflict of interests regarding the publication of this paper.

#### Acknowledgments

The authors gratefully acknowledge three reviewers of this paper who helped clarify and improve this presentation.

#### References

- P. C. Gilmore and R. E. Gomory, “A linear programming approach to the cutting-stock problem,”
*Operations Research*, vol. 9, no. 6, pp. 849–859, 1961. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet - W. Gochet and M. Vandebroek, “A dynamic programming based heuristic for industrial buying of cardboard,”
*European Journal of Operational Research*, vol. 38, no. 1, pp. 104–112, 1989. View at Google Scholar · View at Scopus - C. H. Daǧli, “Knowledge-based systems for cutting stock problems,”
*European Journal of Operational Research*, vol. 44, no. 2, pp. 160–166, 1990. View at Google Scholar · View at Scopus - H. Foerster and G. Wäscher, “Simulated annealing for order spread minimization in sequencing cutting patterns,”
*European Journal of Operational Research*, vol. 110, no. 2, pp. 272–281, 1998. View at Google Scholar · View at Scopus - P. H. Vance, “Branch-and-price algorithms for the one-dimensional cutting stock problem,”
*Computational Optimization and Applications*, vol. 9, no. 3, pp. 211–228, 1998. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet - M. Gradišar, G. Resinovič, J. Jesenko, and M. Kljajić, “A sequential heuristic procedure for one-dimensional cutting,”
*European Journal of Operational Research*, vol. 114, no. 3, pp. 557–568, 1999. View at Google Scholar · View at Scopus - M. Sakawa, “Interactive fuzzy programming for multi-level 0-1 programming problems through genetic algorithms,”
*European Journal of Operational Research*, vol. 114, no. 3, pp. 580–588, 1999. View at Google Scholar · View at Scopus - S. M. A. Suliman, “Pattern generating procedure for the cutting stock problem,”
*International Journal of Production Economics*, vol. 74, no. 1–3, pp. 293–301, 2001. View at Publisher · View at Google Scholar · View at Scopus - W. Weng and T. Sung, “Optimization of a line-cutting procedure for ship hull construction by an effective tabu search,”
*International Journal of Production Research*, vol. 46, no. 21, pp. 5935–5949, 2007. View at Google Scholar · View at Scopus - J. A. Abbasi and M. H. Sahir, “Development of optimal cutting plan using linear programming tools and MATLAB algorithm,”
*International Journal of Innovation, Management and Technology*, vol. 1, pp. 483–492, 2010. View at Google Scholar - G. C. Wang, C. P. Li, J. Lv, X. X. Zhao, and H. Y. Cuo, “An effect algorithm design for the one-dimensional cutting-stock problem,”
*Advanced Materials Research*, vol. 602–604, pp. 1753–1756, 2013. View at Google Scholar - M. Ali, C. W. Ahn, and M. Pant, “Trim loss optimization by an improved differential evolution,”
*Mathematical Problems in Engineering*, vol. 2013, Article ID 706350, 8 pages, 2013. View at Publisher · View at Google Scholar - W. Tharmmaphornphilas, S. Puemsin, and P. Siripongwutikorn, “A MILP model to select cutting machines and cutting patterns to minimize paper loss,” in
*Proceedings of the International MultiConference of Engineers and Computer Scientists*, pp. 1155–1160, Hong Kong, March 2013. - R. Morabito and M. Arenales, “Optimizing the cutting of stock plates in a furniture company,”
*International Journal of Production Research*, vol. 38, no. 12, pp. 2725–2742, 2000. View at Publisher · View at Google Scholar · View at Scopus - S. Menon and L. Schrage, “Order allocation for stock cutting in the paper industry,”
*Operations Research*, vol. 50, no. 2, pp. 324–332, 2002. View at Google Scholar · View at Scopus - G. Wäscher, H. Haußner, and H. Schumann, “An improved typology of cutting and packing problems,”
*European Journal of Operational Research*, vol. 183, no. 3, pp. 1109–1130, 2007. View at Publisher · View at Google Scholar · View at Scopus - K. Matsumoto, S. Umetani, and H. Nagamochi, “On the one-dimensional stock cutting problem in the paper tube industry,”
*Journal of Scheduling*, vol. 14, no. 3, pp. 281–290, 2011. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet - A. Mobasher and A. Ekici, “Solution approaches for the cutting stock problem with setup cost,”
*Computers & Operations Research*, vol. 40, no. 1, pp. 225–235, 2013. View at Publisher · View at Google Scholar · View at MathSciNet - M. C. Gramani and P. M. França, “The combined cutting stock and lot-sizing problem in industrial processes,”
*European Journal of Operational Research*, vol. 174, no. 1, pp. 509–521, 2006. View at Publisher · View at Google Scholar · View at Scopus - A. Ritvirool, “A trim-loss minimization in a produce-handling vehicle production plant,”
*Journal of Science and Technology*, vol. 29, no. 1, pp. 157–164, 2007. View at Google Scholar · View at Scopus - S. S. Chauhan, A. Martel, and S. D'Amour, “Roll assortment optimization in a paper mill: an integer programming approach,”
*Computers and Operations Research*, vol. 35, no. 2, pp. 614–627, 2008. View at Publisher · View at Google Scholar · View at Scopus - S. C. Poltroniere, K. C. Poldi, F. M. B. Toledo, and M. N. Arenales, “A coupling cutting stock-lot sizing problem in the paper industry,”
*Annals of Operations Research*, vol. 157, no. 1, pp. 91–104, 2008. View at Publisher · View at Google Scholar · View at Scopus - L. Kos and J. Duhovnik, “Cutting optimization with variable-sized stock and inventory status data,”
*International Journal of Production Research*, vol. 40, no. 10, pp. 2289–2301, 2002. View at Publisher · View at Google Scholar · View at Scopus - M. Gradišar, G. Resinovič, and M. Kljajić, “Evaluation of algorithms for one-dimensional cutting,”
*Computers & Operations Research*, vol. 29, no. 9, pp. 1207–1220, 2002. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet - P. Trkman and M. Gradišar, “One-dimensional cutting stock optimization in consecutive time periods,”
*European Journal of Operational Research*, vol. 179, no. 2, pp. 291–301, 2007. View at Publisher · View at Google Scholar · View at Scopus - A. C. Cherri, M. N. Arenales, and H. H. Yanasse, “The one-dimensional cutting stock problem with usable leftover—a heuristic approach,”
*European Journal of Operational Research*, vol. 196, no. 3, pp. 897–908, 2009. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet - Y. Cui and Y. Yang, “A heuristic for the one-dimensional cutting stock problem with usable leftover,”
*European Journal of Operational Research*, vol. 204, no. 2, pp. 245–250, 2010. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet - S. A. Araujo, A. A. Constantino, and K. C. Poldi, “An evolutionary algorithm for the one-dimensional cutting stock problem,”
*International Transactions in Operational Research*, vol. 18, no. 1, pp. 115–127, 2011. View at Publisher · View at Google Scholar · View at MathSciNet - J. Erjavec, M. Gradišar, and P. Trkman, “Assessment of stock size to minimize cutting stock production costs,”
*International Journal of Production Economics*, vol. 135, no. 1, pp. 170–176, 2012. View at Publisher · View at Google Scholar · View at Scopus - J. Erjavec, M. Gradišar, and P. Trkman, “Renovation of the cutting stock process,”
*International Journal of Production Research*, vol. 47, no. 14, pp. 3979–3996, 2009. View at Publisher · View at Google Scholar · View at Scopus - P. Keskinocak, F. Wu, R. Goodwin et al., “Scheduling solutions for the paper industry,”
*Operations Research*, vol. 50, no. 2, pp. 249–259, 2002. View at Google Scholar · View at Scopus - “Lingo Software,” Version 11, Lindo Systems, Chicago, Ill, USA, 2009.