| Article ID: | iaor2005528 |
| Country: | China |
| Volume: | 21 |
| Issue: | 3 |
| Start Page Number: | 91 |
| End Page Number: | 94 |
| Publication Date: | May 2003 |
| Journal: | Systems Engineering |
| Authors: | Xia Zunquan, Wang Jibo |
Discounted total weighted completion time in three-machine no-wait flow shop scheduling problem with separated setup times was studied. For some special cases the sufficient condition is presented to which the problem can be solved by polynomial algorithm. Under this condition, the no-wait flow shop scheduling problem can be given dispatching rules.