| Article ID: | iaor20063357 |
| Country: | China |
| Volume: | 35 |
| Issue: | 8 |
| Start Page Number: | 89 |
| End Page Number: | 93 |
| Publication Date: | Aug 2005 |
| Journal: | Mathematics in Practice and Theory |
| Authors: | Wang Jibo |
| Keywords: | programming: branch and bound |
The two-machine flowshop scheduling problem where set-up times are separated and sequence independent is considered. The objective function is to minimize total weighted completion time. For a special case the sufficient condition is presented in which the problem can be solved by a polynomial algorithm. Moreover, a branch and bound algorithm is given.