<p>This paper considers due-window assignment scheduling problem with resource allocation. Under common and slack due-window assignments, the goal is to determine the optimal sequence of all jobs, the starting and finishing time of due-window, and optimal resource allocation. For the convex resource consumption function, the objective is to minimize the weighted sum of earliness, tardiness, number of early and late jobs, due-window starting time, and due-window size subject to total resource consumption cost no greater than a given limit. This problem is proved to be NP-hard, for some special cases, we proved that the problem can be solved in polynomial time; for the general case, we propose branch-and-bound and heuristic algorithms to solve the problem.</p>