.png){kind=icon}
返回
Three perspectives for solving the job grouping problem
.png){kind=icon}
PRE
AI
DOI：10.1080/00207540110072984.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
The production efficiency of printed circuit board (PCB) assembly depends strongly on the organization of the component placement jobs. This is characteristic, especially in a high-mix low-volume production environment. The present study discusses the problem of arranging the jobs of one machine into groups in such a way that the job change costs will be minimized when the costs depend on the number of the job groups. This problem is motivated by the practical case where the group utilizes a common machine set-up and the number of set-up occasions is the dominating factor in the production line optimization. The problem is well known and its large instances are hard to solve to optimality. We show how real-life problem instances can be solved by three different methods: efficient heuristics, 0/1-programming, and constraint programming. The first two of these are standard approaches in the field, whereas the application of constraint programming is new for the job grouping problem. The heuristic approach turns out to be efficient: algorithms are fast and produce optimal or nearly optimal groupings. 0/1-programming is capable of finding optimal solutions to small problem instances and it therefore serves as a benchmark to approximative methods. The constraint approach solves moderately large problem instances to optimality and it has the great advantage that changing the problem formulation is relatively easy - one can add new constraints or modify the details of the existing ones flexibly.
Keyword:
SET-UP
ALGORITHMS
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
7.3
论文数:
1.1W
被引数:
3.7W
机构
暂无机构信息
引用论文
分享收藏
The construction of a high-density consensus genetic map for soybean based on SNP markers derived from genotyping-by-sequencing.png)
Genome
OAAI
GenomeIF0
OAAI分享收藏
查看更多内容