.png){kind=icon}
返回
A tabu search algorithm for parallel machine total tardiness problem
.png){kind=icon}
PRE
AI
DOI：10.1016/S0305-0548(02)00198-3.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
In this study, we consider the problem of scheduling a set of independent jobs with sequence dependent setups on a set of uniform parallel machines such that total tardiness is minimized. Jobs have non-identical due dates and arrival times. A tabu search (TS) approach is employed to attack this complex problem. In order to obtain a robust search mechanism, several key components of TS such as candidate list strategies, tabu classifications, tabu tenure and intensification/diversification strategies are investigated. Alternative approaches to each of these issues are developed and extensively tested on a set of problems obtained from the literature. The results obtained are considerably better than those reported previously and constitute the best solutions known for the benchmark problems as to date.
Keyword:
scheduling
parallel machines
total tardiness problem
sequence dependent setup times
tabu search
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
C
IF:
4.3
论文数:
6.5K
被引数:
1.8W
机构
暂无机构信息
引用论文
.png){kind=icon}
Performance enhancements to tabu search for the early/tardy scheduling problem针对早期/迟缓调度问题的禁忌搜索的性能增强
PREAI
分享收藏A Randomized Trial Comparing a Brief Meditation Retreat to a Vacation: Effects on Daily Well-Being
PREAI
分享收藏
查看更多内容