.png){kind=icon}
返回
Arc-flow approach for single batch-processing machine scheduling
.png){kind=icon}
OA
AI
DOI：10.1016/j.cor.2021.105394.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
We address the problem of scheduling jobs with non-identical sizes and distinct processing times on a single batch-processing machine, aiming at minimizing the makespan. The extensive literature on this NP-hard problem mostly focuses on heuristics. Using an arc-flow based optimization approach, we construct a novel formulation that represents it as a problem of determining flows in graphs. The size of the formulation increases with the machine capacity and with the number of distinct sizes and processing times among the jobs, but it does not increase with the number of jobs, which makes it very effective to solve large instances to optimality, especially when multiple jobs have equal size and processing time. We compare our model to other models from the literature, showing its clear superiority on benchmark instances and proving optimality of random instances with up to 100 million jobs.
Keyword:
Scheduling
Batch-processing machine
Makespan
Arc-flow
Symmetry
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
C
IF:
4.3
论文数:
6.5K
被引数:
1.8W
机构
引用论文
.png){kind=icon}
Bin packing and cutting stock problems: Mathematical models and exact algorithms装箱和切割库存问题: 数学模型和精确算法
PREAI
分享收藏
查看更多内容