摘要
本文对不同交货期窗口下的提前／拖期单机调度问题进行了分析，给出了最优序列中相邻工件对所满足的必要条件，提出了两个调度优先级法则，并在给出评价函数的基础上对此问题使用了过滤束搜索算法．文章的最后给出了实验结果和结论．
In this paper,we deal with the single machine earliness and tardiness scheduling problem with different due windows. Give a necessary condition of adjacent jobs in a globally optimal sequence. Two dispatch priority rules are proposal. To solve this problem,we use Filtered Beam search algorithm based upon the evalution presented. And finally,we give the result of experiment and conclusion.
出处
《控制理论与应用》
EI
CAS
CSCD
北大核心
1998年第5期759-763,共5页
Control Theory & Applications
