A posterior competitiveness for list scheduling algorithm on machines with eligibility constraints

We consider the on-line problem of scheduling n independent jobs on m identical machines under the machine eligibility constraints, where each job has its own specified subset of machines which are eligible for processing it. We investigate a greedy algorithm LS and prove its posterior competitiveness ratio is log24/λm − 1/λ, where λ is the number of machines eligible for processing the job with the latest completion time.