论文部分内容阅读
Some dominance rules are proposed for the problems of scheduling N jobs on a single machine with due dates,sequence dependent setup times and no preemption. Two algorithms based on Ragatz's branch and bound scheme are developed including the dominance