Please use this identifier to cite or link to this item:
|Scopus||Web of Science®||Altmetric|
|Title:||An intelligent framework to online bin packing in a just-in-time environment|
|Citation:||Modern Approaches in Applied Intelligence, Part 2, 2011 / Mehrotra, K.G., Mohan, C.K., Oh, J.C., Varshney, P.K., Moonis, A. (ed./s), vol.6704 LNAI, iss.PART 2, pp.226-236|
|Series/Report no.:||Lecture Notes in Computer Science; 6704|
|Conference Name:||International conference on industrial engineering and other applications of applied intelligent systems (28 Jun 2011 - 01 Jul 2011 : Syracuse, New York)|
|Sergey Polyakovskiy, and Rym M'Hallah|
|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.|
|Keywords:||Multi-agent; bin packing; parallel machine scheduling; JIT|
|Rights:||© Springer-Verlag Berlin Heidelberg 2011|
|Appears in Collections:||Computer Science publications|
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.