Evaluating scheduling heuristics for non-identical parallel processors

Abstract

Job allocation and job sequencing decisions are combined to develop scheduling heuristics for non-identical parallel processor systems. Several factors affecting the system are examined and the relative performance of the heuristics are evaluated in terms of flow time, tardiness and proportion of tardy jobs. An understanding of the relationship between variables in a scheduling system leads to decision rules that provide feasible and effective production schedules.