A convenient notation for theoretic scheduling problems was introduced by Ronald Graham, Eugene Lawler, Jan Karel Lenstra and Alexander Rinnooy Kan in It consists of three fields: α, β and γ Each field may be a comma separated list of words The α field describes the machine environment, β the job characteristics and constraints, and γ the objective function...