Packing items to feed assembly lines |
| |
Authors: | Mauricio C. de Souza Carlos R.V. de Carvalho Wellington B. Brizon |
| |
Affiliation: | 1. Departamento de Engenharia de Produção, Universidade Federal de Minas Gerais, Rua Espirito Santo 35, cep 30160-030, Belo Horizonte, MG, Brazil;2. Métodos de Logística, FIAT Automóveis s/a, Betim, MG, Brazil |
| |
Abstract: | We treat a practical application of packing problems in feeding assembly lines. This study was motivated by a real situation encountered in the shop floor of a major automobile industry plant in Brazil. The assembly line feed problem (LFP) consists in how pack the items in the available containers to meet the line work centers’ requirements with a minimum total cost over the planning horizon. LFP is a variable-sized bin packing problem that has two special features: (i) a cardinality constraint on each bin’s size; and, (ii) a cost structure such that each bin’s cost varies according to the items that are packed in it. We propose an integer programming model and a GRASP heuristic for LFP. Numerical results on real-life test instances are reported. |
| |
Keywords: | Packing Metaheuristics Assembly lines Shop floor logistics GRASP |
本文献已被 ScienceDirect 等数据库收录! |
|