.png){kind=icon}
返回
Minimizing due date related performance measures on two batch processing machines
.png){kind=icon}
PRE
AI
DOI：10.1016/S0377-2217(02)00352-1.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
This paper considers a scheduling problem in a two-machine flowshop of two batch processing machines. On each batch processing machine, jobs are processed in a batch, and each batch is allowed to contain jobs up to the maximum capacity of the associated machine. The scheduling problem is analyzed with respect to three due date related objectives including maximum tardiness, number of tardy jobs and total tardiness. In the analysis, several solution properties are characterized and based upon these properties, three efficient polynomial time algorithms are developed for minimizing the due date related measures. (C) 2002 Elsevier Science B.V. All rights reserved.
Keyword:
batch processing machine
scheduling
flowshop
due date related measures
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6
论文数:
2.2W
被引数:
6.4W
机构
暂无机构信息
引用论文
分享收藏Identification in the rat brain of a set of nuclear proteins interacting with H1° mRNA.png)
Neuroscience
NeuroscienceIF0
PREAI
分享收藏
查看更多内容