Resource Allocation Scheduling with Position-Dependent Weights and Generalized Earliness–Tardiness Cost

Abstract

Under just-in-time production, this paper studies a single machine common due-window (denoted by CONW) assignment scheduling problem with position-dependent weights and resource allocations. A job’s actual processing time can be determined by the resource assigned to the job. A resource allocation model is divided into linear and convex resource allocations. Under the linear and convex resource allocation models, our goal is to find an optimal due-window location, job sequence and resource allocation. We prove that the weighted sum of scheduling cost (including general earliness–tardiness penalties with positional-dependent weights) and resource consumption cost minimization is polynomially solvable. In addition, under the convex resource allocation, we show that scheduling (resp. resource consumption) cost minimization is solvable in polynomial time subject to the resource consumption (resp. scheduling) cost being bounded.

Keywords

• scheduling
• assignment problem
• resource allocation
• positional-dependent weights
• earliness–tardiness