单机总加权拖期问题--它是一个已解决的问题吗？
The Single Machine Total Weighted Tardiness Problem - Is it (for Metaheuristics) a Solved Problem ?
摘要：
研究了单机总加权延误问题（SMTWTP）的一种比较简单的局部搜索算法，即爬山法和变邻域搜索法。特别是，我们重新审视SMTWTP的这些方法，因为在这种情况下似乎缺乏适当/具有挑战性的基准实例。取得的成果确实令人印象深刻。只有很少的例子仍然没有解决，即使是那些近似在1%的最佳/最佳已知的解决方案。我们的实验支持这样一种说法，即SMTWTP的元分析很可能会产生良好的结果，并且在改进搜索策略之前，必须在基准数据的命题方面做更多的工作。这些数据集的建设的一些建议来自我们的调查。
英文摘要：
The article presents a study of rather simple local search heuristics for the single machine total weighted tardiness problem (SMTWTP), namely hillclimbing and Variable Neighborhood Search. In particular, we revisit these approaches for the SMTWTP as there appears to be a lack of appropriate/challenging benchmark instances in this case. The obtained results are impressive indeed. Only few instances remain unsolved, and even those are approximated within 1% of the optimal/best known solutions. Our experiments support the claim that metaheuristics for the SMTWTP are very likely to lead to good results, and that, before refining search strategies, more work must be done with regard to the proposition of benchmark data. Some recommendations for the construction of such data sets are derived from our investigations.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
