Note on a Single-Machine Scheduling Problem with Sum of Processing Times Based Learning and Ready Times

Abstract EN

In the recent 20 years, scheduling with learning effect has received considerable attention.

However, considering the learning effect along with release time is limited.

In light of these observations, in this paper, we investigate a single-machine problem with sum of processing times based learning and ready times where the objective is to minimize the makespan.

For solving this problem, we build a branch-and-bound algorithm and a heuristic algorithm for the optimal solution and near-optimal solution, respectively.

The computational experiments indicate that the branch-and-bound algorithm can perform well the problem instances up to 24 jobs in terms of CPU time and node numbers, and the average error percentage of the proposed heuristic algorithm is less than 0.5%.