LIST SCHEDULING FOR JOBS WITH ARBITRARY RELEASE TIMES AND UNIT-PROCESSING TIME
We investigate the problem of on-line scheduling for jobs with arbitrary release times on midentical parallel machines. The goal is to minimize the makespan. For a special case that all the jobs have unit- processing time, we prove that algorithm LS has a tight bound of for general mmachines.
on-line scheduling, makespan, competitive ratio, identical parallel machines.
