| Article ID: | iaor2005525 |
| Country: | China |
| Volume: | 12 |
| Issue: | 4 |
| Start Page Number: | 42 |
| End Page Number: | 45 |
| Publication Date: | Aug 2003 |
| Journal: | Operations Research and Management Science |
| Authors: | Li Dong, Yang Dan |
| Keywords: | heuristics |
Based on the sequencing for the single and parallel machines with the same speeds, a new scheduling model for the parallel machines with different speeds is considered in this paper. The optimal goal of the model is to minimize the total tardiness of the schedule. Because it is an NP-hard problem, a new heuristic algorithm is developed. The numerical example shows the effectiveness of the algorithm.