| Article ID: | iaor20081731 |
| Country: | China |
| Volume: | 36 |
| Issue: | 4 |
| Start Page Number: | 144 |
| End Page Number: | 150 |
| Publication Date: | Apr 2006 |
| Journal: | Mathematics in Practice and Theory |
| Authors: | Zeng Xiangge |
| Keywords: | heuristics |
A quick and efficient heuristic algorithm is proposed in this paper to solve parallel machines bi-criteria scheduling problem with families and constraint of Mold's number. The algorithm is compared with benchmark methods, EDD, LPT and SLACK by using random orders. It is shown that the algorithm performs better than EDD, LPT and SLACK to solve the problem. So the algorithm could be applied in molding manufacturing.