Single machine common due window scheduling with controllable job processing times

Abstract

We consider a nonpreemptive single machine common due window scheduling problem where the job processing times are controllable with linear costs and the due window is movable. The objective is to find a job sequence, a processing time for each job, and a position of the common due window to minimize the total cost of weighted earliness/tardiness and processing time compression. We discuss some properties of the optimal solutions and provide a polynomial time algorithm to solve the problem. © Springer-Verlag Berlin Heidelberg 2007.