.png){kind=icon}
返回
Scheduling problems with a weight-modifying-activity
.png){kind=icon}
PRE
AI
DOI：10.1007/s10479-020-03782-7.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
We study single machine scheduling problems with an additional option of performing a weight-modifying-activity. If such an activity is performed, the cost of subsequent jobs is reduced, as reflected by smaller job-weights. We focus first on minimizing total weighted completion time. A pseudo-polynomial dynamic programming algorithm is introduced for this problem. Several special cases of unit processing time jobs are solved in polynomial time. We also solve in polynomial time (an extension of) the minmax version of the problem, by adapting the well-known Lawler's Algorithm for minimizing maximum cost on a single machine.
Keyword:
Scheduling
Single machine
Weight-modifying-activity
Total weighted completion time
Dynamic programming
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
4.5
论文数:
8.0K
被引数:
2.1W
机构
引用论文
.png){kind=icon}
Scheduling a maintenance activity and due-window assignment based on common flow allowance根据公共流量津贴安排维护活动和到期窗口分配
PREAI
分享收藏Single machine scheduling with general positional deterioration and rate-modifying maintenance具有一般位置劣化和速率修改维护的单机调度
PREAI
分享收藏Single machine common flow allowance scheduling with a rate-modifying activity具有速率修改活动的单机通用流量余量计划
PREAI
分享收藏A note to due-window assignment and single machine scheduling with deteriorating jobs and a rate-modifying activity关于作业恶化和速率修改活动的到期窗口分配和单机调度的注释
PREAI
分享收藏Two-parallel machines scheduling with rate-modifying activities to minimize total completion time
PREAI
分享收藏
查看更多内容