摘要
本文研究带权误工工件数排序问题.在分析工件间优先关系的基础上,提出一种新的分支定界算法,可以求解85个工件的大型问题.
In the present paper the problem of sequencing jobs on a single machine to minimize the weighted number of tardy jobs is considered. Some new dominances between jobs are proposed and studied.A new branch and bound algorithm that can solve large problems, e.g. 85 jobs, is presented.
出处
《上海第二工业大学学报》
1990年第1期10-15,共6页
Journal of Shanghai Polytechnic University