Abstract
In several real-world applications the time required to accomplish a job generally depends on the number of tasks that compose it. Although the same also holds for packing (or cutting) problems when the processing time of a bin depends by the number of its items, the approaches proposed in the literature usually do not consider variable bin processing times and therefore become inaccurate when time costs are worth more than raw material costs. In this paper we discuss this issue by considering a variant of the one-dimensional bin packing problem in which items are due by given dates and a convex combination of number of used bins and maximum lateness has to be minimized. An integer linear program that takes into account variable pattern processing times is proposed and used as proof-of-concept.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Aloisio, A., Arbib, C., Marinelli, F.: On LP relaxations for the pattern minimization problem. Networks 57(3), 247–253 (2011)
Arbib, C., Marinelli, F.: On cutting stock with due dates. Omega Int. J. Manag. Sci. 46, 11–20 (2014)
Arbib, C., Marinelli, F.: Maximum lateness minimization in one-dimensional bin packing. Omega Int. J. Manag. Sci. 68, 76–84 (2017)
Bennel, J.A., Lee, L.S., Potts, C.N.: A genetic algorithm for two-dimensional bin packing with due dates. Int. J. Prod. Econ. 145, 547–560 (2013)
Cui, Y., Huang, B.: Reducing the number of cuts in generating three-staged cutting patterns. Eur. J. Oper. Res. 218, 358–365 (2012)
Delorme, M., Iori, M., Martello, S.: Bin packing and cutting stock problems: mathematical models and exact algorithms. Eur. J. Oper. Res. 255, 1–20 (2016)
Hartmann, S.: Packing problems and project scheduling models: an integrating perspective. J. Oper. Res. Soc. 51, 1083–1092 (2000)
Kantorovich, L.V.: Mathematical methods of organizing and planning production. Manag. Sci. 6, 366–422 (1960)
Martello, S., Toth, P.: Lower bounds and reduction procedures for the bin packing problem. Discret. Appl. Math. 28, 59–70 (1990)
Reinertsen, H., Vossen, T.W.M.: The one-dimensional cutting stock problem with due-dates. Eur. J. Oper. Res. 201, 701–711 (2010)
Wäscher, G., Haußner, H., Schumann, H.: An improved typology of cutting and packing problems. Eur. J. Oper. Res. 183, 1109–1130 (2007)
Yanasse, H.H., Limeira, M.S.: A hybrid heuristic to reduce the number of different patterns in cutting stock problems. Comput. Oper. Res. 33, 2744–2756 (2006)
Acknowledgements
Work supported by the Italian Ministry of Education, National Research Program (PRIN) 2015, contract n. 20153TXRX9.
Author information
Authors and Affiliations
Corresponding authors
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2017 Springer International Publishing AG
About this paper
Cite this paper
Marinelli, F., Pizzuti, A. (2017). Bin Packing Problems with Variable Pattern Processing Times: A Proof-of-concept. In: Sforza, A., Sterle, C. (eds) Optimization and Decision Science: Methodologies and Applications. ODS 2017. Springer Proceedings in Mathematics & Statistics, vol 217. Springer, Cham. https://doi.org/10.1007/978-3-319-67308-0_46
Download citation
DOI: https://doi.org/10.1007/978-3-319-67308-0_46
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-67307-3
Online ISBN: 978-3-319-67308-0
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)