.png){kind=icon}
返回
Two-agent scheduling problems under rejection budget constraints *
.png){kind=icon}
PRE
AI
DOI：10.1016/j.omega.2020.102313.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
We study two single machine scheduling problems with two competing agents and the option of re-jecting jobs. We seek to minimize the scheduling criterion of one agent under the condition that the maximum completion time of the second agent does not exceed a given upper-bound. Moreover, we as -sume that jobs are either scheduled or rejected (incurring job-dependent penalties) subject to an upper bound on the total rejection cost. The scheduling objective for the first agent is either the makespan or the total completion time, while that of the second agent is the makespan. As both problems are known to be NP-hard, we develop efficient pseudo-polynomial dynamic programming algorithms to obtain opti-mal solutions. The algorithms are shown to efficiently solve medium to large size problems through an extensive numerical study. Crown Copyright (c) 2020 Published by Elsevier Ltd. All rights reserved.
Keyword:
Single machine
Two-agents
Rejection
Dynamic programming
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
O
IF:
7.2
论文数:
3.8K
被引数:
1.4W
机构
引用论文
.png){kind=icon}
分享收藏Just-in-time scheduling with two competing agents on unrelated parallel machines在不相关的并行机器上使用两个竞争代理进行实时调度
PREAI
分享收藏
查看更多内容