.png){kind=icon}
返回
Machine scheduling with soft precedence constraints
.png){kind=icon}
PRE
AI
DOI：10.1016/j.ejor.2019.09.041.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
This paper introduces a new concept, soft precedence constraint (SPC), in machine scheduling problems. Similar to the conventional precedence constraint, SPC specifies some partial order over the jobs; however, an SPC can be violated, but with a certain penalty or cost. The scheduling problem is to balance the tradeoff between the SPC violation penalty and other criteria relative to job completion times. We focus on studying a special case where SPC is defined by a bipartite network. This case is motivated by the berth allocation problem at a transshipment port, where the SPC models any missed container connections from feeder vessels to ocean-going vessels. We discuss the complexity of the problems for different scenarios and develop approximation algorithms. (C) 2019 Elsevier B.V. All rights reserved.
Keyword:
Scheduling
Precedence constraint
Soft precedence constraint
Approximation algorithm
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6
论文数:
2.2W
被引数:
6.4W
机构
引用论文
.png){kind=icon}
Toxicological evaluations of carcinogens and noncarcinogens: Pros and cons of different approaches
PREAI
分享收藏
查看更多内容