Single-machine common due-date scheduling with batch delivery costs and resource-dependent processing times

Abstract

In this paper we consider the problem of single-machine batch delivery scheduling with an assignable common due date and controllable processing times. The job processing time is either a linear or a convex function of the amount of a continuously divisible and non-renewable resource allocated to the job. Finished jobs are delivered in batches and there is no capacity limit on each delivery batch. The objective is to find a job sequence, a partition of the job sequence into batches, a common due date, and resource allocation that jointly minimise a cost function based on earliness, weighted number of tardy jobs, job holding, due-date assignment, batch delivery, makespan, and resource consumption. We provide some properties of the optimal solution, and show that the problem with the linear and convex resource consumption functions can be solved in and time, respectively. We also show that some special cases of the problem can be solved by lower-order algorithms.