An Interlacing Form Scheduling Problem with a Common Due Window

This paper focuses on the single machine scheduling problem with a common due window.It is proved NP-hard when the width of the due window is given and the site of the due window is free,this paper constructs the corresponding dynamic programming algorithm to slove it.