.png){kind=icon}
返回
SINGLE-MACHINE SEQUENCING WITH CONTROLLABLE PROCESSING TIMES
.png){kind=icon}
PRE
AI
DOI：10.1016/0377-2217(92)90144-X.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
We consider a static single-machine sequencing problem in which job processing times are controllable variables with linear costs. All jobs have a common due data. The objective is to find optimal processing times, an optimal due date and an optimal sequence which will minimize a cost function containing earliness cost, tardiness costs, and total processing cost.
Keyword:
SCHEDULING
DUE DATE ASSIGNMENT
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6
论文数:
2.2W
被引数:
6.4W
机构
暂无机构信息
引用论文
.png){kind=icon}
没有更多内容
没有更多内容