Branch-and-bound algorithms for solving hard instances of the one-machine sequencing problem

Branch-and-bound algorithms for solving hard instances of the one-machine sequencing problem

Pan, Yunpeng, (2006)

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

Pan, Yunpeng, (2003)

Dual relaxations of the time-indexed ILP formulation for min-sum scheduling problems

Pan, Yunpeng, (2017)