摘要
文章研究了工件可拒绝的单机双代理排序问题.可拒绝意味着决策者会选择拒绝一些获利较小耗费资源多的工件,但拒绝会产生相应的拒绝费用.第一个代理工件可拒绝,目标函数为总误工、总权误工损失、总完工时间与拒绝费用之和.在第二个代理工件的总权误工工件数不超过定值的情况下,寻找一个使得第一个代理的目标函数值最小的排序方案.文章提出了相应排序问题的最优性质及伪多项式时间动态规划算法,分析了算法的时间复杂度,最后通过算例来说明了算法的可行性.
This paper considers the two-agent scheduling problem with rejection on the single machine.Rejection means that jobs can be accepted or rejected when they arrive,but rejection will result in corresponding expense,and decision makers will choose to reject some jobs which are less profitable and more consume resources.The jobs of the first agent can be rejected,and the objective functions are to minimize the total tardiness,the weighted late work and the total completion time.The number of weighted tardy jobs of the second agent does not exceed the fixed value.We will find a schedule that minimizes the objective functions of the first agent.The optimal properties of the corresponding scheduling problems and the pseudo-polynomial time dynamic programming algorithms are proposed,and the time complexity of the algorithms are also analyzed.Finally,we illustrate the feasibility of the algorithms.
作者
张新功
李露
ZHANG Xingong;LI Lu(School of Mathematical Science,Chongqing Normal University,Chongqing 401331)
出处
《系统科学与数学》
CSCD
北大核心
2022年第9期2482-2496,共15页
Journal of Systems Science and Mathematical Sciences
基金
国家自然科学基金重大项目(11991022)
国家自然科学基金面上项目(11971443)
重庆市教委重点项目(KJZD-K202000501),重庆市教委研究生教改重点项目(YJG182019)
重庆市科委项目(cstc2021jcyj-msxmX0229)
“最优化理论与方法及其应用”创新创业示范团队项目(CQYC20210309536)
贵州省教育厅自然科学创新群体重大项目(黔教合KY字[2017]051)资助课题。
关键词
排序
双代理
拒绝费用
总权误工工件数
动态规划算法
Scheduling
two-agent
rejection cost
the number of weighted tardy jobs
dynamic programming algorithm
