.png){kind=icon}
返回
A mixed integer programming approach for the single machine problem with unequal release dates
.png){kind=icon}
PRE
AI
DOI：10.1016/j.cor.2014.06.013.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
In this paper, we consider the problem of scheduling on a one-machine, a set of operations subject to unequal release dates with respect to the total completion time. This problem is known to be NP-hard in the strong sense. We propose an algorithm based on a Mixed Integer Linear Programming. This algorithm includes the implementation of a preprocessing procedure together with the consideration of valid inequalities. A computer simulation to measure the performance of the algorithm shows that our proposed method outperforms state-of-the-art branch-and-bound algorithms. (C) 2014 Elsevier Ltd. All rights reserved.
Keyword:
Mixed integer programming
Preprocessing
Valid inequalities
Release dates
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
C
IF:
4.3
论文数:
6.5K
被引数:
1.8W
机构
引用论文
.png){kind=icon}
Promotion of monolayer formation in cultured whole pancreatic islets by 3-isobutyl-1-methylxanthine.
OAAI
OAAI分享收藏Third-order exceptional point and successive switching among three states in an optical microcavity光学微腔中三阶异常点和三个状态之间的连续切换OAAI
OAAI分享收藏
查看更多内容