公共工期排序问题的分枝定界算法

The Branch and Bound Algorithm for the Common Due Date Scheduling Problem

本文着重对以极小化延误损失为目标的公共工期单机排序问题 1|d|ΣWiTi 进行了研究 .根据该问题的性质 ,我们设计一个分枝定界算法 .

In this paper,much attention is paid to study the common due date weighted tardiness problem of single machine scheduling.Based on the properties of the problem 1|d|∑W iT i,a branch and bound algorithm is designed by implicit enumerative methods.