Abstract
The purpose of this paper is present two approximation algorithms for a scheduling problem to minimize the makespan with n jobs and m parallel machines with different processing rates. Those two algorithms are based on "LPT rule" and "Modified-LPT rule" for identical machines and are named "Expanded LPT (ELPT) rule" and "Modified-Expanded LPT (M-ELPT) rule" respectively. Three lower bounds on the makespan have been developed, and computational results for ELPT rule and M-ELPT rule are presented and compared.
