摘要
以优势准则构建一个分枝状精确算法,最小化一个存在共同宽容交货期单机调度(排序)问题的加权超前延误工件总数,分枝个数可减少50%.
In order to minimize the total weighted number of early and tardy jobs of a scheduling problem with common due window, a branch algorithm with almost fewer than a half of the branches in an existent algorithm is developed.
出处
《深圳大学学报（理工版）》
EI
CAS
北大核心
2006年第2期161-164,共4页
Journal of Shenzhen University(Science and Engineering)
基金
深圳大学科研启动基金资助项目(200552)
