.png){kind=icon}
返回
Mixed-time representation for state-task network models
.png){kind=icon}
PRE
AI
DOI：10.1021/ie0500117.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
A new mixed-time representation for STN-based scheduling models is proposed: the time grid is fixed, but processing times are allowed to be variable and span an unknown number of time periods. The proposed representation handles batch and continuous processes, and it accounts linearly for holding, backlog, and utility costs. It handles release and due dates at no additional computational cost, and it accounts for variable processing times. Computational improvements for the solution of the proposed mixed-integer programming formulation are also developed.
Keyword:
MULTIPURPOSE BATCH PLANTS
GENERAL ALGORITHM
FORMULATION
OPERATIONS
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
I
IF:
3.9
论文数:
4.0W
被引数:
9.6W
机构
暂无机构信息
引用论文
The structure of Staphylococcus aureus epidermolytic toxin A, an atypic serine protease, at 1.7 Å resolution.png)
Structure
OAAI
StructureIF0
OAAI分享收藏分享收藏 没有更多内容
没有更多内容