摘要
研究了一个单机带拒绝的排序问题,目标函数是最小化接受工件的最大完工时间与所有被拒绝工件的拒绝费用之和。首先给出了此问题的混合整数规划模型,并得到了最优解的一些性质。最后给出了一个分支定界算法,并给出了数值模拟的结果。
This paper considers the single machine scheduling problem with job rejection. The objective function is to minimize the sum of the maximum completion time of the job and the rejection lost of allrejected jobs. Firs t ly , the paper introduces a mixed integer programming model and some properties of the optimal solution. Finally,a branch-and-bound algorithm and a numerical simulation are presented.
出处
《华东理工大学学报（自然科学版）》
CSCD
北大核心
2017年第6期890-894,898,共6页
Journal of East China University of Science and Technology
关键词
排序
单机
拒绝
分支定界
scheduling
singlemachine
rejection
branch-and-bound
