Abstract: Recently, Chou, Queyranne, Simchi-Levi and Liu respectively prove that the heuristics based on weighted shortest processing time among the available jobs are asymptotically optimal for the uniform parallel machine and the flow shop problem scheduling prob

Key words: Scheduling, Multiprocessor flow shop scheduling, Heuristic algorithm, Asymptotically optimal analysis