.png){kind=icon}
返回
Solving single batch-processing machine problems using an iterated heuristic
.png){kind=icon}
PRE
AI
DOI：10.1080/00207543.2010.518995.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
This article considers the problem of minimising total weighted tardiness on a batch-processing machine with compatible product families, job release dates and non-identical job sizes. A batch-processing machine can process several jobs as long as the total size of jobs in the batch does not exceed the machine's capacity. All jobs in the batch are started and completed at the same time. Batch processing time is equal to the longest job processing time among jobs in the batch. This article proposes a two-phase heuristic, in which a population-based reasoning approach is developed to determine the sequence of jobs based on their intensity values at positions in the first phase, and a dynamic programming algorithm to divide the ordered jobs into batches sequentially. An iterated heuristic is also proposed to improve solution quality further. Computational results show that high-quality solutions can be obtained by the proposed heuristic algorithms in a very short time.
Keyword:
batch-processing machine
total weighted tardiness
scheduling
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
7.3
论文数:
1.1W
被引数:
3.7W
机构
暂无机构信息
引用论文
.png){kind=icon}
分享收藏Minimizing makespan on a single burn-in oven in semiconductor manufacturing在半导体制造中最大程度地减少单个老化炉的制造时间
PREAI
分享收藏
查看更多内容