Due date assignment for customer orders has been studied in various productionenvironments using different modeling approaches. In this paper the researchers consider aproduction system in which the orders of several customers are produced in a single batch because ofthe economy of scale. If a batch is completed before receiving customer orders, inventory carryingcost is incurred but if it is c...

We study the earliness-tardiness scheduling problem on a single machine with due date assignment and controllable processing times. We analyze the problem with three different due date assignment methods and two different processing time functions. For each combination of these, we provide a polynomialtime algorithm to find the optimal job sequence, due date values and resource allocation minim...

In enterprise management, there are often multiple agents competing for the same products to reduce production cost. On this basis, paper investigates a two-agent slack due-date single-machine scheduling problem with deteriorating jobs, where processing time of job is extended as function position-dependent workload, resource allocation and common deterioration rate. The goal find optimal seque...

We study a common due-date assignment problem on two parallel uniform machines. The jobs are assumed to have identical processing times, and job-dependent asymmetric earliness tardiness unit costs. scheduler may process only subset of the jobs, i.e. option job-rejection is allowed. objective function consists three cost components: total earliness-tardiness all scheduled due-date, rejection cos...