.png){kind=icon}
返回
A batch scheduling model for m heterogeneous batch processor
.png){kind=icon}
PRE
AI
DOI：10.1080/00207543.2015.1056322.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
This research addresses a batch scheduling problem for single item parts with multi due date on m heterogeneous batch processors. The objective is to minimise total actual flowtime of parts through the shop. The total actual flowtime of parts in a batch is the multiplication of the interval between batch arrival time and the due date by the number of parts in the batch. Using the actual flowtime as the objective means it is oriented to satisfy the due date as a commitment to customers, and simultaneously to minimise the length of time of the parts spending in the shop. An algorithm to solve this problem is proposed.
Keyword:
actual flowtime
batch processor
batch scheduling
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
7.3
论文数:
1.1W
被引数:
3.7W
机构
引用论文
.png){kind=icon}
Makespan minimization on single batch-processing machine via ant colony optimization基于蚁群优化的单台批处理机上Makespan最小化
PREAI
分享收藏
查看更多内容