Title of article
Branch-and-bound algorithms for solving hard instances of the one-machine sequencing problem
Author/Authors
Yunpeng Pan، نويسنده , , Leyuan Shi، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2006
Pages
10
From page
1030
To page
1039
Keywords
One-machine , Branch-and-bound , Hard instances , Scheduling
Journal title
European Journal of Operational Research
Serial Year
2006
Journal title
European Journal of Operational Research
Record number
215703
Link To Document