Abstract
This paper addresses a complex real life manufacturing problem that occurs in paper and wood industries: the online bin packing and cutting of small items using parallel machines in a just-in-time environment. The objective is to minimize both the unused areas of the bins and the sum of weighted earliness and tardiness penalties. This NP hard problem is herein solved using an agent-based approach A-B. The active agents of A-B interact dynamically in real time to jointly fill the bins with items, assign cutting patterns to machines, cut them, and have the items delivered on time. The application of A-B to real life instances from a manufacturing company highlights the sizeable savings induced by A-B, and demonstrates its suitability for complex online real-life situations.
This research is supported by grant HIII 65497.2010.9 of the president of the Russian Federation for Leading Scientific Schools and grant 09-07-00408-a of the Russian Foundation for Basic Research.
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
Preview
Unable to display preview. Download preview PDF.
References
BenBassat, M.: Production Chain Optimization: Basic Principles, http://www.plataine.com/mbb0806
Mes, M., Heijden, M., Harten, A.: Comparison of agent-based scheduling to look-ahead heuristics for real-time transportation problems. European Journal of Operational Research 181(12), 59–75 (2007)
Parunak, H.V.D.: Agents in Overalls: Experiences and Issues in the Development and Deployment of Industrial Agent-Based Systems. International Journal of Cooperative Information Systems 9(3), 209–228 (2000)
Wooldridge, M., Jennings, N.R.: Agent theories, architectures, and languages: A survey. In: Proceedings of the ECAI 1994 Workshop on Agent Theories, Architectures and Languages, pp. 1–39. Springer, Heidelberg (1995)
Polyakovsky, S., M’Hallah, R.: An agent-based approach to the two-dimensional guillotine bin packing problem. European Journal of Operational Research 192, 767–781 (2009)
Yager, R., Filev, D.: Essentials of Fuzzy Modeling and Control. John Wiley, New York (1984)
Fekete, S., Schepers, J.A.: General framework for bounds for higher-dimensional orthogonal packing problems. Mathematical Methods of Operations Research 60, 311–329 (2004)
Polyakovsky, S.J., M’Hallah, R.: New Trends in Applied Artificial Intelligence: An agent-based approach to knapsack optimization problems. In: Okuno, H.G., Ali, M. (eds.) IEA/AIE 2007. LNCS (LNAI), vol. 4570, pp. 1098–1107. Springer, Heidelberg (2007)
Burkard, R., Dell’Amico, M., Martello, S.: Assignment Problems. SIAM, Philadelphia (2009)
Polyakovsky, S.J., Valeeva, A.F., M’Hallah, R.: An Improved Heuristic for the Variable Sized Guillotine Bin Packing Problem. In: Proc. of the 9th Workshop on Comp. Science and Inform. Technologies, Russia, Ufa, pp. 34–37 (2007)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Polyakovskiy, S., M’Hallah, R. (2011). An Intelligent Framework to Online Bin Packing in a Just-In-Time Environment. In: Mehrotra, K.G., Mohan, C.K., Oh, J.C., Varshney, P.K., Ali, M. (eds) Modern Approaches in Applied Intelligence. IEA/AIE 2011. Lecture Notes in Computer Science(), vol 6704. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-21827-9_23
Download citation
DOI: https://doi.org/10.1007/978-3-642-21827-9_23
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-21826-2
Online ISBN: 978-3-642-21827-9
eBook Packages: Computer ScienceComputer Science (R0)