An improved branch and bound algorithm for single machine scheduling with deadlines to minimize total weighted completion time
Year of publication: |
2003
|
---|---|
Authors: | Pan, Yunpeng |
Published in: |
Operations research letters. - Amsterdam [u.a.] : Elsevier, ISSN 0167-6377, ZDB-ID 7207359. - Vol. 31.2003, 6, p. 492-496
|
Saved in:
Saved in favorites
Similar items by person
-
Branch-and-bound algorithms for solving hard instances of the one-machine sequencing problem
Pan, Yunpeng, (2006)
-
Branch-and-bound algorithms for solving hard instances of the one-machine sequencing problem
Pan, Yunpeng, (2006)
-
Dual relaxations of the time-indexed ILP formulation for min-sum scheduling problems
Pan, Yunpeng, (2017)
- More ...