Affiliation:
1. Northeastern University
Abstract
This paper considers the m-machine flow shop problem to minimize weighted completion time. A heuristic algorithm is presented to deal with the problem for large size problem. At the end of the paper, some numerical experiments show the effectiveness of the heuristic.
Publisher
Trans Tech Publications, Ltd.