.png){kind=icon}
返回
Heuristic algorithms for solving the maximum lateness scheduling problem with learning considerations
.png){kind=icon}
PRE
AI
DOI：10.1016/j.cie.2006.10.007.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
In many situations, a worker's ability improves as a result of repeating the same or similar task; this phenomenon is known as the learning effect. In this paper, the learning effect is considered in a single-machine maximum lateness minimization problem. A branch-and-bound algorithm, incorporating several dominance properties, is provided to derive the optimal solution. In addition, two heuristic algorithms are proposed for this problem. The first one is based on the earliest due date (EDD) rule and a pairwise neighborhood search. The second one is based on the simulated annealing (SA) approach. Our computational results show that the SA algorithm is surprisingly accurate for a small to medium number of jobs. Moreover, the SA algorithm outperforms the traditional heuristic algorithm in terms of quality and execution time for a large number of jobs. (c) 2006 Elsevier Ltd. All rights reserved.
Keyword:
scheduling
simulated annealing
single machine
maximum lateness
learning effect
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6.5
论文数:
1.0W
被引数:
3.8W
机构
暂无机构信息
引用论文
.png){kind=icon}
Feeding status and bacterial LPS-induced cytokine and neuropeptide gene expression in hypothalamus
OAAI
OAAI分享收藏分享收藏
查看更多内容