An improved branch and bound algorithm for single machine scheduling with deadlines to minimize total weighted completion time

Yunpeng Pan. An improved branch and bound algorithm for single machine scheduling with deadlines to minimize total weighted completion time. Oper. Res. Lett., 31(3):492-496, 2003. [doi]

References

No references recorded for this publication.

Cited by

No citations of this publication recorded.