LAUSR

Abstract In this paper, we study a single machine scheduling problem by simultaneously considering the processing method of serial-batching, learning effect, resource-dependent processing times, and setup operations. We consider minimizing the makespan as the objective of the studied problem under the constraint that the total resource consumption does not exceed a given limit. For the special case where the resource allocation is given, we first propose the structural properties for job batching policies and batching sequencing, and an optimal batching policy is derived based on these properties. Then, we develop a novel hybrid GSA–TS algorithm which combines the Gravitational Search Algorithm (GSA) and the Tabu Search (TS) algorithm to solve the general case. Computational experiments with different scales show the effectiveness and efficiency of the proposed algorithm.