Priority Rules and Techniques
Scheduling n Jobs on One Machine
Let ux compare some of these 10 priority rules in a static scheduling situation involving four jobs on one machine. (In scheduling terminology. this class of problems is referred to as an “n job-one-machine problem.’ or simply The theoretical difficulty of this type of problem increases as.more machines are considered: therefore. the only restriction on n is that it