A Job Scheduling Model and Heuristic Algorithm for Minimizing the Range of Lateness and Makespan on Parallel Machines

In this paper ,based on JIT management technique, a multi objective job scheduling model is presented. After a new algorithm is presented for minimizing the range of lateness on a single machine , a heuristic algorithm (named M-R algorithm)is given to be applied to the parallel machines' systems . Finally , an illustrative example is given.