.png){kind=icon}
返回
A note on a due-date assignment on a two-machine flow-shop
.png){kind=icon}
PRE
AI
DOI：10.1016/S0305-0548(02)00225-3.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
We address a due-date assignment and scheduling problem in a two-machine flow-shop setting. Our objective is to find both the job schedule and the common due-date which minimize maximum earliness, tardiness and due-date costs. We introduce an efficient (O(n(2) log n)) solution, based on repetitive use of the well-known Johnson Algorithm.
Keyword:
scheduling
due-date assignment
earliness-tardiness
flow-shop
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
C
IF:
4.3
论文数:
6.5K
被引数:
1.8W
机构
暂无机构信息
引用论文
Overexpression of Gremlin-1 in Patients with Loeys-Dietz Syndrome: Implications on Pathophysiology and Early Disease Detection.png)
PLoS ONE
OAAI
PLoS ONEIF0
OAAI分享收藏
On the complexity of two-machine flowshop problems with due date related objectives关于具有到期日相关目标的两机流水车间问题的复杂性
PREAI
分享收藏A survey of the state-of-the-art of common due date assignment and scheduling research对通用到期日分配和计划研究的最新进展的调查
PREAI
分享收藏Scheduling in a two-machine flowshop with batch processing machine(s) for earliness/tardiness measure under a common due date在具有批处理机器的两机流水车间中进行调度，以在共同的到期日期内进行提前/迟到措施
PREAI
分享收藏 没有更多内容
没有更多内容