This paper considers the issue of how to rescheduling all jobs under the fixed order of the original jobs, and subject to the limit of disruptions.

• 本文着重研究了这种使先来顾客的工件保持相对固定顺序，在有限错位限制的条件下使总目标函数值最优的重新排序问题。