Computers & Industrial Engineering ( IF 7.9 ) Pub Date : 2021-01-22 , DOI: 10.1016/j.cie.2021.107138 Gur Mosheiov , Daniel Oron
We study a single machine scheduling problem with a rate modifying activity. In most cases, performing such an activity (e.g., a maintenance procedure) improves the system performance, as reflected by shorter processing times of the jobs processed after it. The scheduling measure assumed is total late work: each job is considered as a collection of unit-time jobs, and the late work is defined as the number of tardy units. The problem is NP-hard, and we introduce and test numerically a pseudo-polynomial dynamic programming algorithm. Our results indicate that the algorithm solves large problem instances efficiently.
中文翻译:
关于安排费率修改活动以最大程度减少后期工作的说明
我们研究具有速率修改活动的单机调度问题。在大多数情况下,执行此类活动(例如,维护程序)可以提高系统性能,这反映为在此任务之后处理的作业的处理时间较短。假定的计划度量是总的迟到工作:每个工作被视为单位时间工作的集合,而迟到工作则定义为迟到的单元数。这个问题是NP难的,我们引入并数值测试了一个伪多项式动态规划算法。我们的结果表明,该算法可有效解决大型问题实例。