Minimizing the number of tardy jobs with generalized due-dates and position-dependent processing times

IF 1.3 4区数学 Q2 MATHEMATICS, APPLIED

Optimization Letters Pub Date : 2024-09-13 DOI:10.1007/s11590-024-02138-5

Enrique Gerstl, Gur Mosheiov

引用次数: 0

Abstract

We study a single machine scheduling problem with generalized due-dates and general position-dependent job processing times. The objective function is minimum number of tardy jobs. The problem is proved to be NP-hard in the strong sense. We introduce an efficient algorithm that solves medium size problems in reasonable running time. A simple and efficient heuristic is also introduced, which obtained the optimal solution in the vast majority of our tests.

Abstract Image

查看原文本刊更多论文

最大限度地减少迟到工作的数量，同时采用通用的到期日和与位置相关的处理时间

我们研究的是一个单机调度问题，该问题具有一般化的到期日和与位置相关的一般作业处理时间。目标函数是迟到作业的最小数量。该问题被证明是强意义上的 NP 难题。我们引入了一种高效算法，能在合理的运行时间内解决中等规模的问题。我们还介绍了一种简单高效的启发式算法，它在绝大多数测试中都能获得最优解。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文求助全文

来源期刊

Optimization Letters 管理科学-应用数学

CiteScore

3.40

自引率

6.20%

发文量

116

审稿时长

9 months

期刊介绍： Optimization Letters is an international journal covering all aspects of optimization, including theory, algorithms, computational studies, and applications, and providing an outlet for rapid publication of short communications in the field. Originality, significance, quality and clarity are the essential criteria for choosing the material to be published. Optimization Letters has been expanding in all directions at an astonishing rate during the last few decades. New algorithmic and theoretical techniques have been developed, the diffusion into other disciplines has proceeded at a rapid pace, and our knowledge of all aspects of the field has grown even more profound. At the same time one of the most striking trends in optimization is the constantly increasing interdisciplinary nature of the field. Optimization Letters aims to communicate in a timely fashion all recent developments in optimization with concise short articles (limited to a total of ten journal pages). Such concise articles will be easily accessible by readers working in any aspects of optimization and wish to be informed of recent developments.