.png){kind=icon}
返回
Packing items to feed assembly lines
.png){kind=icon}
PRE
AI
DOI：10.1016/j.ejor.2006.09.091.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
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. UP 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. (C) 2006 Elsevier B.V. All rights reserved.
Keyword:
packing
metabeuristics
assembly lines
shop floor logistics
GRASP
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6
论文数:
2.2W
被引数:
6.4W
机构
暂无机构信息
引用论文
Reduced white matter microstructural integrity correlates with cognitive deficits in minimal hepatic encephalopathy轻度肝性脑病中白质微结构完整性降低与认知缺陷相关.png)
Gut
GutIF0
PREAI
分享收藏Growth Performance After Agouti-Signaling Protein 1 (Asip1) Overexpression in Transgenic ZebrafishZebrafish
ZebrafishIF0
PREAI
分享收藏
查看更多内容