.png){kind=icon}
返回
Minmax scheduling problems with a common due-window
.png){kind=icon}
PRE
AI
DOI：10.1016/j.cor.2008.06.001.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
This paper focuses on a minmax due-window assignment problem. The goal is to schedule the jobs and the due-window such that the highest cost among all jobs is minimized. The objective function contains four cost components: for earliness, tardiness, due-window starting time and due-window size. We present a polynomial time solution for the case of a single machine and for a two-machine flow-shop. The cases of parallel identical machines and uniform machines are NP-hard, and simple heuristics and lower bounds are introduced and tested numerically.
Keyword:
Scheduling
Earliness-tardiness
Common due-window
Minmax
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
C
IF:
4.3
论文数:
6.5K
被引数:
1.8W
机构
引用论文
.png){kind=icon}
Diverse regulatory activity of human heat shock proteins 60 and 70 on endotoxin-induced inflammation
PREAI
分享收藏A survey of the state-of-the-art of common due date assignment and scheduling research对通用到期日分配和计划研究的最新进展的调查
PREAI
分享收藏
Growth of Dialium guineense Willd Seedlings and Changes in Some Chemical Properties in Soil Amended with Brewery Effluent西非紫荆木（Dialium guineense Willd）幼苗的生长及用啤酒厂废水改良土壤后某些化学性质的变化
PREAI
分享收藏 没有更多内容
没有更多内容