[go: up one dir, main page]
More Web Proxy on the site http://driver.im/ Skip to main content
Springer Nature Link
Log in

One-dimensional stock cutting: optimization of usable leftovers in consecutive orders

  • Original Paper
  • Published:
Central European Journal of Operations Research Aims and scope Submit manuscript

Abstract

This paper deals with usable leftovers (UL) in one-dimensional stock cutting in consecutive orders. UL are leftovers longer than a certain threshold and are returned to stock in order to be used in future orders. Shorter leftovers are treated as trim-loss. If UL are being used at a slower pace, than they are being generated for a longer period of time, excessive growth of UL in stock can appear. This is not acceptable due to higher costs of manipulations and warehousing. However, a certain amount of UL in stock is desirable because it contributes to greater variety of stock lengths, which in general results in lower trim-loss. The method solves the problem of how to calculate the near optimal amount of UL in stock and how to control the stock. The proposed method is tested by using a computer simulation in which UL from previous orders are used in the next ones instead of being randomly generated. The computational results indicate that trim-loss in consecutive orders is reduced, and excessive growth of UL in stock is prevented.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
£29.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price includes VAT (United Kingdom)

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1

Similar content being viewed by others

References

  • Alves C, Bras P, de Carvalho JV, Pinto T (2012) New constructive algorithms for leather nesting in the automotive industry. Comput Oper Res 39:1487–1505

    Article  Google Scholar 

  • Arbib C, Marinelli F, Rossi F, Di Iorio F (2002) Cutting and reuse: an application from automobile component manufacturing. Oper Res 50:923–934

    Article  Google Scholar 

  • Arenales MN, Cheri AC, do Nascimento DN, Vianna A (2015) A new mathematical model for the cutting stock/leftover problem. Pesqui Oper 35:509–522

    Article  Google Scholar 

  • Bang-Jensen J, Larsen R (2012) Efficient algorithms for real-life instances of the variable size bin packing problem. Comput Oper Res 39:2848–2857

    Article  Google Scholar 

  • Brown AR (1971) Optimum packing and depletion: the computer in space and resource usage problems. Macdonald and Co., London

    Google Scholar 

  • Chauhan SS, Martel A, D’Arnour S (2008) Roll assortment optimization in a paper mill: an integer programming approach. Comput Oper Res 35:614–627

    Article  Google Scholar 

  • Cherri AC, Arenales MN, Yanasse HH (2009) The one-dimensional cutting stock problem with usable leftover—a heuristic approach. Eur J Oper Res 196:897–908

    Article  Google Scholar 

  • Cherri AC, Arenales MN, Yanasse HH (2013) The usable leftover one-dimensional cutting stock problem—a priority-in-use heuristic. Int Trans Oper Res 20:189–199

    Article  Google Scholar 

  • Cherri AC, Arenales MN, Yanasse HH, Poldi KC, Vianna ACG (2014) The one-dimensional cutting stock problem with usable leftovers—a survey. Eur J Oper Res 236:395–402

    Article  Google Scholar 

  • Cui YD, Yang YL (2010) A heuristic for the one-dimensional cutting stock problem with usable leftover. Eur J Oper Res 204:245–250

    Article  Google Scholar 

  • Diegel A, Montocchio E, Walters E, van Schalkwyk S, Naidoo S (1996) Setup minimising conditions in the trim loss problem. Eur J Oper Res 95:631–640

    Article  Google Scholar 

  • Furian N, Vössner S (2014) A hybrid algorithm for constrained order packing. Cent Eur J Oper Re 22:157–186

    Article  Google Scholar 

  • Gau T, Wascher G (1995) CUTGEN1—a problem generator for the standard one-dimensional cutting stock problem. Eur J Oper Res 84:572–579

    Article  Google Scholar 

  • Gilmore PC, Gomory RE (1961) A linear-programming approach to the cutting-stock problem. Oper Res 9:849–859

    Article  Google Scholar 

  • Golfeto RR, Moretti AC, de Salles Neto LL (2009) A genetic symbiotic algorithm applied to the cutting stock problem with multiple objectives. Adv Model Optim 11:473–501

    Google Scholar 

  • Gradišar M, Jesenko J, Resinovic G (1997) Optimization of roll cutting in clothing industry. Comput Oper Res 24:945–953

    Article  Google Scholar 

  • Gradišar M, Kljajic M, Resinovic G, Jesenko J (1999) A sequential heuristic procedure for one-dimensional cutting. Eur J Oper Res 114:557–568

    Article  Google Scholar 

  • Kantorovich LV (1960) Mathematical methods of organizing and planning production. Manag Sci 6:366–422

    Article  Google Scholar 

  • Kierkozs I, Luczak M (2014) A hybrid evolutionary algorithm for the two-dimensional packing problem. Cent Eur J Oper Res 22:729–753

    Article  Google Scholar 

  • Kos L, Duhovnik J (2002) Cutting optimization with variable-sized stock and inventory status data. Int J Prod Res 40:2289–2301

    Article  Google Scholar 

  • Leao AAS, Santos MO, Hoto R, Arenales MN (2011) The constrained compartmentalized knapsack problem: mathematical models and solution methods. Eur J Oper Res 212:455–463

    Article  Google Scholar 

  • Mobasher A, Ekici A (2013) Solution approaches for the cutting stock problem with setup cost. Comput Oper Res 40:225–235

    Article  Google Scholar 

  • Poldi KC, Arenales MN (2009) Heuristics for the one-dimensional cutting stock problem with limited multiple stock lengths. Comput Oper Res 36(6):2074–2081

    Article  Google Scholar 

  • Scheithauer G (1991) A note on handling residual lengths. Optimization 22:461–466

    Article  Google Scholar 

  • Sinuany-Stern Z, Weiner I (1994) The one dimensional cutting stock problem using two objectives. J Oper Res Soc 45:231–236

    Article  Google Scholar 

  • Trkman P, Gradišar M (2007) One-dimensional cutting stock optimization in consecutive time periods. Eur J Oper Res 179:291–301

    Article  Google Scholar 

  • Trkman P, McCormack K (2010) Estimating the benefits and risks of implementing e-procurement. IEEE Trans Eng Manag 57:338–349

    Article  Google Scholar 

  • Venkateswarlu P (2001) The trim-loss problem in a wooden container manufacturing company. J Manuf Syst 20:166–176

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Academic Unit for Business Informatics and Logistics, Faculty of Economics, University of Ljubljana, Kardeljeva ploscad 17, 1000, Ljubljana, Slovenia

    Luka Tomat & Mirko Gradišar

Authors
  1. Luka Tomat
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Mirko Gradišar
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Luka Tomat.

Ethics declarations

Conflict of interest

The authors declare that they have no conflict of interest.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Tomat, L., Gradišar, M. One-dimensional stock cutting: optimization of usable leftovers in consecutive orders. Cent Eur J Oper Res 25, 473–489 (2017). https://doi.org/10.1007/s10100-017-0466-y

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10100-017-0466-y

Keywords

Search

Navigation