.png){kind=icon}
返回
OPTIMAL DUE-DATE ASSIGNMENT AND SEQUENCING
.png){kind=icon}
PRE
AI
DOI：10.1016/0377-2217(92)90343-8.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
This paper examines the problem of assigning due-dates to a given set of jobs and sequencing them on a single machine in order to minimize the cost of quoting long due-dates and that of missing the quoted due-dates. Properties required for the solution of the problem are identified, leading to the recognition that the problem is computationally difficult. It is shown, however, that there are special cases of the problem which can be solved easily. Viable solution strategies for the general problem, both exact and approximate, are also proposed.
Keyword:
SCHEDULING
MATHEMATICAL PROGRAMMING
APPROXIMATION SCHEME
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6
论文数:
2.2W
被引数:
6.4W
机构
暂无机构信息
引用论文
.png){kind=icon}
分享收藏
查看更多内容