SCHEDULING JOBS WITH DIFFERENT, JOB-DEPENDENT EARLINESS AND TARDINESSPENALTIES USING THE SLK METHOD

The single machine job scheduling problem, where due dates are assigne d using the SLK due date determination method, is examined assuming di fferent penalties for the early and tardy jobs. These penalties are as sumed to be job-dependent, proportional to the processing times of job s raised to an integer, non-negative power. The objective function is the total weighted lateness. Several cases are examined and four algor ithms providing the optimal sequences for these cases are presented. E xamples are given and conclusions are drawn.