.png){kind=icon}
返回
Scheduling with batching: A review
.png){kind=icon}
PRE
AI
DOI：10.1016/S0377-2217(99)00153-8.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
There is an extensive literature on models that integrate scheduling with batching decisions. Jobs may be batched if they share the same setup on a machine. Another reason for batching occurs when a machine call process several jobs simultaneously. This paper reviews the literature on scheduling with batching, giving details of the basic algorithms, and referencing other significant results. Special attention is given to the design of efficient dynamic programming algorithms for solving these types of problems. (C) 2000 Elsevier Science B.V. All rights reserved.
Keyword:
scheduling
batching
families
review
complexity
algorithm
dynamic programming
approximation
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6
论文数:
2.2W
被引数:
6.4W
机构
暂无机构信息
引用论文
.png){kind=icon}
Brain‐derived neurotrophic factor protects cementoblasts from serum starvation‐induced cell death
PREAI
分享收藏
查看更多内容