BeheshtiNia , M.A.

[ 1 ] - کمینه‌سازی حداکثر زمان تکمیل در مسأله زمانبندی تولید کارگاهی با ماشینهای موازی

In this paper the problem of job shop scheduling with parallel machines in each stages is discussed. The objective is to minimize the maximum completion time (makespan).This problem is a combination of two classic problems of job shop and parallel machines which in this case parallel machines has been used as kind of flexibility in the job shop problem. The review of literature has shown that t...